Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs

Authors:
Mulan Liu;Liangliang Xiao;Zhifang Zhang
Affiliations:
Chinese Acad. of Sci., Beijing;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 3

Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

SIAM Journal on Discrete Mathematics
Secret sharing schemes based on graphical codes

Cryptography and Communications

Quantified Score

Hi-index	754.84

Visualization

Abstract

The multiplicative property is important for a linear secret sharing scheme (LSSS) to be used in constructing a multiparty computation (MPC) protocol. In general, an LSSS has to expand its share size to obtain the multiplicative property. In this paper, with respect to an MPC problem based on connectivity of graphs we devise an ideal multiplicative LSSS, that is, the LSSS is of the multiplicative property without expanding its share size. Moreover, it provides a new class of access structures that have ideal multiplicative LSSSs.