Succinct NP Proofs from an Extractability Assumption

Authors:
Giovanni Crescenzo;Helger Lipmaa
Affiliations:
Telcordia Technologies, Piscataway, USA;University College London, London, UK
Venue:
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Year:
2008

Citing 17
Cited 9

Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
A PCP characterization of NP with optimal amortized query complexity

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Certified Digital Signature

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the Existence of 3-Round Zero-Knowledge Protocols

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Ensuring the Integrity of Agent-Based Computations by Short Proofs

MA '98 Proceedings of the Second International Workshop on Mobile Agents
Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Replication is not needed: single database, computationally-private information retrieval

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Universal Arguments and their Applications

CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
CS proofs

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Computationally private information retrieval with polylogarithmic communication

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Single-database private information retrieval with constant communication rate

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An oblivious transfer protocol with log-squared communication

ISC'05 Proceedings of the 8th international conference on Information Security

Separating succinct non-interactive arguments from all falsifiable assumptions

Proceedings of the forty-third annual ACM symposium on Theory of computing
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On the feasibility of consistent computations

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Secure two-party computation with low communication

TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Two protocols for delegation of computation

ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Succinct non-interactive arguments via linear interactive proofs

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Recursive composition and bootstrapping for SNARKS and proof-carrying data

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the concrete efficiency of probabilistically-checkable proofs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove, using a non-standard complexity assumption, that any language in 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 theinstance. 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.