5 research outputs found
An ideal multi-secret sharing scheme based on minimal privileged coalitions
How to construct an ideal multi-secret sharing scheme for general access
structures is difficult. In this paper, we solve an open problem proposed by
Spiez et al.recently [Finite Fields and Their Application, 2011(17) 329-342],
namely to design an algorithm of privileged coalitions of any length if such
coalitions exist. Furthermore, in terms of privileged coalitions, we show that
most of the existing multi-secret sharing schemes based on Shamir threshold
secret sharing are not perfect by analyzing Yang et al.'s scheme and Pang et
al.'s scheme. Finally, based on the algorithm mentioned above, we devise an
ideal multi-secret sharing scheme for families of access structures, which
possesses more vivid authorized sets than that of the threshold scheme.Comment: 13page
Computational Soundness of Uniformity Properties for Multi-party Computation based on LSSS
We provide a symbolic model for multi-party computation
based on linear secret-sharing scheme, and prove that this model is com-
putationally sound: if there is an attack in the computational world, then
there is an attack in the symbolic (abstract) model. Our original contri-
bution is that we deal with the uniformity properties, which cannot be
described using a single execution trace, while considering an unbounded
number of sessions of the protocols in the presence of active and adaptive
adversaries