Abstract
We propose a key escrow system that permits warrants for the interception and decryption of communications for arbitrary time periods, and with either one or two communicating parties specified as the target. The system is simple and practical, and affords reasonable protection against misuse. We argue that use of such a system can produce both greater privacy protection and more effective law enforcement than we now enjoy.
Research done at Bellcore
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
Administrative Office of the United States Courts, 1993, Report on Applications for Orders Authorizing or Approving the Interception of Wire, Oral, or Electronic Communications (Wiretap Report), 1993.
M. Blaze, “Protocol Failure in the Escrowed Encryption Standard,” Proceedings of the 2nd ACM Conference on Computer and Communications Security, November 1994, pp. 59–67.
E. Brickell, D. Denning, S. Kent, D. Maher, and W. Tuchman, “SKIPJACK Review: Interim Report, The SKIPJACK Algorithm,” July 28, 1993, available electronically from cpsr.org.
Department of Justice Briefing re Escrowed Encryption Standard, Department of Commerce, February 4 1994, Washington, DC.
A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung, “How to Share a Function Securely,” Proc. STOC’94, 1994, pp. 522–533.
S. Even, A. Selman, and Y. Yacobi, “The Complexity of Promise Problems with Applications to Public Key Cryptography,” Information and Control, Vol. 61, No. 2, May 1984.
J. Kilian and T. Leighton, “Failsafe Key Escrow,” presented at Rump Crypto’94.
B. Lloyd, W. Simpson, “PPP authentications protocols”, Internet Request for Comments 1334 (1992).
S. Micali, “Fair public key cryptosystems,” Proc. Crypto’92.
National Institute of Standards and Technology, Federal Information Processing Standards Publication 185, Escrowed Encryption Standard, February 9 1994, Washington, DC.
T.P. Pedersen, “Distributed provers with application to undeniable signatures,” Proc. Eurocrypt’91, Springer-Verlag LNCS 547, pp 221–238.
R. Rivest, “Responses to NIST’s Proposal,” Communications of the ACM, Vol. 35(7), July 1992, pp. 41–47.
Y. Yacobi, “A key distribution “paradox”,” Proc. Crypto’90, Springer-Verlag LNCS 537, 1991, pp. 268–273.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lenstra, A.K., Winkler, P., Yacobi, Y. (1995). A Key Escrow System with Warrant Bounds. In: Coppersmith, D. (eds) Advances in Cryptology — CRYPT0’ 95. CRYPTO 1995. Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44750-4_16
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60221-7
Online ISBN: 978-3-540-44750-4
eBook Packages: Springer Book Archive