Title :
Lower bounds in secret sharing schemes
Author :
Blundo, Carlo ; De Santis, Alfredo ; Gaggia, Antonio Giorgio ; Vaccaro, Ugo
Author_Institution :
Dipartimento di Inf. ed Applicazioni, Salerno Univ., Italy
fDate :
27 Jun-1 Jul 1994
Abstract :
We study the amount of private information that must be given to participants and the amount of randomness needed to set up secret sharing schemes. These quantities are important from the practical point of view since the security of any systems tends to degrade as the amount of private information increases; moreover, since random bits are a natural (and hard to find) computational resource, the amount of randomness used in the computation is an important issue in the field of randomized algorithms
Keywords :
data privacy; information theory; randomised algorithms; security of data; lower bounds; private information; random bits; randomized algorithms; secret sharing schemes; security; Computer science; Cryptography; Degradation; Entropy; Indium tin oxide; Information rates; Particle measurements; Probability distribution; Q measurement;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.395106
