On the compressed-oracle technique, and post-quantum security of proofs of sequential work

DOI10.1007/978-3-030-77886-6_21zbMath1479.94145arXiv2010.11658OpenAlexW3097686387MaRDI QIDQ2056756

Yu-Hsuan Huang, Tai-Ning Liao, Serge Fehr, Kai-Min Chung

Publication date: 8 December 2021

Full work available at URL: https://arxiv.org/abs/2010.11658

zbMATH Keywords

quantum algorithmshash chainquantum random oracle model

Mathematics Subject Classification ID

Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (7)

Online-extractability in the quantum random-oracle model ⋮ QCCA-secure generic transformations in the quantum random oracle model ⋮ On the impossibility of key agreements from quantum random oracles ⋮ Efficient NIZKs and signatures from commit-and-open protocols in the QROM ⋮ Adaptive versus static multi-oracle algorithms, and quantum security of a split-key PRF ⋮ Tighter QCCA-secure key encapsulation mechanism with explicit rejection in the quantum random oracle model ⋮ On the compressed-oracle technique, and post-quantum security of proofs of sequential work

Cites Work

• Unnamed Item
• Unnamed Item
• Simple proofs of sequential work
• On the compressed-oracle technique, and post-quantum security of proofs of sequential work
• Succinct arguments in the quantum random oracle model
• 4-round Luby-Rackoff construction is a qPRP
• How to record quantum queries, and applications to quantum indifferentiability
• Revisiting post-quantum Fiat-Shamir
• Optimal parallel quantum query algorithms
• The random oracle methodology, revisited
• Random Oracles in a Quantum World
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Strengths and Weaknesses of Quantum Computing
• Revocable Quantum Timed-Release Encryption

This page was built for publication: On the compressed-oracle technique, and post-quantum security of proofs of sequential work