Skip to main content
SpringerLink
Log in

On the power of two-local random reductions

  • Conference paper
  • First Online:
Advances in Cryptology — ASIACRYPT '91 (ASIACRYPT 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 739))

Included in the following conference series:

  • 186 Accesses

Abstract

We show that any language that has a two-locally-random reduction in which the target functions are boolean is in NP/poly∩co-NP/poly. This extends and simplifies a result by Yao.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle, J. Comput. System Sci. 39 (1989), 21–50.

    Article  Google Scholar 

  2. D. Beaver and J. Feigenbaum. Hiding Instances in Multioracle Queries, Proc. of the 7th STACS (1990), Springer Verlag LNCS 415, 37–48.

    Google Scholar 

  3. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with Low Communication Overhead, Proc. of the 10th CRYPTO (1990), Springer Verlag LNCS, to appear.

    Google Scholar 

  4. J. Feigenbaum and L. Fortnow. On the Random-Self-Reducibility of Complete Sets, Proc. of the 6th Structures (1991), IEEE, 124–132.

    Google Scholar 

  5. J. Feigenbaum, S. Kannan, and N. Nisan. Lower Bounds on Random-Self-Reducibility, Proc. of the 5th Structures (1990), IEEE, 100–109.

    Google Scholar 

  6. A. Yao. An Application of Communication Complexity to Cryptography, Lecture at DI-MACS Workshop on Structural Complexity and Cryptography (1990).

    Google Scholar 

  7. C. Yap. Some Consequences of Nonuniform Conditions on Uniform Classes, Theor. Comput. Sci. 26 (1983), 287–300.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Chicago, 1100 E. 58th Street, 60637, Chicago, IL

    Lance Fortnow

  2. AT& T Bell Laboratories, P.O. Box 636, 07974, Murray Hill, NJ

    Mario Szegedy

Authors
  1. Lance Fortnow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario Szegedy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hideki Imai Ronald L. Rivest Tsutomu Matsumoto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fortnow, L., Szegedy, M. (1993). On the power of two-local random reductions. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-57332-1_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57332-6

  • Online ISBN: 978-3-540-48066-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation