Linear multi-secret sharing schemes based on multi-party computation

Authors:
Mulan Liu;Liangliang Xiao;Zhifang Zhang
Affiliations:
Academy of Mathematics and Systems Science, Key Laboratory of Mathematics Mechanization, Chinese Academy of Sciences, Beijing 100080, China;Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;Academy of Mathematics and Systems Science, Key Laboratory of Mathematics Mechanization, Chinese Academy of Sciences, Beijing 100080, China
Venue:
Finite Fields and Their Applications
Year:
2006

Citing 6
Cited 5

Communication complexity of secure computation (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
How to share a secret

Communications of the ACM
Efficient Sharing of Many Secrets

STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Multi-Secret Sharing Schemes

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
General secure multi-party computation from any linear secret-sharing scheme

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
On secret sharing systems

IEEE Transactions on Information Theory

New efficient and practical verifiable multi-secret sharing schemes

Information Sciences: an International Journal
Recursive secret sharing for distributed storage and information hiding

ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
An ideal multi-secret sharing scheme based on MSP

Information Sciences: an International Journal
A novel linear multi-secret sharing scheme for group communication in wireless mesh networks

Journal of Network and Computer Applications
Verifiable multi-secret sharing based on LFSR sequences

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In multi-secret sharing schemes, publishing shares during the process of reconstructing partial secrets may leak some information of the secrets unrecovered yet. By using a multi-party computation (MPC) protocol, we solve this problem for any linear multi-secret sharing scheme (MSSS). We also show that LMSSS usually involve more complicated reconstruction algorithms than ''direct sum'' schemes, but from the point of reducing share expansion, the former is preferred.