Practice-oriented provable-security

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

Volumn 1396, Issue , 1998, Pages 221-231

  Bellare, Mihir ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (27)

1. ANSI X9. 9, "American National Standard for Financial Institution Message Authentication (Wholesale)," American Bankers Association, 1981. Revised 1986.
2. ANSI X3. 106, "American National Standard for Information Systems-Data Encryption Algorithm Modes of Operation," American National Standards Institute, 1983.
3. M. Bellare, R. Canetti and H, Krawczyk, "Psuedorandom functions revisited: The cascade construction and its concrete security," Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE, 1996.
4. M. Bellare, A. Desai, E. Jokipii and P. Rogaway, "A concrete security treatment of symmetric encryption," Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997.
5. M. Bellare, R. Guérin and P. Rogaway, "XOR MACs: New methods for message authentication using finite pseudorandom functions," Advances in Cryptology-Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.
6. M. Bellare, J. Kilian and P. Rogaway, "The security of cipher block chaining," Advances in Cryptology-Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.
7. M. Bellare and P. Rogaway, "Entity authentication and key distribution," Advances in Cryptology-Crypto 93 Proceedings, Lecture Notes in Computer Science Vol. 773, D. Stinson ed., Springer-Verlag, 1993.
8. 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.
9. M. Bellare and P. Rogaway, "Optimal asymmetric encryption-How to encrypt with RSA," Advances in Cryptology - Eurocrypt 95 Proceedings, Lecture Notes in Computer Science Vol. 921, L. Guillou and J. Quisquater ed., Springer-Verlag, 1995.
10. M. Bellare and P. Rogaway, "Provably secure session key distribution-the three party case," Proceedings of the 27th Annual Symposium on the Theory of Computing, ACM, 1995.
11. M. Bellare and P. Rogaway, "The exact security of digital signatures: How to sign with RSA and Rabin," Advances in Cryptology - Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed., Springer-Verlag, 1996.
12. M. Bellare and D. Micciancio, "A new paradigm for collision-free hashing: IncrementaJity at reduced cost," Advances in Cryptology-Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed., Springer-Verlag, 1997.
13. M. Blum and S. Micali, "How to generate cryptographically strong sequences of pseudo-random bits," SIAM Journal on Computing, Vol. 13, No. 4, November 1984, pp. 850-864.
14. H. Dobbertin, A. Bosselaers and B. Preneel, "RIPEMD-160: A strengthened version of RIPEMD," Fast Software Encryption, Lecture Notes in Computer Science 1039, D. Gollmann, ed., Springer-Verlag, 1996.
15. O. Goldreich, "On the foundations of modern cryptography," Advances in Cryptology-Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, A. Kaliski ed., Springer-Verlag, 1997.
16. O. Goldreich, S. Goldwasser and S. Micali, "How to construct random functions," Journal of the ACM, Vol. 33, No. 4, October 1986, pp. 792-807.
17. S. Goldwasser and S. Micali, "Probabilistic encryption," J. of Computer and System Sciences, Vol. 28, April 1984, pp. 270-299.
18. S. Goldwasser, S. Micali and R. Rivest, "A digital signature scheme secure against adaptive chosen-message attacks," SIAM Journal of Computing, Vol. 17, No. 2, April 1988, pp. 281-308.
19. ISO 8372, "Information processing-Modes of operation for a 64-bit block cipher algorithm," International Organization for Standardization, Geneva, Switzerland, 1987.
20. M. Luby and C. Eackofp, "How to construct pseudorandom permutations from pseudorandom functions," SIAM J. Computation, Vol. 17, No. 2, April 1988.
21. National Bureau of Standards, NBS FIPS PUB 81, "DES modes of operation," U. S Department of Commerce, 1980.
22. National Institute of Standards, FIPS 180-1, "Secure hash standard," April 1995.
23. D. POINTCHEVAL and J. Stern, "Security proofs for signatures," Advances in Cryptology-Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed., Springer-Verlag, 1996.
24. D. Pointcheval and J. Steen, "Provably secure blind signature schemes," Advances in Cryptology-ASIACRYPT 96 Proceedings, Lecture Notes in Computer Science Vol. 1163, M. Y. Rhee and K. Kim ed., Springer-Verlag, 1996.
25. B. Preneel and P. van Oorschot, "MD-x MAC and building fast MACs from hash functions," Advances in Cryptology-Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.
26. V. Shoup and A. Rubin, "Session key distribution using smart cards," Advances in Cryptology-Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed., Springer-Verlag, 1996.
27. A. C. Yao, "Theory and applications of trapdoor functions," Proceedings of the 23rd Symposium on Foundations of Computer Science, IEEE, 1982.