Abstract
In a society oriented cryptography it is better to have a public key for the company (organization) than having one for each individual employee [Des88]. Certainly in emergency situations, power is shared in many organizations. Solutions to this problem were presented [Des88], based on [GMW87], but are completely im- practical and interactive. In this paper practical non-interactive public key systems are proposed which allow the reuse of the shared secret key since the key is not revealed either to insiders or to outsiders.
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
C. Asmuth and J. Bloom. A modular approach to key safeguarding. Technical report, Math Dept., Texas A & M Univ., College Station, Tx., 1980.
G. R. Blakley. Safeguarding cryptographic keys. In Proc. Nat. Computer Conf. AFIPS Conf. Proc, pages 313–317, 1979. vol.48.
I. F. Blake, P. C. van Oorschot, and S. Vanstone. Complexity issues for public key cryptography. In J. K. Skwirzynski, editor, Performance Limits in Communication, Theory and Practice, NATO ASI Series E: Applied Sciences-VoL 142, pages 75–97. Kluwer Academic Publishers, 1988. Proceedings of the NATO Advanced Study Institute II Ciocco, Castelvecchio Pascoli, Tuscany, Italy, July 7–19, 1986.
D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM, 24(2):84–88, February 1981.
D. Chaum. The dining cryptographers problem: unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65–75, 1988.
D. E. R. Denning. Cryptography and Data Security. Addison — Wesley, Reading, Mass., 1982.
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.
W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory, IT-22(6):644–654, November 1976.
T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory, 31:469–472, 1985.
Y. Frankel. A practical protocol for large group oriented networks. Presented at Eurocrypt’89, Houthalen, Belgium, to appear in: Advances in Cryptology. Proc. of Eurocrypt’89 (saLecture Notes in Computer Science), Springer-Verlag, April 1989.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. Siam J. Comput., 18(1):186–208, February 1989.
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the Nineteenth ACM Symp. Theory of Computing, STOC, pages 218–229, May 25–27, 1987.
L. C. Guillou and J. J. Qisquater. A “pardoxical” identity-based signature scheme resulting from zero-knowledge. Presented at Crypto’88, Santa Barbara, California, U.S.A., to appear in: Advances in Cryptology. Proc. of Crypto’88 (saLecture Notes in Computer Science), Springer-Verlag, August 1988.
R.C. Mullin I.F. Blake, R. Fuji-Hara and S.A. Vanstone. Computing logrithms in a finite field of characteristic two. SIAM J. Alg. Disc. Meth., 5:276–285, 1985.
N. Koblitz. A Course in Number Theory and Cryptology. Springer-Verlang, 1987.
A. M. Odlyzko. Discrete logs in a finite field and their cryptographic significance. In N. Cot T. Beth and I. Ingemarsson, editors, Advances in Cryptology, Proc. of Eurocrypt’84 (Lecture Notes in Computer Science 209), pages 224–314. Springer-Verlag, 1984. Paris, France April 1984.
A. Shamir. How to share a secret. Commun. ACM, 22:612–613, November 1979.
G. J. Simmons. How to (really) share a secret. Presented at Crypto’88, Santa Barbara, California, U.S.A., to appear in: Advances in Cryptology. Proc. of Crypto’88 (saLecture Notes in Computer Science), Springer-Verlag, August 1988.
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
Desmedt, Y., Frankel, Y. (1990). Threshold cryptosystems. In: Brassard, G. (eds) Advances in Cryptology — CRYPTO’ 89 Proceedings. CRYPTO 1989. Lecture Notes in Computer Science, vol 435. Springer, New York, NY. https://doi.org/10.1007/0-387-34805-0_28
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_28
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97317-3
Online ISBN: 978-0-387-34805-6
eBook Packages: Springer Book Archive