Verifiable delegation of computation over large datasets
From MaRDI portal
Recommendations
- Verifiable set operations over outsourced databases
- Verifiable computation over large database with incremental updates
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
- Boosting verifiable computation on encrypted data
- Batch verifiable computation of outsourced functions
Cited in
(55)- Verifiable and forward secure dynamic searchable symmetric encryption with storage efficiency
- Publicly verifiable databases with efficient insertion/deletion operations
- Multi-key fully-homomorphic aggregate MAC for arithmetic circuits
- Signatures of correct computation
- Delegatable homomorphic encryption with applications to secure outsourcing of computation
- New publicly verifiable computation for batch matrix multiplication
- Verifiable Computation over Large Database with Incremental Updates
- Trusted computing with addition machines. II
- Verifiable private polynomial evaluation
- Practical homomorphic message authenticators for arithmetic circuits
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
- Multilinear pseudorandom functions
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Vector commitments and their applications
- Fine-grained searchable encryption in multi-user setting
- Secure and traceable framework for data circulation
- Proxy re-encryption with delegatable verifiability
- Succinct non-interactive arguments via linear interactive proofs
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- Private polynomial commitments and applications to MPC
- On privacy-preserving biometric authentication
- Efficient pseudorandom functions via on-the-fly adaptation
- Efficient secure storage with version control and key rotation
- Multi-key Homomorphic Authenticators
- Optimal verification of operations on dynamic sets
- Verifiable set operations over outsourced databases
- Proof-carrying data from arithmetized random oracles
- Verifiable computation for randomized algorithm
- Succinct vector, polynomial, and functional commitments from lattices
- Functional commitments for all functions, with transparent setup and from SIS
- Batch verifiable computation of outsourced functions
- Efficient algorithms for secure outsourcing of bilinear pairings
- On succinct non-interactive arguments in relativized worlds
- Verifiable inner product computation on outsourced database for authenticated multi-user data sharing
- Boosting verifiable computation on encrypted data
- Confidentiality-preserving publicly verifiable computation
- Nearly optimal verifiable data streaming
- Verifiable searchable encryption with aggregate keys for data sharing in outsourcing storage
- The feasibility of outsourced database search in the plain model
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Algebraic (trapdoor) one-way functions: constructions and applications
- Batch verifiable computation with public verifiability for outsourcing polynomials and matrix computations
- The hunting of the SNARK
- How to prove statements obliviously?
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
- Efficient computation outsourcing for inverting a class of homomorphic functions
- Non-malleable vector commitments via local equivocability
- Vector and functional commitments from lattices
- On the impossibility of algebraic vector commitments in pairing-free groups
- Non-malleable vector commitments via local equivocability
- Verifiable computation over large database with incremental updates
- Refereed delegation of computation
- Publicly verifiable database scheme with efficient keyword search
- Batch verifiable computation of polynomials on outsourced data
This page was built for publication: Verifiable delegation of computation over large datasets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199187)
