Adaptive versus static multi-oracle algorithms, and quantum security of a split-key PRF

DOI10.1007/978-3-031-22318-1_2zbMath1519.94108arXiv2206.08132OpenAlexW4312620128MaRDI QIDQ6169347

Yu-Hsuan Huang, Jelle Don, Serge Fehr

Publication date: 14 August 2023

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

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

zbMATH Keywords

generic compilerhash-based split-key PRF

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Cryptography (94A60) Theory of compilers and interpreters (68N20) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Revisiting TESLA in the quantum random oracle model
• KEM combiners
• On the compressed-oracle technique, and post-quantum security of proofs of sequential work
• Post-quantum security of the Even-Mansour cipher
• The lattice-based digital signature scheme qTESLA
• How to record quantum queries, and applications to quantum indifferentiability
• Quantum key-length extension
• Random Oracles in a Quantum World

This page was built for publication: Adaptive versus static multi-oracle algorithms, and quantum security of a split-key PRF