Zero knowledge proofs of identity
STOC '87 Proceedings of the nineteenth 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
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second 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
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Nearly-linear size holographic proofs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Non-Interactive Zero-Knowledge Proof Systems
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Low Communication 2-Prover Zero-Knowledge Proofs for NP
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Nondeterministic exponential time has two-prover interactive protocols
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Multiple non-interactive zero knowledge proofs based on a single random string
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Fast approximate probabilistically checkable proofs
Information and Computation
Black-box constructions for secure computation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Non-interactive verifiable computing: outsourcing computation to untrusted workers
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Toward practical and unconditional verification of remote computations
HotOS'13 Proceedings of the 13th USENIX conference on Hot topics in operating systems
Verifiable delegation of computation over large datasets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Trust extension as a mechanism for secure code execution on commodity computers
Trust extension as a mechanism for secure code execution on commodity computers
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
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
Taking proof-based verified computation a few steps closer to practicality
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Publicly verifiable delegation of large polynomials and matrix computations, with applications
Proceedings of the 2012 ACM conference on Computer and communications security
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
Outsourcing computation of modular exponentiations in cloud computing
Cluster Computing
| Hi-index | 0.00 |
We consider complexity of perfect zero-knowledge arguments [4]. Let T denote the time needed to (deterministically) check a proof and let L denote an appropriate security parameter. We introduce new techniques for implementing very efficient zero-knowledge arguments. The resulting argument has the following features: 驴 The arguer can, if provided with the proof that can be deterministically checked in O(T) time, run in time O(TLO(1)). The best previous bound was O(T1+驴LO(1)). 驴 The protocol can be simulated in time O(LO(1)). The best previous bound was O(T1+驴LO(1)). 驴 A communication complexity of O(LlgL), where L is the security parameter against the prover. The best previous known bound was O(LlgT).This can be based on fairly general algebraic assumptions, such as the hardness of discrete logarithms.Aside from the quantitative improvements, our results become qualitatively different when considering arguers that can run for some super-polynomial but bounded amount of time. In this scenario, we give the first arguments zero-knowledge arguments and the first "constructive" arguments in which the complexity of arguing a proof is tightly bounded by the complexity of verifying the proof.We obtain our results by a hybrid construction that combines the best features of different PCPs. This allows us to obtain better bounds than the previous technique, which only used a single PCP. In our proof of soundness we exploit the error correction capabilities as well as the soundness of the known PCPs.