Abstract
Correlation intractable function ensembles were introduced in an attempt to capture the “unpredictability” property of a random oracle: It is assumed that if R is a random oracle then it is infeasible to find an input x such that the input-output pair (x;R(x)) has some desired property. Since this property is often useful to design many cryptographic applications in the random oracle model, it is desirable that a plausible construction of correlation intractable function ensembles will be provided. However, no plausibility result has been proposed. In this paper, we show that proving the implication, “if one-way functions exist then correlation intractable function ensembles exist”, is as hard as proving that “3-round auxiliary-input zero-knowledge Arthur-Merlin proofs exist only for trivial languages such as BPP languages.” As far as we know, proving the latter claim is a fundamental open problem in the theory of zero-knowledge proofs. Therefore, our result can be viewed as strong evidence that the construction based solely on one-way functions will be impossible, i.e., that any plausibility result will require stronger cryptographic primitives.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Babai and S. Moran, “Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes”, J. Comput. System Sci., 36, pp. 254–276, 1988.
M. Bellare and P. Rogaway, “Random Oracles are Practical: a paradigm for designing efficient protocols, ” Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62–73, 1993.
M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, J. Kilian, S. Micali and P. Rogaway, “Everything Provable is Provable in Zero-Knowledge”, Proceedings of Crypto’88, 1990.
G. Brassard, D. Chaum and C. Crépeau, “Minimum Disclosure Proofs of Knowledge,” Journal of Computer and System Sciences, Vol. 37, No. 2, pp. 156–189, 1988.
G. Brassard and C. Crépeau, “Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond,” Proceedings of 27th FOCS, 1986.
R. Canetti, “Towards Realizing Random Oracles: Hash Functions that Hide All Partial Information,” Proceedings of Crypto’97, pp. 455–469, 1997.
R. Canetti, O. Goldreich and S. Halevi, “The Random Oracle Model, Revisited,” Proceedings of 30th STOC, 1998.
R. Canetti, D. Micciancio and O. Reingold, “Perfectly One-Way Probabilistic Hash Functions,” Proceedings of 30th STOC, 1998.
O. Goldreich, “Foundations of Cryptography (Fragments of a Book-Version 2.03),” February 27, 1998.
O. Goldreich and H. Krawczyk, “On the Composition of Zero-Knowledge Proof Systems,” SIAM Journal on Computing, Vol. 25, No. 1, pp. 169–192, 1996.
O. Goldreich, S. Micali, and A. Wigderson, “Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems,” Journal of the ACM, Vol. 38, No. 1, pp. 691–729, 1991.
O. Goldreich and Y. Oren, “Definitions and Properties of Zero-Knowledge Proof Systems,” Journal of Cryptology, Vol. 7, No. 1, pp. 1–32, 1994.
S. Goldwasser, S. Micali, and C. Racko,“The Knowledge Complexity of Interactive Proofs,” Proceedings of 17th STOC, pp. 291–304, 1985.
S. Hada and T. Tanaka, “On the Existence of 3-Round Zero-Knowledge Protocols,” Proceedings of Crypto’98, pp. 408–423, 1998.
R. Impagliazzo and S. Rudich, “Limits on the provable consequences of one-way permutations,” Proceedings of 21st STOC, 1989.
R. Ostrovsky and A. Wigderson, “One-Way Functions are Essential for Non-Trivial Zero-Knowledge,” Technical Report in ICSI, TR-93-073, 1993.
A. Shamir, “IP=PSPACE,” Journal of ACM, Vol. 39, No. 4, pp. 869–877, 1992.
D. R. Simon, “Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions,” Proceedings of Eurocrypt’98, pp. 334–345, 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hada, S., Tanaka, T. (1999). A Relationship between One-Wayness and Correlation Intractability. In: Public Key Cryptography. PKC 1999. Lecture Notes in Computer Science, vol 1560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49162-7_7
Download citation
DOI: https://doi.org/10.1007/3-540-49162-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65644-9
Online ISBN: 978-3-540-49162-0
eBook Packages: Springer Book Archive