Improved Delegation of Computation Using Fully Homomorphic Encryption
From MaRDI portal
Publication:3582772
DOI10.1007/978-3-642-14623-7_26zbMath1284.68063OpenAlexW2116653107MaRDI QIDQ3582772
Kai-Min Chung, Yael Kalai, Salil P. Vadhan
Publication date: 24 August 2010
Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_26
verifiable computationoutsourcing computationcomputationally sound proofsuniversal argument systemsworst-case/average-case reductions
Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (42)
Identity-based re-encryption scheme with lightweight re-encryption key generation ⋮ Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ Fine-grained secure computation ⋮ Incompressible functions, relative-error extractors, and the power of nondeterministic reductions ⋮ Verifiable Computation for Randomized Algorithm ⋮ Arguments of Proximity ⋮ Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ Secure outsourcing of modular exponentiations under single untrusted programme model ⋮ 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 ⋮ Refereed delegation of computation ⋮ Batch verifiable computation of outsourced functions ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ Multi-key Homomorphic Authenticators ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme ⋮ Non-interactive universal arguments ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ The hunting of the SNARK ⋮ Confidentiality-Preserving Publicly Verifiable Computation ⋮ Efficient and secure delegation of exponentiation in general groups to a single malicious server ⋮ Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud ⋮ On Privacy-Preserving Biometric Authentication ⋮ Foundations of Homomorphic Secret Sharing ⋮ Secure and efficient delegation of elliptic-curve pairing ⋮ Algebraic (trapdoor) one-way functions: constructions and applications ⋮ Efficient computation outsourcing for inverting a class of homomorphic functions ⋮ Practical homomorphic message authenticators for arithmetic circuits ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ No-signaling linear PCPs ⋮ Delegating a product of group exponentiations with application to signature schemes ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ No-signaling linear PCPs ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions ⋮ Constant-Round Interactive Proofs for Delegating Computation
This page was built for publication: Improved Delegation of Computation Using Fully Homomorphic Encryption
