Verifiable Delegation of Computation over Large Datasets

DOI10.1007/978-3-642-22792-9_7zbMath1288.68159OpenAlexW2136936712MaRDI QIDQ5199187

Siavosh Benabbas, Yevgeniy Vahlis, Rosario Gennaro

Publication date: 12 August 2011

Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_7

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (41)

Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation ⋮ Multilinear Pseudorandom Functions ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ Verifiable Computation for Randomized Algorithm ⋮ Efficient Pseudorandom Functions via On-the-Fly Adaptation ⋮ Publicly verifiable databases with efficient insertion/deletion operations ⋮ On succinct non-interactive arguments in relativized worlds ⋮ Verifiable inner product computation on outsourced database for authenticated multi-user data sharing ⋮ Refereed delegation of computation ⋮ Batch verifiable computation of outsourced functions ⋮ Proof-carrying data from arithmetized random oracles ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Private polynomial commitments and applications to MPC ⋮ Multi-key Homomorphic Authenticators ⋮ On the impossibility of algebraic vector commitments in pairing-free groups ⋮ The hunting of the SNARK ⋮ Publicly verifiable database scheme with efficient keyword search ⋮ Confidentiality-Preserving Publicly Verifiable Computation ⋮ Non-malleable vector commitments via local equivocability ⋮ Vector and functional commitments from lattices ⋮ Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud ⋮ On Privacy-Preserving Biometric Authentication ⋮ Efficient algorithms for secure outsourcing of bilinear pairings ⋮ Verifiable and Forward Secure Dynamic Searchable Symmetric Encryption with Storage Efficiency ⋮ Fine-grained searchable encryption in multi-user setting ⋮ Algebraic (trapdoor) one-way functions: constructions and applications ⋮ Trusted computing with addition machines. II ⋮ Efficient computation outsourcing for inverting a class of homomorphic functions ⋮ Practical homomorphic message authenticators for arithmetic circuits ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Vector Commitments and Their Applications ⋮ New publicly verifiable computation for batch matrix multiplication ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ Non-malleable vector commitments via local equivocability ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations ⋮ Secure and Traceable Framework for Data Circulation ⋮ Proxy Re-encryption with Delegatable Verifiability ⋮ Verifiable Searchable Encryption with Aggregate Keys for Data Sharing in Outsourcing Storage ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions

This page was built for publication: Verifiable Delegation of Computation over Large Datasets