Abstract
A (g, b) key distribution scheme allows conferences of g users to generate secret keys, so that disjoint coalitions of b users cannot gain any information on the key (in the information theoretic sense). In this work we study the relationships between interaction and space efficiency of key distribution schemes. We prove that interaction does not help in the context of unrestricted schemes. On the other hand, we show that for restricted schemes, which are secure for a limited number of conferences, interaction can substantially improve the space efficiency.
Supported by the Fund for the Promotion of Research at the Technion.
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.
References
R. Blom. An Optimal Class of Symmetric Key Generation Systems. In T. Beth, N. Cot, and I. Ingemarsson, editors, Advances in Cryptology — proceeding of Eurocrypt 84, volume 209 of Lecture notes in computer Science, pages 335–338. Springer-Verlag, 1984.
C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-Secure Key Distribution for Dynamic Conferences. In Advances in Cryptology-CRYPTO’ 92 proceeding, 1992.
W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, 22(6):644–654, 1976.
A. Fiat and M. Naor. Broadcast Encryption. In Advances in Cryptology-CRYPTO’ 93 proceeding, 1993.
M. J. Fischer, M. S. Paterson, and C. Rackoff. Secure Bit Exchange Using a Random Deal of Cards. In Distributed Computing and Cryptography, pages 173–181. AMS, 1991.
M. J. Fischer and R. N. Wright. Multiparty Secret Key Exchange Using a Random Deal of Cards. In J. Feigenbaum, editor, Advances in Cryptology — proceeding of CRYPTO 91, volume 576 of Lecture notes in computer Science, pages 141–155. Springer-Verlag, 1992.
L. Gong and D. J. Wheeler. A matrix Key-Distribution Scheme. Journal of Cryptology, 2:51–59, 1990.
T. Matsumoto and I. Imai. On the Key Predistribution Systems: A Practical Solution to the key Distribution Problem. In C. Pomerance, editor, Advances in Cryptology — proceeding of CRYPTO 87, volume 293 of Lecture notes in computer Science, pages 185–193. Springer-Verlag, 1988.
E. Okamoto and K. Tanaka. Key Distribution System Based on Identification Information. IEEE Journal on Selected Areas in Communications, 7(4):481–485, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beimel, A., Chor, B. (1994). Interaction in Key Distribution Schemes. In: Stinson, D.R. (eds) Advances in Cryptology — CRYPTO’ 93. CRYPTO 1993. Lecture Notes in Computer Science, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48329-2_38
Download citation
DOI: https://doi.org/10.1007/3-540-48329-2_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57766-9
Online ISBN: 978-3-540-48329-8
eBook Packages: Springer Book Archive