The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Limits on the provable consequences of one-way permutations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A note on efficient zero-knowledge proofs and arguments (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
On the complexity of interactive proofs with bounded communication
Information Processing Letters
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Existence of 3-Round Zero-Knowledge Protocols
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The relationship between public key encryption and oblivious transfer
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
How to Go Beyond the Black-Box Simulation Barrier
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On interactive proofs with a laconic prover
Computational Complexity
Algebraic methods for interactive proof systems
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Succinct NP Proofs from an Extractability Assumption
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Dense Subsets of Pseudorandom Sets
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Leakage-Resilient Cryptography
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
On the (Im)Possibility of Key Dependent Encryption
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Perfect NIZK with adaptive soundness
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Are PCPs Inherent in Efficient Arguments?
Computational Complexity - Selected papers from the 24th Annual IEEE Conference on Computational Complexity (CCC 2009)
Limits of provable security from standard assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
On round-efficient argument systems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the generic insecurity of the full domain hash
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Limits of provable security from standard assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Some notions of entropy for cryptography
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Targeted malleability: homomorphic encryption for restricted computations
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Secure two-party computation with low communication
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
How to delegate and verify in public: verifiable computation from attribute-based encryption
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Black-box reductions and separations in cryptography
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Measuring vote privacy, revisited
Proceedings of the 2012 ACM conference on Computer and communications security
Barriers in cryptography with weak, correlated and leaky sources
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On the power of nonuniformity in proofs of security
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Succinct malleable NIZKs and an application to compact shuffles
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Why “fiat-shamir for proofs” lacks a proof
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Signatures of correct computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Succinct non-interactive arguments via linear interactive proofs
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
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
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Verifiable delegation of computation on outsourced data
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Verifying computations with state
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Rational arguments: single round delegation with sublinear verification
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |
An argument system for NP is succinct, if its communication complexity is polylogarithmic the instance and witness sizes. The seminal works of Kilian '92 and Micali '94 show that such arguments can be constructed under standard cryptographic hardness assumptions with four rounds of interaction, and that they be made non-interactive in the random-oracle model. However, we currently do not have any construction of succinct non-interactive arguments (SNARGs) in the standard model with a proof of security under any simple cryptographic assumption. In this work, we give a broad black-box separation result, showing that black-box reductions cannot be used to prove the security of any SNARG construction based on any falsifiable cryptographic assumption. This includes essentially all common assumptions used in cryptography (one-way functions, trapdoor permutations, DDH, RSA, LWE etc.). More generally, we say that an assumption is falsifiable if it can be modeled as an interactive game between an adversary and an efficient challenger that can efficiently decide if the adversary won the game. This is similar, in spirit, to the notion of falsifiability of Naor '03, and captures the fact that we can efficiently check if an adversarial strategy breaks the assumption. Our separation result also extends to designated verifier SNARGs, where the verifier needs a trapdoor associated with the CRS to verify arguments, and slightly succinct SNARGs, whose size is only required to be sublinear in the statement and witness size.