An ideal multi-secret sharing scheme based on MSP

Authors:
Ching-Fang Hsu;Qi Cheng;Xueming Tang;Bing Zeng
Affiliations:
College of Computer Science & Technology, Huazhong University of Science and Technology, Wuhan 430074, China;Engineering Department, Institute of Wuhan Digital Engineering, Wuhan 430074, China;College of Computer Science & Technology, Huazhong University of Science and Technology, Wuhan 430074, China;College of Computer Science & Technology, Huazhong University of Science and Technology, Wuhan 430074, China
Venue:
Information Sciences: an International Journal
Year:
2011

Citing 22
Cited 3

Communication complexity of secure computation (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An explication of secret sharing schemes

Designs, Codes and Cryptography
Multisecret threshold schemes

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A Construction for Multisecret Threshold Schemes

Designs, Codes and Cryptography
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
Generalized Secret Sharing and Monotone Functions

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Multi-Secret Sharing Schemes

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
On Sharing Many Secrets (Extended Abstract)

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
A practical verifiable multi-secret sharing scheme

Computer Standards & Interfaces
An efficient threshold verifiable multi-secret sharing

Computer Standards & Interfaces
New efficient and practical verifiable multi-secret sharing schemes

Information Sciences: an International Journal
Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves

Computer Communications
Visual secret sharing for multiple secrets

Pattern Recognition
A multisecret sharing scheme for color images based on cellular automata

Information Sciences: an International Journal
Certificateless Threshold Ring Signature

Information Sciences: an International Journal
Efficient threshold proxy signature protocol for mobile agents

Information Sciences: an International Journal
A verifiable multi-secret sharing scheme based on cellular automata

Information Sciences: an International Journal
Strong (n,t,n) verifiable secret sharing scheme

Information Sciences: an International Journal
Multiple ramp schemes

IEEE Transactions on Information Theory
On secret sharing systems

IEEE Transactions on Information Theory
Linear multi-secret sharing schemes based on multi-party computation

Finite Fields and Their Applications

A multi-threshold secret image sharing scheme based on MSP

Pattern Recognition Letters
Recursive hiding of biometrics-based secret sharing scheme using adversary structure

Information Processing Letters
New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

A multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s"1,...,s"m among a set of n participants. In this paper, we propose an ideal linear multi-secret sharing scheme, based on monotone span programs, where each subset of the set of participants may have the associated secret. Our scheme can be used to meet the security requirement in practical applications, such as secure group communication and privacy preserving data mining etc. We also prove that our proposed scheme satisfies the definition of a perfect multi-secret sharing scheme.