A Construction for Multisecret Threshold Schemes

Authors:
Wen-Ai Jackson;Keith M. Martin;Christine M. O'Keefe
Affiliations:
Department of Pure Mathematics, The University of Adelaide, Adelaide SA 5005, Australia;Department of Pure Mathematics, The University of Adelaide, Adelaide SA 5005, Australia;Department of Pure Mathematics, The University of Adelaide, Adelaide SA 5005, Australia
Venue:
Designs, Codes and Cryptography
Year:
1996

Citing 7
Cited 8

An optimal class of symmetric key generation systems

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
An explication of secret sharing schemes

Designs, Codes and Cryptography
Geometric secret sharing schemes and their duals

Designs, Codes and Cryptography
Multisecret threshold schemes

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Contemporary Cryptology: The Science of Information Integrity

Contemporary Cryptology: The Science of Information Integrity
On the Key Predistribution System: A Practical Solution to the Key Distribution Problem

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Perfectly-Secure Key Distribution for Dynamic Conferences

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology

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
An Optimal Multisecret Threshold Scheme Construction

Designs, Codes and Cryptography
Sharing Multiple Secrets: Models, Schemes and Analysis

Designs, Codes and Cryptography
Linear threshold multisecret sharing schemes

ICITS'09 Proceedings of the 4th international conference on Information theoretic security
An ideal multi-secret sharing scheme based on MSP

Information Sciences: an International Journal
Linear threshold multisecret sharing schemes

Information Processing Letters
Lossless and unlimited multi-image sharing based on Chinese remainder theorem and Lagrange interpolation

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A multisecret threshold scheme is a system that protects a number of secrets (or keys) among a group of participants, as follows. Given a set of n participants, there is a secret s_K associated with each k–subset K of these participants. The scheme ensures that s_K can be reconstructed by any group of t participants in K ( 1\leq t\leq k). A lower bound has been established on the amount of information that participants must hold in order to ensure that any set of up to w participants (0 \leq w \leq n-k+t-1) cannot obtain any information about a secret with which they are not associated. In this paper, for parameters t=2 and w=n-k+t-1, we give a construction for multisecret threshold schemes that satisfy this bound.