Abstract
It is infeasible in large networks for every individual to have his own key. In a group oriented society, public keys are needed for communications between one organization and another. The organization might also want the supervisors to read some of the messages received by the employees. In the case of urgent messages, the organization may want any member to be able to read it [3]. This paper proposes a method in which individuals at separate organizations can communicate without the advance coordination of keys between the individuals. Thus, reducing the number of keys needed to communicate between two organizations. Also, the destination company can create its own policy on who can read messages and the type of public, or conventional, key system used within organization, without any involvement with the sending organization. This system will solve one of the many problems presented in [3].
Chapter PDF
Similar content being viewed by others
References
G. R. Blakley. Safeguarding cryptographic keys. In Proc. Nat. Computer Conf. AFIPS Conf. Proc., pages 313–317, 1979. vol.48.
G.I. Davida and B.J. Matt. Arbitration in tamper proof systems. In C. Pomerance, editor, Advances in Cryptology, Proc. of Crypto’87 (Lecture Notes in Computer Science 293), pages 216–223. Springer-Verlag, 1988. Santa Barbara, California, U.S.A., August 16–20.
Y. Desmedt. Society and group oriented cryptography: a new concept. In C. Pomerance, editor, Advances in Cryptology, Proc. of Crypto’87 (Lecture Notes in Computer Science 293), pages 120–127. Springer-Verlag, 1988. Santa Barbara, California, U.S.A., August 16–20.
Y. Desmedt and J.-J. Quisquater. Public key systems based on the difficulty of tampering (Is there a difference between DES and RSA?). In A. Odlyzko, editor, Advances in Cryptology, Proc. of Crypto’86 (Lecture Notes in Computer Science 263), pages 111–117. Springer-Verlag, 1987. Santa Barbara, California, U.S.A., August 11–15.
W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory. IT-22(6):644–654, November 1976.
E. Kranakis. A class of cryptosystems equivalent to RSA. Dept. of Computer Science, Yale Univ. tech report 315, April 1984.
R. L. Rivest, A. Shamir. and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Commun. ACM, 21:294–299, April 1978.
A. Shamir. How to share a secret. Commun. ACM, 22:612–613, November 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frankel, Y. (1990). A Practical Protocol for Large Group Oriented Networks. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_8
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive