Key escrow in mutually mistrusting domains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1189, Issue , 1997, Pages 139-153

  Chen, L ^a   Gollmann, D ^a   Mitchell, C J ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

CRYPTOGRAPHIC KEY; DIFFERENT DOMAINS; END-TO-END ENCRYPTION; KEY AGREEMENT; KEY GENERATION PROCESS; KEY MANAGEMENT; THIRD PARTIES; VERIFIABLE SECRET SHARING SCHEME;

NETWORK SECURITY;

EID: 84979022024     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62494-5_14     Document Type: Conference Paper

References (15)

1. National Institute of Standards and Technology. FIPS Publication 185: Escrowed Encryption Standard. February 1994.
2. G. R. Blakley. Safeguarding cryptographic keys. In the Proceedings of AFIPS 1979 NCC, Vol. 48, Arlington, Va., pages 313-317, June 1979.
3. L. Chen, D. Gollmann, and C. Mitchell. Key distribution without individual trusted authentication servers. In Proceedings: the 8th IEEE Computer Security Foundations Workshop, pages 30-36. IEEE Computer Society Press, Los Alamitos, California, June 1995.
4. D. E. Denning and D. K. Branstad. A taxonomy for key escrow encryption systems. Communications of the ACM. 39(3): 34-40, 1996.
5. W. Diffie and M. E. Heilman. New directions in cryptography. IEEE Transactions on Information Theory, 22: 644-654, November 1976.
6. Y. Frankel and M. Yung. Escrow encryption systems visited: attacks, analysis and designs. In D. Coppersmith, editor, Lecture Notes in Computer Science 963, Advances in Cryptology-CRYPTO '95, pages 222-235. Springer-Verlag, 1995.
7. L. Gong. Increasing availability and security of an authentication service. IEEE Journal on Selected Areas in Communications, 11: 657-662, 1993.
8. N. Jefferies, C. Mitchell, and M. Walker. A proposed architecture for trusted third party services. In E. Dawson and J. Golić, editors, Lecture Notes in Computer Science 1029, Cryptography: Policy and algorithms Conference, pages 98-104. Springer-Verlag, 1996.
9. J. Kilian and T. Leighton. Fair cryptosystems, revisited. In D. Coppersmith, editor, Lecture Notes in Computer Science 963, Advances in Cryptology-CRYPTO '95, pages 208-221. Springer-Verlag, 1995.
10. A. K. Lenstra, P. Winkler, and Y. Yacobi. A key escrow system with warrant bounds. In D. Coppersmith, editor, Lecture Notes in Computer Science 963, Advances in Cryptology-CRYPTO '95, pages 197-207. Springer-Verlag, 1995.
11. S. Micali and R. Sidney. A simple method for generating and sharing pseudorandom functions, with applications to clipper-like key escrow systems. In D. Coppersmith, editor, Lecture Notes in Computer Science 963, Advances in Cryptology-CRYPTO '95, pages 185-196. Springer-Verlag, 1995.
12. J. Nechvatal. A public-key based key escrow system. Journal of Systems and Software, to appear October 1996.
13. T. P. Pedersen. Distributed provers with applications to undeniable signatures. In D. W. Davies, editor, Lecture Notes in Computer Science 547, Advances in Cryptology: Proc. Eurocrypt '91, pages 221-238. Berlin: Springer-Verlag, 1991.
14. M. K. Reiter, K. P. Birman, and R. van Renesse. A security architecture for fault-tolerant systems. ACM Transactions on Computer Systems, 12: 340-371, 1994.
15. A. Shamir. How to share a secret. Communications of the ACM, 22: 612-613, 1979.