A Technique for Boosting the Security of Cryptographic Systems with One-Way Hash Functions

1. Anderson, R.: The classication of hash functions. In: Proceedings of the 4th IMA Conference on Cryptography and Coding, pp. 83–94 (1995)

   Google Scholar 

2. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62–73 (1993)

   Google Scholar 

3. Bellare, M., Rogaway, P.: The exact security of digital signatures–how to sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399–416. Springer, Heidelberg (1996)

   Google Scholar 

4. Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences 18(2), 143–154 (1979)

   Article  MATH  MathSciNet  Google Scholar 

5. Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 542–552. ACM Press, New York (1991)

   Google Scholar 

6. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory IT-31(4), 469–472 (1985)

   Google Scholar 

7. Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17(2), 281–308 (1988)

   Article  MATH  MathSciNet  Google Scholar 

8. Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 33–43. ACM Press, New York (1989)

   Google Scholar 

9. Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387–398. Springer, Heidelberg (1996)

   Google Scholar 

10. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signature and public key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

11. Rompel, J.: One-way functions are necessary and suffcient for secure signatures. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 387–394. ACM Press, New York (1990)

    Google Scholar 

12. Zheng, Y., Hardjono, T., Pieprzyk, J.: Sibling intractable function families and their applications. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 124–138. Springer, Heidelberg (1993)

    Google Scholar 

Download references