Feistel networks made public, and applications

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

Volumn 4515 LNCS, Issue , 2007, Pages 534-554

  Dodis, Yevgeniy ^a   Puniya, Prashant ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

Domain extension; Feistel network; MACs; PRFs; PRPs; Verifiable random functions permutations

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL EFFICIENCY; MATHEMATICAL TRANSFORMATIONS; RANDOM PROCESSES; SECURITY OF DATA;

DOMAIN EXTENSION; FEISTEL NETWORKS; PERMUTATIONS; VERIFIABLE RANDOM FUNCTIONS;

CRYPTOGRAPHY;

EID: 38049138727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72540-4_31     Document Type: Conference Paper

References (24)

1. Jee Hea An and Mihir Bellare, Constructing VIL-MACs from FIL-MACs: Message Authentication under Weakened Assumptions, CRYPTO 1999: 252-269.
2. M. Bellare and P. Rogaway, Optimal Asymmetric Encryption, Proceedings of Eurocrypt'94, LNCS vol. 950, Springer-Verlag, 1994, pp. 92-111.
3. M. Bellare and P. Rogaway, The exact security of digital signatures - How to sign with RSA and Rabin. Proceedings of Eurocrypt'96, LNCS vol. 1070, Springer-Verlag, 1996, pp. 399-416.
4. Manuel Blum, Coin Flipping by Telephone - A Protocol for Solving Impossible Problems, COMPCON 1982: 133-137.
5. Y. Dodis, Efficient construction of (distributed) verifiable random functions, In Proceedings of 6th International Workshop on Theory and Practice in Public Key Cryptography, pp 1-17, 2003.
6. Y. Dodis and P. Puniya, On the relation between Ideal Cipher and Random Oracle Models, In Theory of Cryptography Conference 2006.
7. Y. Dodis and P. Puniya, Feistel Networks made Public, and Applications, Full Version, available from IACR EPrint Archive.
8. Y. Dodis and A. Yampolskiy, A Verifiable Random Function With Short Proofs and Keys, In Workshop on Public Key Cryptography (PKC), January 2005.
9. Oded Goldreich, Shaft Goldwasser and Asaf Nussboim, On the Implementation of Huge Random Objects, FOCS 2003: 68-79.
10. Oded Goldreich and Leonid A. Levin, A Hard-Core Predicate for all One-Way Functions, STOC 1989: 25-32.
11. Shafi Goldwasser and Rafail Ostrovsky, Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract), in CRYPTO 1992: 228-245.
12. M. Luby and C. Rackoff, How to construct pseudo-random permutations from pseudo-random functions, in SIAM Journal on Computing, Vol. 17, No. 2, April 1988.
13. A. Lysyanskaya, Unique Signatures and verifiable random functions from DH-DDH assumption, in Proceedings of the 22nd Annual International Conference on Advances in Cryptography (CRYPTO), pp. 597 612, 2002.
14. Ueli M. Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak and Johan Sj?din, Luby-Rackoff Ciphers from Weak Round Functions?, EUROCRYPT 2006: 391-408.
15. Ueli M. Maurer and Krzysztof Pietrzak, The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations, in EUROCRYPT 2003, 544-561.
16. Ueli M. Maurer and Johan Sj?din, Single-Key AIL-MACs from Any FIL-MAC, ICALP 2005: 472-484.
17. S. Micali, M. Rabin and S. Vadhan, Verifiable Random functions, In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 120-130, 1999.
18. Silvio Micali and Ronald L. Rivest, Micropayments Revisited, CT-RSA 2002, 149-163.
19. Moni Naor, Bit Commitment Using Pseudo-Randomness, CRYPTO 1989: 128-136.
20. Moni Naor and Omer Reingold, On the construction of pseudo-random permutations: Luby-Rackoff revisited, in Journal of Cryptology, vol 12, 1999, pp. 29-66.
21. Moni Naor and Moti Yung, Universal One-Way Hash Functions and their Cryptographic Applications, STOC 1989: 33-43.
22. Jacques Patarin, Security of Random Feistel Schemes with 5 or More Rounds, in CRYPTO 2004, 106-122.
23. Z. Ramzan and L. Reyzin, On the Round Security of Symmetric-Key Cryptographic Primitives, in Advances in Cryptography - Crypto, LNCS vol. 1880, Springer-Verlag, 2000.
24. Daniel R. Simon, Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions?, EUROCRYPT 1998: 334-345.