Concrete security characterizations of PRFs and PRPs: Reductions and applications

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

Volumn 1976, Issue , 2000, Pages 503-516

  Desai, Anand ^a   Miner, Sara ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SECURITY OF DATA;

CONCRETE SECURITIES; COUNTER MODES; INJECTIVITY; MESSAGE AUTHENTICATION CODES; POLYNOMIAL-TIME REDUCTION; PSEUDO-RANDOM FUNCTIONS; PSEUDORANDOM PERMUTATION; PSEUDORANDOMNESS;

CRYPTOGRAPHY;

EID: 35048841016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_39     Document Type: Conference Paper

References (12)

1. M. Bellare, R. Canetti and H. Krawczyk, “Keying hash functions for message authentication,” Advances in Cryptology - Crypto ’96, LNCS Vol. 1109, N. Koblitz ed., Springer-Verlag, 1996.
2. M. Bellare, R. Canetti and H. Krawczyk, “Pseudorandom functions revisited: The cascade construction and its concrete security,” Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE, 1996.
3. M. Bellare, A. Desai, E. Jokipii and P. Rogaway, “A concrete security treatment of symmetric encryption: Analysis of the DES modes of operation,” Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997.
4. M. Bellare, R. Guérin and P. Rogaway, “XOR MACs: New methods for message authentication using finite pseudorandom functions,” Advances in Cryptology - Crypto ’95, LNCS Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.
5. M. Bellare, J. Kilian and P. Rogaway, “The security of the cipher block chaining message authentication code,” Advances in Cryptology - Crypto ’94, LNCS Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.
6. M. Bellare and P. Rogaway, “On the construction of variable-input-length ciphers,” Proceedings of the SixthWorkshop on Fast Software Encryption, L. Knudsen ed., 1999.
7. A. Desai and S. Miner, “Concrete security characterizations of PRFs and PRPs: Reductions and applications,” Full version of this paper, available via: http://www-cse.ucsd.edu/users/sminer/.
8. O. Goldreich, S. Goldwasser and S. Micali, How to construct random functions. Journal of the ACM, 33(4): 792-807, 1986.
9. S. Goldwasser and S. Micali, “Probabilistic encryption,” Journal of Computer and System Science, Vol. 28, pp. 270-299, 1984.
10. S. Goldwasser, S. Micali and R. Rivest, “A digital signature signature scheme secure against adaptive chosen-message attacks,” SIAM J. of Computing, 17(2): 281-308, April 1988.
11. M. Luby and C. Rackoff, “How to construct pseudorandom permutations from pseudorandom functions,” SIAM J. Computing, 17(2), April 1988.
12. M. Naor and O. Reingold, “From unpredictability to indistinguishability: A simple construction of PRFs from MACs,” Advances in Cryptology - Crypto ’98, LNCS Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998.