Abstract
Starting with the seminal paper of Impagliazzo and Rudich [17], there has been a large body of work showing that various cryptographic primitives cannot be reduced to each other via “black-box” reductions. The common interpretation of these results is that there are inherent limitations in using a primitive as a black box, and that these impossibility results can be overcome only by explicitly using the code of the primitive in the construction.
In this paper we revisit these negative results, give a more careful taxonomy of the ways in which “black-box reductions” can be formalized, strengthen some previous results (in particular giving unconditional impossibility results for reductions that were previously only shown to imply P≠ NP), and offer a new interpretation of them: in many cases, there is no limitation in using a primitive as a black box, but there is a limitation in treating adversaries as such. In particular, these negative results may be overcome by using the code of the adversary in the analysis.
Research supported in part by US-Israel BSF Grant 2002246.
Chapter PDF
Similar content being viewed by others
Keywords
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
Barak, B.: How to go beyond the black-box simulation barrier. In: Proc. of 42nd IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 106–115 (2001)
Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (2002)
Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput. 13(4), 850–864 (1984)
Bogdanov, A., Trevisan, L.: On worst-case to average-case reductions for NP problems. In: Proc. of 44th IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 308–317 (2003)
Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. Journal of Cryptology 1(2), 77–94 (1988)
Feigenbaum, J., Fortnow, L.: Random-self-reducibility of complete sets. SIAM J. Comput. 22(5), 994–1005 (1993)
Gennaro, R., Gertner, Y., Katz, J.: Lower bounds on the efficiency of encryption and digital signature schemes. In: STOC 2003, pp. 417–425 (2003)
Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (2000)
Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (2000)
Gertner, Y., Malkin, T., Reingold, O.: Lower bounds on the efficiency of generic cryptographic constructions. In: Proceedings of the IEEE Symposium on Foundations of Computer Science, pp. 126–135 (2001)
Goldreich, O., Levin, L.: A hard predicate for all one-way functions. In: Proceedings of the ACM Symposium on the Theory of Computing (1989)
Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the Association for Computing Machinery 33(4), 792–807 (1986)
Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38(3), 691–729 (1991)
Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing 28(4), 1364–1396 (1999)
Impagliazzo, R., Luby, M.: One-way functions are essencial for complexity-based cryptography. In: Proceedings of the 30th Symposium on Foundations of Computer Science. IEEE, Los Alamitos (1989)
Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: Proc. of 30th IEEE Symp. on Foun. of Comp. Sci. (FOCS 1989), pp. 230–235 (1989)
Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proceedings of the 21st ACM Symposium on the Theory of Computing (1989)
Impagliazzo, R., Levin, L.A.: No better ways to generate hard np instances than picking uniformly at random. In: Proc. of 31st IEEE Symposium on Foundations of Computer Science, pp. 812–821 (1990)
Kahn, J., Saks, M., Smyth, C.: 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 (2000)
Kim, J.H., Simon, D., Tetali, P.: Limits on the efficiency of one-way permuation-based hash functions. In: Proc. of the IEEE Symposium on Foundations of Computer Science (1999)
Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology 4(2), 151–158 (1991)
Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the 21st ACM Symposium on Theory of Computing, pp. 33–43 (1989)
Ostrovsky, R., Wigderson, A.: One-way functions are essential for nontrivial zero-knowledge. In: Proc. 2nd Israeli Symp. on Theory of Computing and Systems, pp. 3–17 (1993)
Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pp. 387–394 (1990)
Rudich, S.: The use of interaction in public cryptosysytems. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 242–251. Springer, Heidelberg (1992)
Rudich, S.: Limits on the provable consequences of one-way functions. PhD thesis, U.C. Berkeley (1988)
Simon, D.R.: Findings collisions on a one-way street: Can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 334–345. Springer, Heidelberg (1998)
Yao, A.: Theory and applications of trapdoor functions. In: Proceedings of the 23rd Symposium on Foundations of Computer Science. IEEE, Los Alamitos (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reingold, O., Trevisan, L., Vadhan, S. (2004). Notions of Reducibility between Cryptographic Primitives. In: Naor, M. (eds) Theory of Cryptography. TCC 2004. Lecture Notes in Computer Science, vol 2951. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24638-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-24638-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21000-9
Online ISBN: 978-3-540-24638-1
eBook Packages: Springer Book Archive