Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
From MaRDI portal
Publication:3582771
DOI10.1007/978-3-642-14623-7_25zbMath1284.68065OpenAlexW1557386445MaRDI QIDQ3582771
Bryan Parno, Rosario Gennaro, Craig Gentry
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_25
Related Items (92)
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 ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Incompressible functions, relative-error extractors, and the power of nondeterministic reductions ⋮ Revocation in Publicly Verifiable Outsourced Computation ⋮ CRT-Based Outsourcing Algorithms for Modular Exponentiations ⋮ Verifiable Computation for Randomized Algorithm ⋮ Arguments of Proximity ⋮ LOVE a pairing ⋮ Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ Adaptive security of practical garbling schemes ⋮ Secure outsourcing of modular exponentiations under single untrusted programme model ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ 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 ⋮ Verifiable inner product computation on outsourced database for authenticated multi-user data sharing ⋮ Refereed delegation of computation ⋮ Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Batch verifiable computation of outsourced functions ⋮ Secure Two-Party Computation: A Visual Way ⋮ Private polynomial commitments and applications to MPC ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ Multi-key Homomorphic Authenticators ⋮ Reactive Garbling: Foundation, Instantiation, Application ⋮ 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 ⋮ Rigidity of quantum steering and one-sided device-independent verifiable quantum computation ⋮ Function-Dependent Commitments for Verifiable Multi-party Computation ⋮ Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ $$\mathsf {HIKE}$$ : Walking the Privacy Trail ⋮ 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 ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ The hunting of the SNARK ⋮ Publicly verifiable database scheme with efficient keyword search ⋮ Confidentiality-Preserving Publicly Verifiable Computation ⋮ Efficient and secure delegation of exponentiation in general groups to a single malicious server ⋮ Unnamed Item ⋮ Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud ⋮ On Privacy-Preserving Biometric Authentication ⋮ Thrackles: An Improved Upper Bound ⋮ Efficient algorithms for secure outsourcing of bilinear pairings ⋮ Secure and efficient delegation of elliptic-curve pairing ⋮ Perennial secure multi-party computation of universal Turing machine ⋮ Algebraic (trapdoor) one-way functions: constructions and applications ⋮ Trusted computing with addition machines. II ⋮ Secure Outsourced Computation ⋮ Efficient computation outsourcing for inverting a class of homomorphic functions ⋮ Practical homomorphic message authenticators for arithmetic circuits ⋮ Secure computation without computers ⋮ How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields ⋮ Verifiable pattern matching on outsourced texts ⋮ New publicly verifiable computation for batch matrix multiplication ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ No-signaling linear PCPs ⋮ Delegating a product of group exponentiations with application to signature schemes ⋮ No-signaling linear PCPs ⋮ Multi-input Functional Encryption and Its Application in Outsourcing Computation ⋮ On subversion-resistant SNARKs ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ On the power of secure two-party computation ⋮ Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations ⋮ Secure and Traceable Framework for Data Circulation ⋮ Boosting verifiable computation on encrypted data ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation ⋮ Verifiable Multi-party Computation with Perfectly Private Audit Trail ⋮ Flexible and efficient verifiable computation on encrypted data ⋮ The Feasibility of Outsourced Database Search in the Plain Model ⋮ Verifiable Pattern Matching on Outsourced Texts ⋮ On Garbling Schemes with and Without Privacy ⋮ On the Power of Secure Two-Party Computation ⋮ Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Outsourcing computation: the minimal refereed mechanism ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets ⋮ Round-optimal black-box commit-and-prove with succinct communication ⋮ Progressive and efficient verification for digital signatures ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs
This page was built for publication: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
