Addressing the Problem of Undetected Signature Key Compromise

Proceedings of the Symposium on Network and Distributed System Security, NDSS 1999

Volumn , Issue , 1999, Pages

  Just, Mike ^a,b   Van Oorschot, Paul C ^a  

^a Entrust Technologies   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

digital signatures; key compromise detection; second level authentication; timestamping

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK SECURITY;

ATTACK DETECTION; INFORMATION SHARED; KEY COMPROMISE; KEY COMPROMIZE DETECTION; PRIVATE KEY; SECOND LEVEL; SECOND LEVEL AUTHENTICATION; SIGNING ALGORITHM; TIMESTAMPING; TRUSTED AUTHORITIES;

AUTHENTICATION;

EID: 33745709845     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. ANSI X9.57, "Public Key Cryptography for the Financial Services Industry: Certificate Management", American National Standard for Financial Services, February, 1997.
2. Daniel Bleichenbacher, "Generating ElGamal Signatures Without Knowing the Secret Key", Advances in C'ryptology: Eurocrypi '96, Springer-Verlag, pp. 10-18, 1996.
3. Dan Boneh, Richard A. Demillo, Richard J. Lipton, "On the Importance of Checking Cryptographic Protocols for Faults", Advances in C'ryptology: Eurocrypi '97, pp. 37-51, 1997.
4. R. C'anetti, S. Halevi, A. Herzberg, "Maintaining Authenticated Communication in the Presence of Break-ins", in Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, 1997.
5. Y. Desmedt, "Threshold Cryptography", European Transactions on Telecommunications, Vol. 5, No. 4, pp. 449-457, July, 1994.
6. D. Davies, W. Price, Security for Computer Networks, John Wiley & Sons, 2nd edition, 1989.
7. FIPS 186, "Digital Signature Standard", Federal Information Processing Standards Publication 185, U.S. Department of Commerce/N.I.S.T., National Technical Information Service, Springfield, Virginia, 1994.
8. N. Gershenfeld, I. Chuang, "Quantum Computing with Molecules", Scientific American, June, 1998.
9. S. Haber, W.S. Stornetta, "How to Time-Stamp a Digital Document", Journal of C'ryptology, Vol. 3, No. 2, pp. 99-111, 1991.
10. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, "Proactive Public Key and Signature Systems", in Proceedings of the 4th ACM Conference on Computer and Communications Security, 1997.
11. JTU-T Recommendation X.509, "The Directory-Authentication Framework" International Telecommunication Union, Geneva, Switzerland, November, 1993. (equivalent to ISO/IEC 9594-8:1990&1995)
12. Mike Just, "Some Timestamping Protocol Failures", Proceedings of the 1998 Symposium on Network and Distributed System Security, pp. 89-96, March 1998.
13. Paul Kocher, "Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems", Advances in C'ryptology: Crypto '96, pp. 104-113, Springer-Verlag.
14. Paul Kocher, J. Jaffe, B. Jun, "Differential Power Analysis", available from http://www.cryptography.com/dpa/.
15. L. Lamport, "Password Authentication with Insecure Communication", Communications of the A CM, 24, pp. 770-772, 1981.
16. A. Menezes, P. van Oorschot, S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.
17. M. Myers, R. Ankney, "Internet Public Key Infrastructure Online Certificate Status Protocol - OCSP", IETF PKIX Working Group Internet Draft, February 1998 (work in progress).
18. H. Ong, C.P. Schnorr, A. Shamir, "An Efficient Signature Scheme Based on Quadratic Equations", Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 208-216, 1984.
19. 2 = m (mod n)", IEEE Transactions on Information Theory, Vol. 33, pp. 702-709, 1987.
20. Carl Pomerance, "Factoring", in C'ryptology and Computational Number Theory, American Mathematical Society, ed. Carl Pomerance, pp. 27-47, 1990.
21. R. Rivest, A. Shamir, L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key C'ryp-tosystems", Communications of the ACM, 21, pp. 120-126, 1978.
22. Peter W. Shor, "Algorithms for Quantum Computation: Discrete Logarithms and Factoring", Proceedings of the 26th Symposium on Theory of Computing (STOG), Montreal, Canada, pp. 124-134, 1994.