Pages that link to "Item:Q2826047"
From MaRDI portal
The following pages link to Practical verified computation with streaming interactive proofs (Q2826047):
Displayed 21 items.
- Refereed delegation of computation (Q385709) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Trusted computing with addition machines. II (Q1745689) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← 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)
- Efficient proof composition for verifiable computation (Q2167734) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Arthur-Merlin streaming complexity (Q2347803) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- Verifiable Stream Computation and Arthur--Merlin Communication (Q5232326) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Non-interactive publicly-verifiable delegation of committed programs (Q6067380) (← links)
- Brakedown: linear-time and field-agnostic SNARKs for R1CS (Q6145784) (← links)
- Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)