Accountable-subgroup multisignatures: extended abstract
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
The random oracle methodology, revisited
Journal of the ACM (JACM)
Simple PCPs with poly-log rate and query complexity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
New and improved constructions of non-malleable cryptographic protocols
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Concurrent Non-Malleable Commitments
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Black-box constructions for secure computation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Zero-knowledge from secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
A Note on the Random Oracle Methodology
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Proceedings of the forty-first annual ACM symposium on Theory of computing
ACM Transactions on Computation Theory (TOCT)
Parallel repetition of computationally sound protocols revisited
TCC'07 Proceedings of the 4th conference on Theory of cryptography
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Sub-linear zero-knowledge argument for correctness of a shuffle
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Incrementally verifiable computation or proofs of knowledge imply time/space efficiency
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On seed-incompressible functions
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Improved delegation of computation using fully homomorphic encryption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Limitation on the rate of families of locally testable codes
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Limitation on the rate of families of locally testable codes
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
PCPs and the hardness of generating private synthetic data
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Toward practical and unconditional verification of remote computations
HotOS'13 Proceedings of the 13th USENIX conference on Hot topics in operating systems
Homomorphic signatures for polynomial functions
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Short locally testable codes and proofs
Studies in complexity and cryptography
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Practical delegation of computation using multiple servers
Proceedings of the 18th ACM conference on Computer and communications security
Black-Box Constructions of Protocols for Secure Computation
SIAM Journal on Computing
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 round-efficient argument systems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Sufficient conditions for collision-resistant hashing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Perfectly secure multiparty computation and the computational overhead of cryptography
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
TCC'06 Proceedings of the Third conference on Theory of Cryptography
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
On efficient zero-knowledge PCPs
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Multiparty computation with low communication, computation and interaction via threshold FHE
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Optimal security proofs for full domain hash, revisited
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Taking proof-based verified computation a few steps closer to practicality
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Two protocols for delegation of computation
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Publicly verifiable proofs of sequential work
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Commitments and efficient zero-knowledge proofs from learning parity with noise
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
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
Multi-Client non-interactive verifiable computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Delegation of computation with verification outsourcing: curious verifiers
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Non-black-box simulation from one-way functions and applications to resettable security
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Attribute-based encryption for circuits
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
Rational arguments: single round delegation with sublinear verification
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a novel and meaningful framework, answers to old and new questions in complexity theory. In particular, given a random oracle or a new complexity assumption, they enable us to prove that verifying is easier than deciding for all theorems; provide a quite effective way to prove membership in computationally hard languages (such as ${\cal C}o$-$\cal N \cal P$-complete ones); and show that every computation possesses a short certificate vouching its correctness. Finally, if a special type of computationally sound proof exists, we show that Blum's notion of program checking can be meaningfully broadened so as to prove that $\cal N \cal P$-complete languages are checkable.