The following pages link to (Q3549691):
Displaying 50 items.
- Refereed delegation of computation (Q385709) (← links)
- Efficient algorithms for secure outsourcing of bilinear pairings (Q476851) (← links)
- Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
- Efficient computation outsourcing for inverting a class of homomorphic functions (Q508607) (← links)
- Best-order streaming model (Q534570) (← links)
- Outsourcing computation: the minimal refereed mechanism (Q777972) (← links)
- Batch verifiable computation of outsourced functions (Q887441) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Trusted computing with addition machines. II (Q1745689) (← links)
- Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← 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)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- Witness indistinguishability for any single-round argument with applications to access control (Q2055687) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) (Q2148762) (← links)
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits (Q2151307) (← links)
- Efficient proof composition for verifiable computation (Q2167734) (← links)
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing (Q2224811) (← links)
- Elimination-based certificates for triangular equivalence and rank profiles (Q2284959) (← links)
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions (Q2306905) (← links)
- Arthur-Merlin streaming complexity (Q2347803) (← links)
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud (Q2441503) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Rational Sumchecks (Q2799100) (← links)
- Interactive Coding for Interactive Proofs (Q2799101) (← links)
- Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations (Q2817469) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Multi-key Homomorphic Authenticators (Q2953787) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Measurement-Based and Universal Blind Quantum Computation (Q3575028) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- (Q4993281) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- (Q5075766) (← links)
- (Q5121910) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
