From secrecy to soundness: efficient verification via secure computation (extended abstract)
From MaRDI portal
Publication:3587376
DOI10.1007/978-3-642-14165-2_14zbMATH Open1287.68041OpenAlexW1521660974MaRDI QIDQ3587376FDOQ3587376
Authors: Benny Applebaum, Yuval Ishai, Eyal Kushilevitz 
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
Recommendations
Cited In (43)
- On black-box verifiable outsourcing
- Practical homomorphic message authenticators for arithmetic circuits
- Two protocols for delegation of computation
- Fine-grained secure computation
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Title not available (Why is that?)
- Succinct non-interactive arguments via linear interactive proofs
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- Verifiable pattern matching on outsourced texts
- Garbled circuits as randomized encodings of functions: a primer
- Efficient proof composition for verifiable computation
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Arguments of proximity (extended abstract)
- Statistical randomized encodings: a complexity theoretic view
- Verifiable computation for randomized algorithm
- An algebraic framework for silent preprocessing with trustless setup and active security
- Doubly efficient interactive proofs over infinite and non-commutative rings
- Batch verifiable computation of outsourced functions
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- On the Power of Secure Two-Party Computation
- Boosting verifiable computation on encrypted data
- The feasibility of outsourced database search in the plain model
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- Constant-round interactive proofs for delegating computation
- On garbling schemes with and without privacy
- On the computational soundness of cryptographically masked flows
- Multikey fully homomorphic encryption and applications
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- Batch verifiable computation with public verifiability for outsourcing polynomials and matrix computations
- Verifiable Computation and Succinct Arguments for NP
- On the power of secure two-party computation
- Algebraic (trapdoor) one-way functions: constructions and applications
- How to prove statements obliviously?
- Attacks on the basic cMix design: on the necessity of commitments and randomized partial checking
- The hunting of the SNARK
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
- Efficient computation outsourcing for inverting a class of homomorphic functions
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Adaptively secure garbled circuits from one-way functions
- Title not available (Why is that?)
- Publicly verifiable database scheme with efficient keyword search
- Refereed delegation of computation
This page was built for publication: From secrecy to soundness: efficient verification via secure computation (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587376)
