Pages that link to "Item:Q2826047"

The following pages link to Practical verified computation with streaming interactive proofs (Q2826047):

Displaying 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)
• Fiat-Shamir security of FRI and related SNARKs (Q6562558) (← links)
• \textsf{Jolt}: SNARKs for virtual machines via lookups (Q6637560) (← links)
• On soundness notions for interactive oracle proofs (Q6655868) (← links)