Separating succinct non-interactive arguments from all falsifiable assumptions
- 6 June 2011
- proceedings article
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Are PCPs Inherent in Efficient Arguments?computational complexity, 2010
- Succinct NP Proofs from an Extractability AssumptionLecture Notes in Computer Science, 2008
- Polylogarithmic two-round argument systemsJournal of Mathematical Cryptology, 2008
- On the Possibility of One-Message Weak Zero-KnowledgeLecture Notes in Computer Science, 2004
- Notions of Reducibility between Cryptographic PrimitivesLecture Notes in Computer Science, 2004
- Computational Analogues of EntropyLecture Notes in Computer Science, 2003
- On interactive proofs with a laconic provercomputational complexity, 2002
- On the complexity of interactive proofs with bounded communicationInformation Processing Letters, 1998
- Proof verification and the hardness of approximation problemsJournal of the ACM, 1998
- Zur Theorie der GesellschaftsspieleMathematische Annalen, 1928