Quantum rewinding for IOP-based succinct arguments

DOI10.1007/978-3-032-12296-4_16MaRDI QIDQ7233222zbMATH OpenFDO

Authors Alessandro Chiesa, Zijing Di, Ziyi Guan, Nicholas Spooner

Publication date 24 April 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12296-4_16

zbMATH Keywords

post-quantum securityquantum rewindingsuccinct arguments

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• A black-box approach to post-quantum zero-knowledge in constant rounds
• A non-PCP approach to succinct quantum-safe zero-knowledge
• BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Collapse-binding quantum commitments without random oracles
• Computationally binding quantum commitments
• Constant-round interactive proofs for delegating computation
• Faster sounder succinct arguments and \textsf{IOP}s
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Interactive oracle proofs
• Interactive oracle proofs with constant rate and query complexity
• IOPs with inverse polynomial soundness error
• Lattice-based functional commitments: fast verification and cryptanalysis
• Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
• Linear-time arguments with sublinear verification from tensor codes
• Low-complexity cryptographic hash functions
• Post-quantum succinct arguments: breaking the quantum rewinding barrier
• Post-quantum zero knowledge, revisited or: how to do quantum rewinding undetectably
• Proving as fast as computing: succinct arguments with constant prover overhead
• Quantum proofs of knowledge
• Quantum rewinding for many-round protocols
• Rinocchio: SNARKs for ring arithmetic
• Scalable zero knowledge with no trusted setup
• Separating succinct non-interactive arguments from all falsifiable assumptions
• STIR: Reed-Solomon proximity testing with fewer queries
• Succinct arguments in the quantum random oracle model
• Succinct classical verification of quantum computation
• Universal Arguments and their Applications
• Untangling the security of Kilian's protocol: upper and lower bounds
• Vector commitments and their applications
• Zero-knowledge against quantum attacks

Cited in

(1)

• How to prove post-quantum security for succinct non-interactive reductions

This page was built for publication: Quantum rewinding for IOP-based succinct arguments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233222)