DocumentCode
1522726
Title
Multiple ramp schemes
Author
De Santis, Alfredo ; Masucci, Barbara
Author_Institution
Dipt. di Inf. ed Applicazioni, Salerno Univ., Italy
Volume
45
Issue
5
fYear
1999
fDate
7/1/1999 12:00:00 AM
Firstpage
1720
Lastpage
1728
Abstract
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
Keywords
cryptography; protocols; security of data; cardinality; cryptography; multiple ramp schemes; participants set; protocol; randomness; secret sharing; tight lower bound; Battery charge measurement; Books; Cryptographic protocols; Cryptography; Data security; Degradation; Indium tin oxide; Information security; Missiles;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.771255
Filename
771255
Link To Document