Generalized linear threshold scheme
Proceedings of CRYPTO 84 on Advances in cryptology
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Communications of the ACM
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
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
On the Information Rate of Secret Sharing Schemes (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Sharing one secret vs. sharing many secrets
Theoretical Computer Science - Mathematical foundations of computer science
Sharing Multiple Secrets: Models, Schemes and Analysis
Designs, Codes and Cryptography
Strongly secure ramp secret sharing schemes for general access structures
Information Processing Letters
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Strongly secure ramp secret sharing schemes for general access structures
Information Processing Letters
A method for sending confidential messages to a group without trusted parties
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Journal of Combinatorial Optimization
An ideal multi-secret sharing scheme based on MSP
Information Sciences: an International Journal
Proceedings of the 4th international conference on Security of information and networks
Ideal secret sharing schemes with share selectability
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Parallel multi-party computation from linear multi-secret sharing schemes
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Research note: An on-line secret sharing scheme for multi-secrets
Computer Communications
Linear multi-secret sharing schemes based on multi-party computation
Finite Fields and Their Applications
Sharing many secrets with computational provable security
Information Processing Letters
| Hi-index | 0.01 |
A multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s1,..., sm among a set of participants P. In this paper we put forward a general theory of multi-secret sharing schemes by using an information theoretical framework. We prove lower bounds on the size of information held by each participant for various access structures. Finally, we prove the optimality of the bounds by providing protocols.