Pages that link to "Item:Q5199187"
From MaRDI portal
The following pages link to Verifiable Delegation of Computation over Large Datasets (Q5199187):
Displaying 39 items.
- Refereed delegation of computation (Q385709) (← links)
- Efficient algorithms for secure outsourcing of bilinear pairings (Q476851) (← links)
- Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
- Efficient computation outsourcing for inverting a class of homomorphic functions (Q508607) (← links)
- Batch verifiable computation of outsourced functions (Q887441) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Fine-grained searchable encryption in multi-user setting (Q1741938) (← links)
- Trusted computing with addition machines. II (Q1745689) (← links)
- Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- New publicly verifiable computation for batch matrix multiplication (Q2004759) (← links)
- Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency (Q2051777) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Publicly verifiable database scheme with efficient keyword search (Q2201628) (← links)
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions (Q2306905) (← links)
- Publicly verifiable databases with efficient insertion/deletion operations (Q2396817) (← links)
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud (Q2441503) (← links)
- Verifiable inner product computation on outsourced database for authenticated multi-user data sharing (Q2666869) (← links)
- Non-malleable vector commitments via local equivocability (Q2697900) (← links)
- Vector and functional commitments from lattices (Q2697903) (← links)
- Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations (Q2817469) (← links)
- Secure and Traceable Framework for Data Circulation (Q2817476) (← links)
- Proxy Re-encryption with Delegatable Verifiability (Q2817808) (← links)
- Verifiable Searchable Encryption with Aggregate Keys for Data Sharing in Outsourcing Storage (Q2817810) (← links)
- Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation (Q2890014) (← links)
- Multi-key Homomorphic Authenticators (Q2953787) (← links)
- On Privacy-Preserving Biometric Authentication (Q2980853) (← links)
- Verifiable Computation for Randomized Algorithm (Q3179479) (← links)
- Verifiable and Forward Secure Dynamic Searchable Symmetric Encryption with Storage Efficiency (Q3297524) (← links)
- Multilinear Pseudorandom Functions (Q3448796) (← links)
- Efficient Pseudorandom Functions via On-the-Fly Adaptation (Q3457117) (← links)
- Confidentiality-Preserving Publicly Verifiable Computation (Q4605653) (← links)
- Vector Commitments and Their Applications (Q4916001) (← links)
- Non-malleable vector commitments via local equivocability (Q6054731) (← links)
- Efficient secure storage with version control and key rotation (Q6605322) (← links)
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin} (Q6636508) (← links)
- How to prove statements obliviously? (Q6660309) (← links)
