Abstract
A single transmitter wishes to broadcast a secret to some subset of his listeners. He does not wish to perform, for each of the intended recipients, a separate encryption either of the secret or of a single key with which to protect the secret. A general method for such a secret broadcasting scheme is proposed. It is based on “k out of n” secret sharing. An example using polynomial interpolation is presented as well as a related vector formulation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
List of References
Blakley, G. R., “Safegaurding Cryptographic Keys,” Proceedings of the, AFIPS 1979 National Computer Conference, Vol. 48, June 1979, pp. 313–317.
Brickell, E. F., “Some Ideal Secret Sharing Schemes,” Third Carbondale Combinatorics Conference, Carbondale, IL, J. Combinatorial Mathematics and Combinatorial Computing, Vol. 6, 1989, pp. 105–113.
Chiou, G. C. and W. C. Chen, “Secure Broadcasting Using the Secure Lock,” IEEE Transactions on Software Engineering, Vol. SE-15, No. 8, Aug. 1989, pp. 929–934.
Shamir, A., “How to Share a Secret,” Communications of the ACM, Vol. 22, No. 11, November 1979, pp. 612–613.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berkovits, S. (1991). How To Broadcast A Secret. In: Davies, D.W. (eds) Advances in Cryptology — EUROCRYPT ’91. EUROCRYPT 1991. Lecture Notes in Computer Science, vol 547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46416-6_50
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54620-7
Online ISBN: 978-3-540-46416-7
eBook Packages: Springer Book Archive