Practice-oriented provable-security

1. ANSI X9.9, “American National Standard for Financial Institution Message Authentication (Wholesale),rd American Bankers Association, 1981. Revised 1986.

   Google Scholar 

2. ANSI X3.106, “American National Standard for Information Systems — Data Encryption Algorithm — Modes of Operation,” American National Standards Institute, 1983.

   Google Scholar 

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.

   Google Scholar 

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.

   Google Scholar 

5. M. BELLARE, R. GUÉRIN AND P. ROGAWAY, “XOR “XOR 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.

   Google Scholar 

6. M. BELLARE, J. KILIAN AND P. ROGAWAY, “The security of cipher block chaing“ Advances in Cryptology — Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.

   Google Scholar 

7. M. BELLARE AND P. ROGAWAY, “Entity authentication and key distributin,” Advances in Cryptology — Crypto 93 Proceedings, Lecture Notes in Computer Science Vol. 773, D. Stinson ed., Springer-Verlag, 1993.

   Google Scholar 

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.

   Google Scholar 

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.

   Google Scholar 

10. M. BELLARE AND P. ROGAWAY, “Provably secure session key the three party case,“ Proceedings of the 27th Annual Symposium on the Theory of Computing, ACM, 1995.

    Google Scholar 

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.

    Google Scholar 

12. M. BELLARE AND D. MICCIANCIO, “A new paradigm for collision-free hashing: Incrementality at reduced cost,” Advances in Cryptology — Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed., Springer-Verlag, 1997.

    Google Scholar 

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.

    Google Scholar 

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.

    Google Scholar 

15. O. GOLDREICH, “On the foundations of modern ‘On Advances in Cryptology — Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed., Springer-Verlag, 1997.

    Google Scholar 

16. O. Goldreich, S. Goldwasser and S. Micali, “How to construct random “How functions,” Journal of the ACM, Vol. 33, No. 4, October 1986, pp. 792–807.

    Google Scholar 

17. S. Goldwasser and S. Micali, “Probabilistic encryption,” J. Of Computer and System Sciences, Vol. 28, April 1984, pp. 270–299.

    Google Scholar 

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.

    Google Scholar 

19. ISO 8372, “Information processing — Modes of operation for a 64-bit block cipher algorithm,” International Organization for Standardization, Geneva, Switzerland, 1987.

    Google Scholar 

20. M. LUBY AND C. RACKOFF, “How to construct pseudorandom permutations from pseudorandom functions,” SIAM J. Computation, Vol. 17, No. 2, April 1988.

    Google Scholar 

21. National Bureau of Standards, NBS FIPS PUB 81, “DES modes of operation,” U.S Department of Commerce, 1980.

    Google Scholar 

22. National Institute of Standards, FIPS 180-1, “Secure hash standar,” April 1995.

    Google Scholar 

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.

    Google Scholar 

24. D. POINTCHEVAL AND J. STERN, “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.

    Google Scholar 

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.

    Google Scholar 

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.

    Google Scholar 

27. A. C. YAO, “Theory and applications of trapdoor functions,” Proceedings of the 23rd Symposium on Foundations of Computer Science, IEEE, 1982.

    Google Scholar 

Download references