Folding schemes with selective verification

DOI10.1007/978-3-031-44469-2_12zbMATH Open1547.94408MaRDI QIDQ6619934

Carla Ràfols, Alexandros Zacharakis

Publication date: 16 October 2024

zbMATH Keywords

aggregationfoldingdelegation of computationSNARKsvector commitmentsverifiable databases

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Recursive proof composition from accumulation schemes
• Linear-time arguments with sublinear verification from tensor codes
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• Proof-carrying data without succinct arguments
• Constant-Size Commitments to Polynomials and Their Applications
• Interactive Oracle Proofs
• Vector Commitments and Their Applications
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Recursive composition and bootstrapping for SNARKS and proof-carrying data
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Nova: recursive zero-knowledge arguments from folding schemes

This page was built for publication: Folding schemes with selective verification