Locally random reductions: Improvements and applications

@article{Beaver1997LocallyRR,
  title={Locally random reductions: Improvements and applications},
  author={Donald Beaver and Joan Feigenbaum and Joe Kilian and Phillip Rogaway},
  journal={Journal of Cryptology},
  year={1997},
  volume={10},
  pages={17-36}
}
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… CONTINUE READING
Highly Cited
This paper has 82 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 53 extracted citations

Advances in Cryptology — ASIACRYPT 2000

Lecture Notes in Computer Science • 2000
View 20 Excerpts
Highly Influenced

Parallel Homomorphic Encryption

IACR Cryptology ePrint Archive • 2011
View 10 Excerpts
Highly Influenced

A geometric approach to information-theoretic private information retrieval

20th Annual IEEE Conference on Computational Complexity (CCC'05) • 2005
View 4 Excerpts
Highly Influenced

Information-Theoretic Private Information Retrieval: A Unified Construction

Electronic Colloquium on Computational Complexity • 2001
View 5 Excerpts
Highly Influenced

82 Citations

0510'99'03'08'13'18
Citations per Year
Semantic Scholar estimates that this publication has 82 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

New Directions In Testing

Distributed Computing And Cryptography • 1989
View 9 Excerpts
Highly Influenced

H

C. Lund, L. Fortnow
Karlo , and N. Nisan. Algebraic Methods for Interactive Proof Systems, J. ACM 39 • 1992

Ip = Pspace

J. ACM • 1992

On the Power of Two-Oracle Instance-Hiding Schemes

L. Fortnow, M. Szegedy
Inform. Proc. Ltrs. 44 • 1992
View 2 Excerpts

Proofs that Yield Nothing but the Validity of the Assertion

O. Goldreich, S. Micali, A. Wigderson
and a Methodology of Cryptographic Protocol Design, J. ACM 38 • 1991

Locally Random Reductions in Interactive Complexity Theory

Advances In Computational Complexity Theory • 1990

Similar Papers

Loading similar papers…