Pages that link to "Item:Q3587376"
From MaRDI portal
The following pages link to From Secrecy to Soundness: Efficient Verification via Secure Computation (Q3587376):
Displaying 31 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Refereed delegation of computation (Q385709) (← links)
- Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
- Efficient computation outsourcing for inverting a class of homomorphic functions (Q508607) (← links)
- Batch verifiable computation of outsourced functions (Q887441) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
- Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency (Q2051777) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Publicly verifiable database scheme with efficient keyword search (Q2201628) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions (Q2306905) (← links)
- Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations (Q2817469) (← links)
- The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) (← links)
- Verifiable Pattern Matching on Outsourced Texts (Q2827727) (← links)
- On Garbling Schemes with and Without Privacy (Q2827734) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Verifiable Computation for Randomized Algorithm (Q3179479) (← links)
- Statistical Randomized Encodings: A Complexity Theoretic View (Q3448769) (← links)
- Arguments of Proximity (Q3457077) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- (Q6081719) (← links)
- Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)