How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
From MaRDI portal
Publication:2891498
DOI10.1007/978-3-642-28914-9_24zbMath1304.68043OpenAlexW167928972MaRDI QIDQ2891498
Vinod Vaikuntanathan, Bryan Parno, Mariana Raykova
Publication date: 15 June 2012
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_24
Related Items (41)
Revocation in Publicly Verifiable Outsourced Computation ⋮ Attribute-based versions of Schnorr and ElGamal ⋮ Verifiable Computation for Randomized Algorithm ⋮ Arguments of Proximity ⋮ Bilinear Entropy Expansion from the Decisional Linear Assumption ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Secure outsourcing of modular exponentiations under single untrusted programme model ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Verifiable inner product computation on outsourced database for authenticated multi-user data sharing ⋮ Batch verifiable computation of outsourced functions ⋮ Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ Multi-key Homomorphic Authenticators ⋮ Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings ⋮ Function-Dependent Commitments for Verifiable Multi-party Computation ⋮ An Efficient and Provably Secure Private Polynomial Evaluation Scheme ⋮ Game-Theoretic Analysis of an Incentivized Verifiable Computation System ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing ⋮ Confidentiality-Preserving Publicly Verifiable Computation ⋮ Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud ⋮ Efficient algorithms for secure outsourcing of bilinear pairings ⋮ 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 ⋮ Publicly verifiable searchable symmetric encryption based on efficient cryptographic components ⋮ New publicly verifiable computation for batch matrix multiplication ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ No-signaling linear PCPs ⋮ No-signaling linear PCPs ⋮ Multi-input Functional Encryption and Its Application in Outsourcing Computation ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations ⋮ Proxy Re-encryption with Delegatable Verifiability ⋮ Boosting verifiable computation on encrypted data ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions ⋮ Flexible and efficient verifiable computation on encrypted data ⋮ Constant-Round Interactive Proofs for Delegating Computation
This page was built for publication: How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
