Pseudorandom function tribe ensembles based on one-way permutations: Improvements and applications

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

Volumn 1592, Issue , 1999, Pages 432-445

  Fischlin, Marc ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL;

CIPHERTEXTS; COLLISION RESISTANCE; ONE-WAY PERMUTATION; PLAINTEXT; PRIVATE-KEY ENCRYPTION; PSEUDO-RANDOM FUNCTIONS; RANDOM BITS; SECRET KEY;

CRYPTOGRAPHY;

EID: 84957609649     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48910-X_30     Document Type: Conference Paper

References (23)

1. M. Bellare, A. Desai, E. Jokipii, P. Rogaway: A Concrete Security Treatment of Symmetric Encryption, Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 394-403, 1997.
2. M. Bellare, P. Rogaway: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols, First ACM Conference on Computer and Communications Security, 1993.
3. R. Canetti: Towards Realizing Random Oracles: Hash Functions that Hide All Partial Information, Crypto '97, Lecture Notes in Computer Science, Vol. 1294, Springer-Verlag, pp. 455-469, 1997.
4. R. Canetti, C. Dwork, M. Naor. R. Ostrovsky: Deniable Encryption, Crypto '97, Lecture Notes in Computer Science, Vol. 1294, Springer-Verlag, pp. 90-104, 1997.
5. R. Canetti, U. Feige, O. Goldreich, M. Naor: Adaptively Secure Multi-Party Computation, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC), pp. 639-648, 1996.
6. R. Canetti, R. Gennaro: Incoercible Multiparty Computation, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 504-513, 1996.
7. R. Canetti, D. Micciancio, O. Reingold: Perfectly One-Way Probabilistic Hash Functions, Proceedings of the 30th Annual ACM Symposium on the Theory of Com- puting (STOC), 1998.
8. L. Carter, M. Wegman: Universal Classes of Hash Functions, Journal of Com-puter and System Science, vol. 18, pp. 143-154, 1979.
9. D. Dolev, C. Dwork, M. Naor: Non-Malleable Cryptography, submitted journal version; A preliminary version appearded in Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing (STOC) in 1991, 1999.
10. S. Goldwasser, O. Goldreich, S. Micali: How to Construct Random Functions, Journal of ACM, vol. 33, pp. 792-807, 1986.
11. O. Goldreich: Foundations of Cryptography (Fragments of a Book), Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Rehovot, Israel, 1995.
12. O. Goldreich, L. Levin: A Hardcore Predicate for All One-Way Functions, Pro- ceedings of the 21st Annual ACM Symposium on the Theory of Computing (STOC), pp. 25-32, 1989.
13. S. Goldwasser, S. Micali: Probabilistic Encryption, Journal of Computer and System Science, Vol. 28, pp. 270-299, 1984.
14. J. Hastad, R. Impagliazzo, L. Levin, M. Luby: Construction of a Pseudorandom Generator from any One-Way Function, to appear in SIAM Journal on Computing, preliminary versions in STOC'89 and STOC'90, 1989/90.
15. M. Luby, C. Rackoff: How to Construct Pseudorandom Permutations from Pseudorandom Functions, SIAM Journal on Computing, Vol. 17, pp. 373-386, 1988.
16. S. Micali, C. Rackoff, B. Sloan: The Notion of Security for Probabilistic Cryptosystems, SIAM Journal on Computing, 1988.
17. M. Naor: Bit Commitment Using Pseudo-Randomness, Journal of Cryptology, vol. 4, pp. 151-158, 1991.
18. M. Naor, O. Reingold: Synthesizers and Their Application to the Parallel Construction of Pseudorandom Functions, Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 170-181, 1995.
19. M. Naor, O. Reingold: Number-Theoretic Constructions of Efficient Pseudorandom Functions, Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 458-467, 1997.
20. M. Naor, O. Reingold: On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited, Journal of Cryptology, vol. 12, no. 1, pp. 29-66, 1999.
21. M. Naor, M. Yung: Public-Key Cryptosystems Provably Secure Against Chosen Ciphertext Attacks, Proceedings of the 20th Annual ACM Symposium on the The- ory of Computing (STOC), pp. 427-437, 1990.
22. C. Rackoff, D. Simon: Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attacks, Crypto '91, Lecture Notes in Computer Science, Vol. 576, Springer-Verlag, pp. 433-444, 1991.
23. A.C. Yao: Theory and Application of Trapdoor Functions, Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 80-91, 1982