Succinct NP proofs from an extractability assumption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5028 LNCS, Issue , 2008, Pages 175-185

  Di Crescenzo, Giovanni ^a   Lipmaa, Helger ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; NUCLEAR PROPULSION;

(ALGORITHMIC) COMPLEXITY; (E ,2E) THEORY; COMMUNICATION COMPLEXITIES; COMPLEXITY ASSUMPTIONS; COMPLEXITY THEORIES; EXTRACTABILITY; HEIDELBERG (CO); POLYLOGARITHMIC; POLYNOMIAL-TIME; PROOF SYSTEMS; SPRINGER (CO);

STANDARDS;

EID: 45849090390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69407-6_21     Document Type: Conference Paper

References (22)

1. Aiello, W., Bhatt, S.N., Ostrovsky, R., Rajagopalan, S.R.: Fast Verification of Remote procedure Calls: Short Witness-Indistinguishable One-Round Proofs for NP. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853. Springer, Heidelberg (2000)
2. Arora, S., Safra, S.: Probabilistic Checking of Proofs: A New Characterization of NP. Journal of the ACM 45(1), 70-122 (1998)
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)
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)
5. Barak, B., Goldreich, O.: Universal Arguments and Their Applications. In: Proc. of IEEE Conference on Computational Complexity (2002)
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)
7. Brassard, G., Chaum, D., Crépeau, C.: Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Sciences 37(2), 156-189 (1988)
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)
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)
10. Di Crescenzo, G.: Extractability Complexity Assumptions (August 2006) (unpublished manuscript)
11. Dwork, C., Langberg, M., Naor, M., Nissim, K., Reingold, O.: Succinct NP Proofs and Spooky Interactions (December 2004) (unpublished manuscript)
12. Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof-Systems. SIAM Journal on Computing 18(1) (1989)
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)
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)
15. Kilián, J.: A note on Efficient Zero-knowledge Proofs and Arguments. In: Proc. of ACM STOC 1991 (1991)
16. Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single Database, computationally-private information retrieval. In: Proc. of 38th IEEE FOCS 1997 (1997)
17. Laur, S., Lipmaa, H.: Consistent Adaptive Two-Party Computations, Cryptology ePrint Archive, Report 2006/088 (2006)
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)
19. Merkle, R.: A Certified Digital Signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435. Springer, Heidelberg (1990)
20. Micali, S.: CS proofs. In: Proc. of 35th IEEE FOCS 1994 (1994)
21. Russell, A.: Necessary and Sufficient Conditions for Collision-Free Hashing. J. Cryptology 8(2), 87-100 (1995)
22. Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with Optimal Amortized Query Complexity. In: Proc. of the 32nd ACM STOC 2000 (2000)