From Secrecy to Soundness: Efficient Verification via Secure Computation

DOI10.1007/978-3-642-14165-2_14zbMath1287.68041OpenAlexW1521660974MaRDI QIDQ3587376

Eyal Kushilevitz, Yuval Ishai, Benny Applebaum

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_14

Mathematics Subject Classification ID

Related Items (31)

Statistical Randomized Encodings: A Complexity Theoretic View ⋮ 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 ⋮ Verifiable Computation for Randomized Algorithm ⋮ Arguments of Proximity ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Refereed delegation of computation ⋮ Batch verifiable computation of outsourced functions ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings ⋮ The hunting of the SNARK ⋮ Publicly verifiable database scheme with efficient keyword search ⋮ Unnamed Item ⋮ 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 ⋮ 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 ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions ⋮ 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 ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer

This page was built for publication: From Secrecy to Soundness: Efficient Verification via Secure Computation