Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On hiding information from an oracle
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Structure and importance of logspace-MOD-classes
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
On arithmetic branching programs
Journal of Computer and System Sciences
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Hiding Instances in Multioracle Queries
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS
Computational Complexity
Verifying and decoding in constant depth
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Probabilistically Checkable Arguments
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Efficient multi-party computation over rings
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
How to securely outsource cryptographic computations
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Optimal authenticated data structures with multilinear forms
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Randomly encoding functions: a new cryptographic paradigm
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Optimal verification of operations on dynamic sets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Verifiable delegation of computation over large datasets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
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
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
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
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Integrity verification of cloud-hosted data analytics computations
Proceedings of the 1st International Workshop on Cloud Intelligence
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
Efficient query integrity for outsourced dynamic databases
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop
Publicly verifiable delegation of large polynomials and matrix computations, with applications
Proceedings of the 2012 ACM conference on Computer and communications security
Foundations of garbled circuits
Proceedings of the 2012 ACM conference on Computer and communications security
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Adaptively secure garbling with applications to one-time programs and secure outsourcing
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
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
Algebraic (trapdoor) one-way functions and their applications
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Attribute-based encryption for circuits
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
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
Verifiable delegation of computation on outsourced data
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Rational arguments: single round delegation with sublinear verification
Proceedings of the 5th conference on Innovations in theoretical computer science
Outsourcing computation of modular exponentiations in cloud computing
Cluster Computing
| Hi-index | 0.00 |
We study the problem of verifiable computation (VC) in which a computationally weak client wishes to delegate the computation of a function f on an input x to a computationally strong but untrusted server. We present new general approaches for constructing VC protocols, as well as solving the related problems of program checking and self-correcting. The new approaches reduce the task of verifiable computation to suitable variants of secure multiparty computation (MPC) protocols. In particular, we show how to efficiently convert the secrecy property of MPC protocols into soundness of a VC protocol via the use of a message authentication code (MAC). The new connections allow us to apply results from the area of MPC towards simplifying, unifying, and improving over previous results on VC and related problems. In particular, we obtain the following concrete applications: (1) The first VC protocols for arithmetic computations which only make a black-box use of the underlying field or ring; (2) a non-interactive VC protocol for boolean circuits in the preprocessing model, conceptually simplifying and improving the online complexity of a recent protocol of Gennaro et al. (Cryptology ePrint Archive: Report 2009/547); (3) NC0 self-correctors for complete languages in the complexity class NC1 and various log-space classes, strengthening previous AC0 correctors of Goldwasser et al. (STOC 2008).