Auto-recoverable auto-certifiable cryptosystems

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

Volumn 1403, Issue , 1998, Pages 17-31

  Young, Adam ^a   Yung, Moti ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b CertCo LLC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY;

KEY ESCROW; PRIVATE KEY; PUBLIC KEY INFRASTRUCTURE; PUBLIC KEY SYSTEMS; PUBLIC KEYS; TAMPER RESISTANT;

CRYPTOGRAPHY;

EID: 84957673202     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054114     Document Type: Conference Paper

References (24)

1. [DB96] D. Denning, D. Branstad. A Taxonomy for Key Escrow Encryption Systems. In volume 39, n. 3 of Communications of the ACM, 1996.
2. [DDFY] A. De Santis, Y. Desmedt, Y. Frankel, M. Yung. How to Share a Function Securely. In ACM Symp. on Theory of Computing, pages 522-533, 1994.
3. [DH76] W. Diffie, M. Heilman. New Directions in Cryptography. In volume IT-22, n. 6 of IEEE Transactions on Information Theory, pages 644-654, Nov. 1976.
4. [Du78] U. Dudley. Elementary Number Theory. 2nd edition, pages 36, 37, 75, 1978. W. H. Freeman and Co.
5. [E1G85] T. ElGamal. A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In CRYPTO ’84, pages 10-18.
6. [FD89] Y. Frankel, Y. Desmedt. Threshold Cryptosystems. In CRYPTO ’89, pages 307-315.
7. [Fr94] J. B. Fraleigh. A First Course in Abstract Algebra. 5th edition, Theorem 1.9, page 76, 1993. Addison Wesley.
8. [FS86] A. Fiat, A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In CRYPTO ’86, pages 186-194.
9. [FY95] Y. Frankel, M. Yung. Escrow Encryption Systems Visited: Attacks, Analysis and Designs. In CRYPTO ’95, pages 222-235
10. [FY97] Y. Frankel, M. Yung. On characterization of Escrow Encryption Schemes. In ICALP ’97.
11. [GHY85] Z. Galil, S. Haber, M. Yung. Symmetric public-key encryption. In CRYPTO ’85, pages 128-137.
12. [GMR85] S. Goldwasser, S. Micali, C. Rackoff. The knowledge complexity of interactive proof-systems. In ACM Symp. Theory of Computing, 1985.
13. [JMW96] N. Jefferies, C. Mitchell, M. Walker. A Proposed Architecture for Trusted Third Party Services. In Cryptography: Policy and Algorithms, LNCS 1029.
14. [K-S] H. Abelson, R. Anderson, S. Bellovin, J. Benaloh, M. Blaze, W. Diffie, J. Gilmore, P. Neumann, R. Rivest, J. Schiller, B. Schneier. The Risks of Key Recovery, Key Escrow, and Trusted Third-Party Encryption, available at http://www.crypto.com/key.study
15. [KL95] J. Kilian and F.T. Leighton. Fair Cryptosystems Revisited. In CRYPTO ’95, pages 208-221, 1995. Springer-Verlag.
16. [Koh78] L. Kohnfelder. A Method for Certification. MIT Lab. for Computer Science, Cambridge Mass., May 1978.
17. [LMS] J. Lacy, D. Mitchell, W. Schell. CryptoLib: Cryptography in Software. AT and T Bell Laboratories, version 1.2.
18. [LWY95] A. Lenstra, P. Winkler, Y. Yacobi. A Key Escrow System with Warrant Bounds. In CRYPTO ’95, pages 197-207, 1995.
19. [Mi92] S. Micali. Fair Public-Key Cryptosystems. In CRYPTO ’92, pages 113-138, 1992. Springer-Verlag.
20. [Ro93] K. R. Rosen. Elementary Number Theory and its Applications. 3rd edition, Theorem 8.14, page 295, 1993. Addison Wesley.
21. [VT97] E. Verheul, H. van Tilborg. Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals. In Eurocrypt ’97, pages 119-133, 1997.
22. [YY96] A. Young, M. Yung. The Dark Side of Black-Box Cryptography. In CRYPTO ’96, pages 89-103
23. [YY97a] A. Young, M. Yung. Kleptography: Using Cryptography against Cryptography. In Eurocrypt ’97, pages 62-74.
24. [YY97b] A. Young, M. Yung. The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems. In CRYPTO ’97, pages 264-276.