Quantum rewinding for many-round protocols

DOI10.1007/978-3-031-22318-1_4MaRDI QIDQ6169349zbMATH OpenOpenAlexFDO

Authors Russell W. F. Lai, Giulio Malavolta, Nicholas Spooner

Publication date 14 August 2023

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22318-1_4

zbMATH Keywords

bulletproofsknowledge-soundnesslatticequantumsuccinct arguments

Mathematics Subject Classification ID

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

Recommendations

• Quantum proofs of knowledge
• A black-box approach to post-quantum zero-knowledge in constant rounds
• The round complexity of quantum zero-knowledge
• Quantum-Secure Coin-Flipping and Applications
• Succinct arguments in the quantum random oracle model

Cites work

• A compressed \(\varSigma \)-protocol theory for lattices
• A non-PCP approach to succinct quantum-safe zero-knowledge
• Coding theorem and strong converse for quantum channels
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Computationally binding quantum commitments
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• Interactive oracle proofs
• Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
• Making NTRU as secure as worst-case problems over ideal lattices
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
• Quantum proofs of knowledge
• Revisiting post-quantum Fiat-Shamir
• Schrödinger's pirate: how to trace a quantum decoder
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
• Sumcheck arguments and their applications

Cited in

(9)

• Expected-time cryptography: generic techniques and applications to concrete soundness
• Lattice-based timed cryptography
• Commitments to quantum states
• Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
• Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
• Straight-line knowledge extraction for multi-round protocols
• Secure and efficient quantum signature scheme based on the controlled unitary operations encryption
• The Fiat-Shamir transformation of (_1,,_ )-special-sound interactive proofs
• Quantum rewinding for IOP-based succinct arguments

This page was built for publication: Quantum rewinding for many-round protocols

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