Proactive Two-Party Signatures for User Authentication

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

Volumn , Issue , 2003, Pages

  Nicolosi, Antonio ^a   Krohn, Maxwell ^a   Dodis, Yevgeniy ^a   Mazières, David ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; NETWORK SECURITY;

AUDIT TRAILS; AUTHENTICATION MECHANISMS; FILESYSTEM; PUBLIC KEYS; RANDOM ORACLE MODEL; RSA ASSUMPTION; SECRET KEY; SIGNATURE GENERATION; SIGNATURE SCHEME; USER AUTHENTICATION;

AUTHENTICATION;

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

References (37)

1. M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko. The one-more-RSA-inversion problems and the security of Chaum’s blind signature scheme. Available as IACR eprint archive Report 2001/002, http://eprint.iacr.org/2001/002/, January 2001.
2. M. Bellare and G. Neven. Transitive signatures based on factoring and RSA. In Advances in Cryptology—AsiaCrypt’02, 2002. To appear.
3. M. Bellare and A. Palacio. GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks. In Advances in Cryptology—Crypto’02, volume 2442 of Lecture Notes in Computer Science, pages 162–177, Berlin, 2002. Springer-Verlag.
4. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the First ACM Conference on Computer and Communications Security, pages 62–73, Fairfax, VA, 1993.
5. M. Bellare and P. Rogaway. The exact security of digital signatures—how to sign with RSA and Rabin. In U. Maurer, editor, Advances in Cryptology—Eurocrypt 1996, volume 1070 of Lecture Notes in Computer Science, pages 399–416. Springer-Verlag, 1996.
6. M. Bellare and R. Sandhu. The security of practical two-party RSA signature schemes. Available as IACR eprint archive Report 2001/060, http://eprint.iacr.org/2001/060/, July 2001.
7. D. Bleichenbacher. Generating ElGamal signatures without knowing the secret key. In Advances in Cryptology—EuroCrypt’96, volume 1070 of Lecture Notes in Computer Science, pages 10–18, Berlin, 1996. Springer-Verlag.
8. M. Blum. Coin flipping by telephone. In IEEE Spring COMPCOM, pages 133–137, 1982.
9. A. Boldyreva. Efficient threshold signature, multisignature and blind signature schemes based on the gap-diffie-hellman-group signature scheme. Available as IACR eprint archive Report 2002/118, http://eprint.iacr.org/2002/118/, 2002.
10. C. Boyd. Digital multisignatures. In IMA Conference on Cryptography and Coding, pages 241–246. Oxford University Press, 1989.
11. J.-S. Coron. Optimal security proofs for PSS and other signature schmes. In Advances in Cryptology—EuroCrypt’02, volume 2332 of Lecture Notes in Computer Science, pages 272–287, Berlin, 2002. Springer-Verlag.
12. I. Damgård and J. Nielsen. Perfect hiding and perfect binding commitment schemes with constant expansion factor. In Advances in Cryptology—Crypto’02, volume 2442 of Lecture Notes in Computer Science, pages 581–596, Berlin, 2002. Springer-Verlag.
13. Y. Dodis, J. Katz, S. Xu, and M. Yung. Strong key-insulated signature schemes. Unpublished Manuscript, 2002.
14. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology—Crypto’86, volume 263 of Lecture Notes in Computer Science, pages 186–194, Berlin, 1987. Springer-Verlag.
15. FIPS 180-1. Secure Hash Standard. U.S. Department of Commerce/N.I.S.T., National Technical Information Service, Springfield, VA, April 1995.
16. FIPS 186. Digital Signature Standard. U.S. Department of Commerce/N.I.S.T., National Technical Information Service, Springfield, VA, 1994.
17. Y. Frankel, P. Gemmell, P. MacKenzie, and M. Yung. Proactive RSA. In Advances in Cryptology—Crypto’97, volume 1294 of Lecture Notes in Computer Science, pages 440–454, Berlin, 1997. Springer-Verlag.
18. R. Ganesan. Yaksha: Augmenting kerberos with public-key cryptography. In Proceedings of the ISOC Network and Distributed Systems Security Symposium, pages 132–143, 1995.
19. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing, 17(2):281–308, 1988.
20. L. Guillou and J.-J. Quisquater. A”paradoxical” identity-based signature scheme resulting from zero-knowledge. In Advances in Cryptology—Crypto’88, volume 403 of Lecture Notes in Computer Science, pages 216–231, Berlin, 1988. Springer-Verlag.
21. A. Herzberg, M. Jacobsson, S. Jarecki, H. Krawczyk, and M. Yung. Proactive public key and signature schemes. In Fourth ACM Conference on Computer and Communication Security, pages 100–110. ACM, 1997.
22. J. H. Howard, M. L. Kazar, S. G. Menees, D. A. Nichols, M. Satyanarayanan, R. N. Sidebotham, and M. J. West. Scale and performance in a distributed file system. ACM Transactions on Computer Systems, 6(1):51–81, February 1988.
23. G. Itkis and L. Reyzin. Forward-secure signature with optimal signing and verifying. In Advances in Cryptology—Crypto’01, volume 2139 of Lecture Notes in Computer Science, pages 332–354, Berlin, 2001. Springer-Verlag.
24. G. Itkis and L. Reyzin. SiBIR: Signer-base intrusion-resilient signatures. In Advances in Cryptology—Crypto’02, volume 2442 of Lecture Notes in Computer Science, pages 499–514, Berlin, 2002. Springer-Verlag.
25. P. MacKenzie and M. Reiter. Delegation of cryptographic servers for capture-resilient devices. In Eight ACM Conference on Computer and Communication Security, pages 10–19. ACM, 2001. Full version available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2001/2001-37.ps.gz.
26. P. MacKenzie and M. Reiter. Networked cryptographic devices resilient to capture. In Proceedings of the 2001 IEEE Symposium on Security and Privacy, 2001.
27. P. MacKenzie and M. Reiter. Two-party generation of DSA signature. In Advances in Cryptology—Crypto’01, volume 2139 of Lecture Notes in Computer Science, pages 137–154, Berlin, 2001. Springer-Verlag.
28. D. Mazières, M. Kaminsky, M. F. Kaashoek, and E. Witchel. Separating key management from file system security. In Proceedings of the 17th ACM Symposium on Operating Systems Principles, pages 124–139, Kiawa Island, SC, 1999. ACM.
29. R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, pages 51–59, 1991.
30. D. Pointcheval and J. Stern. Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology, 13(3):361–396, 2000.
31. C. Schnorr. Efficient identification and signature for smart cards. In Advances in Cryptology—Crypto’89, volume 435 of Lecture Notes in Computer Science, pages 235–251, Berlin, 1990. Springer-Verlag.
32. C. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161–174, 1991.
33. J. G. Steiner, B. C. Neuman, and J. I. Schiller. Kerberos: An authentication service for open network systems. In Proceedings of the Winter 1988 USENIX, pages 191–202, Dallas, TX, February 1988. USENIX.
34. H. C. Williams. A modification of the RSA public-key encryption procedure. IEEE Transactions on Information Theory, IT-26(6):726–729, November 1980.
35. T. Wu. The secure remote password protocol. In Proceedings of the 1998 Internet Society Network and Distributed System Security Symposium, pages 97–111, San Diego, CA, March 1998.
36. A. Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 162–167, 1986.
37. T. Ylönen. SSH – secure login connections over the Internet. In Proceedings of the 6th USENIX Security Symposium, pages 37–42, San Jose, CA, July 1996.