Randomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Responsive Security for Stored Data
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Sharing Multiple Secrets: Models, Schemes and Analysis
Designs, Codes and Cryptography
A Strong Ramp Secret Sharing Scheme Using Matrix Projection
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
A lower bound on the encoding length in lossy transmission
Information Sciences: an International Journal
An efficient dispersal and encryption scheme for secure distributed information storage
ICCS'03 Proceedings of the 2003 international conference on Computational science
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
| Hi-index | 754.84 |
A (t,k,n,S) ramp scheme is a protocol to distribute a secret s chosen in S among a set P of n participants in such a way that: (1) sets of participants of cardinality greater than or equal to k can reconstruct the secret s; (2) sets of participants of cardinality less than or equal to t have no information on s, whereas (3) sets of participants of cardinality greater than t and less than k might have “some” information on s. In this correspondence we analyze multiple ramp schemes, which are protocols to share many secrets among a set P of participants, using different ramp schemes. In particular, we prove a tight lower bound on the size of the shares held by each participant and on the dealer's randomness in multiple ramp schemes