Abstract
A (t, n)-locally random reduction maps a problem instancex into a set of problem instancesy 1,...,y n in such a way that it is easy to construct the answer tox from the answers toy 1,...,y n, and yet the distribution ont-element subsets ofy 1,...,y n depends only on |x|. In this paper we formalize such reductions and give improved methods for achieving them. Then we give a cryptographic application, showing a new way to prove in perfect zero knowledge that committed bitsx 1,...,x m satisfy some predicateQ. Unlike previous techniques for such perfect zero-knowledge proofs, ours uses an amount of communication that is bounded by a fixed polynomial inm, regardless of the computational complexity ofQ.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
M. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle.J. Comput. System Sci. 39 (1989), 21–50.
L. Babai, L. Fortnow, and C. Lund. Non-Deterministic Exponential Time has Two-Prover Interactive Proofs.Comput. Complexity 1 (1991), 3–40.
D. Beaver and J. Feigenbaum. Hiding Instances in Multioracle Queries,Proc. 7th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 415, Springer-Verlag, Berlin, 1990, pp. 37–48.
D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Cryptographic Applications of Locally Random Reductions, AT&T Bell Laboratories Technical Memorandum, November 15, 1989.
C. Bennett. Private communication via Gilles Brassard.
M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastaad, J. Kilian, S. Micali, and P. Rogaway. Everything Provable Is Provable in Zero-Knowledge,Advances in Cryptology—Crypto '88, Lecture Notes in Computer Science, vol. 403, Springer-Verlag, Berlin, 1990, pp. 37–56.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation,Proc. 20th Annual Symposium on Theory of Computing, ACM Press, New York, 1988, pp. 1–10.
U. Feige and A. Shamir. Witness Indistinguishable and Witness Hiding Proofs,Proc. 22nd Annual Symposium on Theory of Computing, ACM Press, New York, 1990, pp. 416–426.
J. Feigenbaum. Locally Random Reductions in Interactive Complexity Theory, inAdvances in Computational Complexity, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, American Mathematical Society, Providence, RI, 1993, pp. 73–98.
L. Fortnow and M. Szegedy. On the Power of Two-Oracle Instance-Hiding Schemes,Inform. Process. Lett. 44 (1992), 303–306.
O. Goldreich, S. Micali, and A. Wigderson. How to Play ANY Mental Game,Proc. 19th Annual Symposium on Theory of Computing, ACM Press, New York, 1987, pp. 218–229.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing but the Validity of the Assertion, and a Methodology of Cryptographic Protocol Design,J. Assoc. Comput. Mach. 38 (1991), 691–729.
S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems,SIAM J. Comput. 18 (1989), 186–208.
R. Impagliazzo and M. Yung. Direct Minimum Knowledge Computations,Advances in Cryptology—Crypto '87, Lecture Notes in Computer Science, vol. 293, Springer-Verlag, Berlin, 1988, pp. 40–51.
R. Lipton. New Directions in Testing, inDistributed Computing and Cryptography, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 2, American Mathematical Society, Providence, RI, 1991, pp. 191–202.
C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic Methods for Interactive Proof Systems,J. Assoc. Comput. Mach. 39, (1992), 859–868.
R. Rivest. Workshop on Communication and Computing, MIT, October 1986.
S. Rudich. Private communication via Gilles Brassard.
A. Shamir. IP=PSPACE,J. Assoc. Comput. Mach. 39 (1992), 869–877.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Gilles Brassard
Rights and permissions
About this article
Cite this article
Beaver, D., Feigenbaum, J., Kilian, J. et al. Locally random reductions: Improvements and applications. J. Cryptology 10, 17–36 (1997). https://doi.org/10.1007/s001459900017
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s001459900017