Succinct NP Proofs from an Extractability Assumption

  • Giovanni Di Crescenzo
  • Helger Lipmaa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5028)


We prove, using a non-standard complexity assumption, that any language in Open image in new window has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a message to the verifier) argument system (that is, a proof system where soundness holds against polynomial-time provers) with communication complexity only polylogarithmic in the size of the Open image in new window instance. We also show formal evidence that the nature of the non-standard complexity assumption we use is analogous to previous assumptions proposed in the cryptographic literature. The question of whether complexity assumptions of this nature can be considered acceptable or not remains of independent interest in complexity-theoretic cryptography as well as complexity theory.


Hash Function Proof System Security Parameter Argument System Private Information Retrieval 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aiello, W., Bhatt, S.N., Ostrovsky, R., Rajagopalan, S.R.: Fast Verification of Remote procedure Calls: Short Witness-Indistinguishable One-Round Proofs for Open image in new window. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  2. 2.
    Arora, S., Safra, S.: Probabilistic Checking of Proofs: A New Characterization of NP. Journal of the ACM 45(1), 70–122 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501–555 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Babai, L., Moran, S.: Arthur-Merlin Games: a Randomized Proof System, and a Hierarchy of Complexity Classes. Journal of Computer and System Sciences 36, 254–276 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Barak, B., Goldreich, O.: Universal Arguments and Their Applications. In: Proc. of IEEE Conference on Computational Complexity (2002)Google Scholar
  6. 6.
    Biehl, I., Meyer, B., Wetzel, S.: Ensuring the Integrity of Agent-Based Computation by Short Proofs. In: Proc. of Mobile Agents 1998. LNCS. Springer, Heidelberg (1998)Google Scholar
  7. 7.
    Brassard, G., Chaum, D., Crépeau, C.: Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Sciences 37(2), 156–189 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Cachin, C., Micali, S., Stadler, M.: Computationally Private Information Retrieval with Polylogarithmic Communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592. Springer, Heidelberg (1999)Google Scholar
  9. 9.
    Damgård, I.: Towards Practical Public-key Systems Secure against Chosen Ciphertext Attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576. Springer, Heidelberg (1992)Google Scholar
  10. 10.
    Di Crescenzo, G.: Extractability Complexity Assumptions (August 2006) (unpublished manuscript)Google Scholar
  11. 11.
    Dwork, C., Langberg, M., Naor, M., Nissim, K., Reingold, O.: Succinct NP Proofs and Spooky Interactions (December 2004) (unpublished manuscript)Google Scholar
  12. 12.
    Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof-Systems. SIAM Journal on Computing 18(1) (1989)Google Scholar
  13. 13.
    Gentry, C., Ramzan, Z.: Single-Database Private Information Retrieval with Constant Communication Rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580. Springer, Heidelberg (2005)Google Scholar
  14. 14.
    Hada, S., Tanaka, T.: On the existence of 3-round Zero-Knowledge Protocols. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462. Springer, Heidelberg (1998)Google Scholar
  15. 15.
    Kilian, J.: A note on Efficient Zero-knowledge Priifs and Arguments. In: Proc. of ACM STOC 1991 (1991)Google Scholar
  16. 16.
    Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single Database, computationally-private information retrieval. In: Proc. of 38th IEEE FOCS 1997 (1997)Google Scholar
  17. 17.
    Laur, S., Lipmaa, H.: Consistent Adaptive Two-Party Computations, Cryptology ePrint Archive, Report 2006/088 (2006)Google Scholar
  18. 18.
    Lipmaa, H.: An Oblivious Transfer Protocol with Log-Squared Communication. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650. Springer, Heidelberg (2005)Google Scholar
  19. 19.
    Merkle, R.: A Certified Digital Signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435. Springer, Heidelberg (1990)Google Scholar
  20. 20.
    Micali, S.: CS proofs. In: Proc. of 35th IEEE FOCS 1994 (1994)Google Scholar
  21. 21.
    Russell, A.: Necessary and Sufficient Conditions for Collision-Free Hashing. J. Cryptology 8(2), 87–100 (1995)zbMATHMathSciNetGoogle Scholar
  22. 22.
    Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with Optimal Amortized Query Complexity. In: Proc. of the 32nd ACM STOC 2000 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Giovanni Di Crescenzo
    • 1
  • Helger Lipmaa
    • 2
  1. 1.Telcordia TechnologiesPiscatawayUSA
  2. 2.University College LondonLondonUK

Personalised recommendations