Incremental cryptography: The case of hashing and signing

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

Volumn 839 LNCS, Issue , 1994, Pages 216-233

  Bellare, Mihir ^a   Goldreich, Oded ^b   Goldwasser, Shafi ^b,c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CRYPTOGRAPHIC PRIMITIVES; INCREMENTAL SCHEME;

CRYPTOGRAPHY;

EID: 85024585723     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48658-5_22     Document Type: Conference Paper

References (17)

1. M. Bellare, J. Kilian and P. Rogaway. The security of cipher block chaining. Advances in Cryptology — Crypto 94 Proceedings.
2. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. Proceedings of the First Annual Conference on Computer and Communications Security, ACM, 1993.
3. M. Bellare, O. Goldreich and S. Gpldwasser. Work in progress.
4. J. Bos and M. Coster. Addition chain heuristics. Advances in Cryptology — Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, Springer-Verlag, G. Brassard, ed., 1989.
5. S. Brands. An efficient off-line electronic cash system based on the representation problem. CWI Technical Report CS-R9323.
6. D. Chaum and H. Van Antwerpen. Undeniable signatures. Advances in Cryptology — Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, Springer-Verlag, G. Brassard, ed., 1989.
7. D. Chaum, E. Heijst and B. Pfitzmann. Cryptographically strong undeniable signatures, unconditionally secure for the signer. Advances in Cryptology — Crypto 91 Proceedings, Lecture Notes in Computer Science Vol. 576, Springer-Verlag, J. Feigenbaum, ed., 1991.
8. Croft and Harris. Public key cryptography and re-usable shared secrets. In Cryptography and Coding, Clarendon Press, 1989.
9. I. Damgård. Collision free hash functions and public key signature schemes. Advances in Cryptology — Eurocrypt 87 Proceedings, Lecture Notes in Computer Science Vol. 304, Springer-Verlag, D. Chaum, ed., 1987.
10. T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Info. Theory, Vol. IT 31, 1985.
11. S. Even, O. Goldrech and S. Micali. On-line/Off line digital signatures. Manuscript. Preliminary version in Crypto 89.
12. O. Goldreich and L. Levin. A hard predicate for all one-way functions. Proceedings of the Twenty First Annual Symposium on the Theory of Computing, ACM, 1989.
13. 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, April 1988.
14. R. Impagliazzo, L. Levin and M. Luby. Pseudo-random generation from one-way functions. Proceedings of the Twenty First Annual Symposium on the Theory of Computing, ACM, 1989.
15. M. Naor and M. Yung. Universal One-Way Hash Functions and their Cryptographic Applications. Proceedings of the Twenty First Annual Symposium on the Theory of Computing, ACM, 1989.
16. R. Rivest. The MD5 message-digest algorithm. IETF Network Working Group, RFC 1321, April 1992.
17. C. Schnorr. Efficient identification and signatures for smart cards. Advances in Cryptology — Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, Springer-Verlag, G. Brassard, ed., 1989.