Abstract
We know that trapdoor permutations can be used to construct all kinds of basic cryptographic primitives, including trapdoor functions, public-key encryption, private information retrieval, oblivious transfer, key agreement, and those known to be equivalent to one-way functions such as digital signature, private-key encryption, bit commitment, pseudo-random generator and pseudo-random functions. On the other hand, trapdoor functions are not as powerful as trapdoor permutations, so the structural property of permutations seem to be something special that deserves a more careful study. In this paper, we investigate the relationships between one-way permutations and all these basic cryptographic primitives. Following previous work, we focus on an important type of reductions called black-box reductions. We prove that no such reductions exist from one-way permutations to either trapdoor functions or private information retrieval. Together with previous results, all the relationships with one-way permutations have now been established, and we know that no such reductions exist from one-way permutations to any of these primitives except trapdoor permutations. This may have the following meaning, with respect to black-box reductions. We know that one-way permutations imply none of the primitives in “public cryptography”, where additional properties are required on top of “one-wayness” [12], so permutations cannot be traded for any of these additional properties. On the other hand, we now know that none of these additional properties can be traded for permutations either. Thus, permutation seems to be something orthogonal to those additional properties on top of one-wayness. Like previous non-reducibility results [12, 23, 17, 7, 9, 8, 6], our proofs follow the oracle separation paradigm of Impagliazzo and Rudich [12].
Chapter PDF
Similar content being viewed by others
Keywords
- Random Oracle
- Oblivious Transfer
- Annual IEEE Symposium
- Cryptographic Primitive
- Private Information Retrieval
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Mihir Bellare, Shai Halevi, Amit Sahai, and Salil P. Vadhan. Many-to-one trapdoor functions and their relation to public-key cryptosystems. In Hugo Krawczyk, editor, Advances in Cryptology—CRYPTO’ 98, volume 1462 of Lecture Notes in Computer Science, pages 283–298. Springer-Verlag, 1998.
Amos Beimel, Yuval Ishai, Eyal Kushilevitz, and Tal Malkin. One-way functions are essential for single-server private information retrieval. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 89–98, 1999.
Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. Private information retrieval. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 41–50, 1995.
Giovanni Di Crescenzo, Tal Malkin, and Rafail Ostrovsky. Single database private information retrieval implies oblivious transfer. In Bart Preneel, editor, Advances in Cryptology—EUROCRYPT’ 00, volume 1807 of Lecture Notes in Computer Science, pages 122–138. Springer-Verlag, 2000.
Whitfield Diffie and Martin E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644–654, 1976.
Marc Fischlin. On the impossibility of constructing non-interactive statistically-secret protocols from any trapdoor one-way function. In Bart Preneel, editor, Topics in Cryptology—CT-RSA’ 02, volume 2271 of Lecture Notes in Computer Science, pages 79–95. Springer-Verlag, 2002.
Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, and Mahesh Viswanathan. The relationship between public key encryption and oblivious transfer. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 325–335, 2000.
Yael Gertner, Tal Malkin, and Omer Reingold. On the impossibility of basing trapdoor functions on trapdoor predicates. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 126–135, 2001.
Rosario Gennaro and Luca Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 305–313, 2000.
Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364–1396, 1999.
Russell Impagliazzo and Michael Luby. One-way functions are essential for complexity based cryptography (extended abstract). In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 230–235, 1989.
Russell Impagliazzo and Steven Rudich. Limits on the provable consequences of one-way permutations. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 44–61, 1989.
Joe Kilian. Founding cryptography on oblivious transfer. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 20–31, 1988.
Eyal Kushilevitz and Rafail Ostrovsky. Replication is not needed: single database, computationally-private information retrieval. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 364–373, 1997.
Eyal Kushilevitz and Rafail Ostrovsky. One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. In Bart Preneel, editor, Advances in Cryptology—EUROCRYPT’ 00, volume 1807 of Lecture Notes in Computer Science, pages 104–121. Springer-Verlag, 2000.
Jeff Kahn, Michael E. Saks, and Cliff Smyth. A dual version of Reimer’s inequality and a proof of Rudich’s conjecture. In Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pages 98–103, 2000.
Jeong Han Kim, Daniel R. Simon, and Prasad Tetali. Limits on the efficiency of one-way permutation-based hash functions. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 535–542, 1999.
Moni Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151–158, 1991.
John Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 387–394, 1990.
Steven Rudich. Limits on the provable consequences of one-way functions. Ph.D. thesis, U.C. Berkeley, 1988.
Steven Rudich. The use of interaction in public cryptosystems (extended abstract). In Joan Feigenbaum, editor, Advances in Cryptology—CRYPTO’ 91, volume 576 of Lecture Notes in Computer Science, pages 242–251. Springer-Verlag, 1991.
Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120–126, 1978.
Daniel R. Simon. Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In Kaisa Nyberg, editor, Advances in Cryptology—EUROCRYPT’ 98, volume 1403 of Lecture Notes in Computer Science, pages 334–345. Springer-Verlag, 1998.
Andrew Chi-Chih Yao. Theory and applications of trapdoor functions (extended abstract). In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 80–91, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, YC., Hsiao, CY., Lu, CJ. (2002). On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives. In: Zheng, Y. (eds) Advances in Cryptology — ASIACRYPT 2002. ASIACRYPT 2002. Lecture Notes in Computer Science, vol 2501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36178-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-36178-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00171-3
Online ISBN: 978-3-540-36178-7
eBook Packages: Springer Book Archive