Improved delegation of computation using fully homomorphic encryption
From MaRDI portal
Recommendations
- Delegatable homomorphic encryption with applications to secure outsourcing of computation
- Fully homomorphic encryption using ideal lattices
- Computing arbitrary functions of encrypted data
- A secure outsourced Turing-equivalent computation scheme against semi-honest workers using fully homomorphic encryption
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
Cited in
(48)- Fine-grained secure computation
- The hunting of the SNARK
- Practical homomorphic message authenticators for arithmetic circuits
- Efficient and secure outsourced approximate pattern matching protocol
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- Delegating a product of group exponentiations with application to signature schemes
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Verifiable single-server private information retrieval from LWE with binary errors
- Succinct non-interactive arguments via linear interactive proofs
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Secure and efficient delegation of elliptic-curve pairing
- 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
- Secure and efficient outsourcing computation on large-scale linear regressions
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives
- Indistinguishability obfuscation: from approximate to exact
- Batch verifiable computation with public verifiability for outsourcing polynomials and matrix computations
- Delegatable homomorphic encryption with applications to secure outsourcing of computation
- Multi-key Homomorphic Authenticators
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- On privacy-preserving biometric authentication
- A secure outsourced Turing-equivalent computation scheme against semi-honest workers using fully homomorphic encryption
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Verifiable computation for randomized algorithm
- Adaptive succinct garbled RAM or: how to delegate your database
- Arguments of proximity (extended abstract)
- Refereed delegation of computation
- Multikey fully homomorphic encryption and applications
- Confidentiality-preserving publicly verifiable computation
- Foundations of homomorphic secret sharing
- Constant-round interactive proofs for delegating computation
- Algebraic (trapdoor) one-way functions: constructions and applications
- Identity-based re-encryption scheme with lightweight re-encryption key generation
- Efficient computation outsourcing for inverting a class of homomorphic functions
- No-signaling linear PCPs
- No-signaling linear PCPs
- Non-interactive publicly-verifiable delegation of committed programs
- Rinocchio: SNARKs for ring arithmetic
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme
- Parallelizable delegation from LWE
- Non-interactive universal arguments
- On black-box verifiable outsourcing
- Doubly efficient cryptography: commitments, arguments and RAM MPC
- How to prove statements obliviously?
- Multi-key fully-homomorphic aggregate MAC for arithmetic circuits
- Batch verifiable computation of outsourced functions
This page was built for publication: Improved delegation of computation using fully homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582772)
