Pages that link to "Item:Q5445495"

The following pages link to Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency (Q5445495):

Displaying 42 items.

• Arya: nearly linear-time zero-knowledge proofs for correct program execution (Q1633476) (← links)
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
• Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
• The hunting of the SNARK (Q1698394) (← links)
• Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
• SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
• Continuous verifiable delay functions (Q2055650) (← links)
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
• Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
• Proof-carrying data without succinct arguments (Q2120099) (← links)
• Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
• A PCP theorem for interactive proofs and applications (Q2170038) (← links)
• On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
• Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
• Succinct arguments in the quantum random oracle model (Q2175929) (← links)
• Fully homomorphic NIZK and NIWI proofs (Q2175946) (← links)
• Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)
• Tight security bounds for Micali's SNARGs (Q2695642) (← links)
• On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
• Interactive Oracle Proofs (Q3181021) (← links)
• Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
• Simple verifiable delay functions (Q5090439) (← links)
• Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
• Proof-carrying data from arithmetized random oracles (Q6061366) (← links)
• Zero-knowledge proofs for set membership: efficient, succinct, modular (Q6063130) (← links)
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
• Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
• Practical statistically-sound proofs of exponentiation in any group (Q6104340) (← links)
• Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers (Q6134857) (← links)
• Nova: recursive zero-knowledge arguments from folding schemes (Q6166957) (← links)
• Protostar: generic efficient accumulation/folding for special-sound protocols (Q6562560) (← links)
• (Verifiable) delay functions from Lucas sequences (Q6587959) (← links)
• Folding schemes with selective verification (Q6619934) (← links)
• Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
• Aggregating Falcon signatures with LaBRADOR (Q6648189) (← links)
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)
• FRIDA: data availability sampling from FRI (Q6652989) (← links)
• On cycles of pairing-friendly abelian varieties (Q6653047) (← links)
• Mangrove: a scalable framework for folding-based SNARKs (Q6660304) (← links)