Abstract
Recently, there has been a surge of interest in key-escrow systems, from the popular press to the highest levels of governmental policy-making. Unfortunately, the field of key-escrow has very little rigorous foundation, leaving open the possibility of a catastrophic security failure. As an example, we demonstrate a critical weakness in Micali’s Fair Public Key Cryptosystem (FPKC) protocols. Micali’s FKPC protocols have been licensed to the United States Government for use with the Clipper project, and were considered to be a leading contender for software-based key escrow. In the paper, we formally model both the attack and what it means to defend against the attack, and we present an alternative protocol with more desirable security properties.
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
T. Beth. Zur diskussion gestellt. Informatik-Spektrum, 13(4):204–215, 1990.
G. Blakley. Safeguarding cryptographic keys. In AFIPS — Conference Proceedings, 48:313–317, June 1979.
J. F. Boyar, S. A. Kurtz, and M. W. Krentel. A discrete logarithm implementation of perfect zero-knowledge blobs. Journal of Cryptology, 2(2):63–76, 1990.
Brassard, G. (1988). Modern Cryptology; A Tutorial. Lecture Notes in Computer Science, No. 325 Springer Verlag.
G. Brassard, D. Chaum and C. Crépean. Minimum Disclosure Proofs of Knowledge. In JCSS, pages 156–189. 1988.
B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 383–395, 1985.
Denning, D. E. (1982). Cryptography and Data Security. Massachusetts: Addison-Wesley.
Y. Desmedt. Abuses in cryptography and how to fight them. Crypto’ 88, pages 375–389, August 1988.
Y. Desmedt, C. Goutier, and S. Bengio. Special uses and abuses of the Fiat-Shamir passport protocol. Crypto’ 87, pages 21–39, August 1987.
Y. Desmedt and M. Yung. Minimal Cryptosystems and Defining Subliminal Freeness In Symposium on Information Theory, 1994.
P. Feldman. A practical scheme for non-interactive verifiable secret sharing. Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 427–437, 1987.
G. Harper, A. Menezes and S. Vanstone. Public-key Cryptosystems with Very Small Key Lengths. Eurocrypt’ 92, pages 163–173, May 1992.
Karnin, Greene and Hellman. On secret Sharing Systems, IEEE Transactions on Information Theory, vol. 29, 1983.
T. Leighton. Failsafe key escrow systems. Technical Memo 483, MIT Lab. for Computer Science, August 1994.
T. Leighton and S. Micali. Secret key distribution without public-key cryptography. Crypto’ 93, August 1993.
S. Micali. Fair public-key cryptosystems. Technical Report 579, MIT Lab. for Computer Science, September 1993.
Oren. On the cheating power of cunning verifiers. Proceedings of the 28th FOCS, IEEE, 1987.
T. P. Pedersen. Distributed provers with applications to undeniable signatures. Eurocrypt’ 91, April 1991.
Schneier, B. (1993). Applied Cryptography. John Wiley.
A. Shamir. How to share a secret. Communications of the ACM, 22(11):612–613, 1979.
G. J. Simmons. The prisoners’ problem and the subliminal channel. Crypto’ 83, pages 51–67, August 1983.
G. J. Simmons. The subliminal channel and digital signatures. Eurocrypt’ 84, pages 364–378, April 1984.
G. Simmons. A secure subliminal channel (?). Crypto’ 85, pages 33–41, August 1985.
G. J. Simmons. How to really share a secret. Crypto’ 90, pages 390–448, August 1990.
Simmons, G. (1991). Contemporary Cryptology. IEEE Press.
G. J. Simmons. Subliminal communication is easy using the DSA. Eurocrypt’ 93, pages 218–232, May 1993.
Y. Yacobi. Discrete-log with compressible exponents. Crypto 90, pages 639–643, August 1990.
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
Kilian, J., Leighton, T. (1995). Fair Cryptosystems, Revisited. 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_17
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_17
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