How to delegate and verify in public: verifiable computation from attribute-based encryption
From MaRDI portal
Recommendations
- Delegatable homomorphic encryption with applications to secure outsourcing of computation
- Batch verifiable computation of outsourced functions
- Boosting verifiable computation on encrypted data
- Hybrid publicly verifiable computation
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
Cited in
(48)- Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing
- Fine-grained searchable encryption in multi-user setting
- Trusted computing with addition machines. II
- 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
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Boosting verifiable computation on encrypted data
- Flexible and efficient verifiable computation on encrypted data
- SNARGs for P from sub-exponential DDH and QR
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
- Secure outsourcing of modular exponentiations under single untrusted programme model
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
- Attribute-based versions of Schnorr and ElGamal
- Verifiable inner product computation on outsourced database for authenticated multi-user data sharing
- Hybrid publicly verifiable computation
- Multi-input functional encryption and its application in outsourcing computation
- 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
- Delegatable homomorphic encryption with applications to secure outsourcing of computation
- Multi-key Homomorphic Authenticators
- Dual system encryption framework in prime-order groups via computational pair encodings
- Verifiable computation for randomized algorithm
- Revocation in publicly verifiable outsourced computation
- Arguments of proximity (extended abstract)
- Bilinear entropy expansion from the decisional linear assumption
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Confidentiality-preserving publicly verifiable computation
- Efficient algorithms for secure outsourcing of bilinear pairings
- Constant-round interactive proofs for delegating computation
- Algebraic (trapdoor) one-way functions: constructions and applications
- Efficient computation outsourcing for inverting a class of homomorphic functions
- How to delegate computations
- No-signaling linear PCPs
- No-signaling linear PCPs
- Non-interactive publicly-verifiable delegation of committed programs
- 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
- Threshold secret sharing with geometric algebras
- Public verifiable server-aided revocable attribute-based encryption
- Adaptively secure attribute-based encryption from witness encryption
- Multi-key fully-homomorphic aggregate MAC for arithmetic circuits
- Batch verifiable computation of outsourced functions
This page was built for publication: How to delegate and verify in public: verifiable computation from attribute-based encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891498)
