Nonadaptive one-way to hiding implies adaptive quantum reprogramming

DOI10.1007/978-981-95-5125-5_10MaRDI QIDQ7232836zbMATH OpenFDO

Authors Joseph Jaeger

Publication date 23 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5125-5_10

zbMATH Keywords

one-way to hidingprovable securitypublic-key encryptionquantum random oracle modelrandom oracle model

Mathematics Subject Classification ID

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

Cites work

• A detailed analysis of Fiat-Shamir with aborts
• Classically verifiable NIZK for QMA with preprocessing
• How to construct quantum random functions
• How to record quantum queries, and applications to quantum indifferentiability
• scientific article; zbMATH DE number 2086702 (Why is no real title available?)
• IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
• Leighton-Micali hash-based signatures in the quantum random-oracle model
• Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
• Mitigating multi-target attacks in hash-based signatures
• Non-interactive zero-knowledge proofs in the quantum random oracle model
• On the (in)security of the BUFF transform
• Post-quantum security of the Even-Mansour cipher
• Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
• Post-quantum security of tweakable Even-Mansour, and applications
• Probabilistic hash-and-sign with retry in the quantum random oracle model
• Quantum key-length extension
• Quantum position verification in the random oracle model
• Quantum security proofs using semi-classical oracles
• Quantum-access security of hash-based signature schemes
• Random oracles in a quantum world
• Revocable Quantum Timed-Release Encryption
• Secure identity-based encryption in the quantum random oracle model
• Selective opening security in the quantum random oracle model, revisited
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The “Coefficients H” Technique
• Tight adaptive reprogramming in the QROM
• Tight security bounds for key-alternating ciphers
• Tighter proofs of CCA security in the quantum random oracle model
• Towards compressed permutation oracles

Cited in

(2)

• Secure cloud storage: modularization, network adversaries and adaptive corruptions
• Non-adaptive one-way to hiding not only implies adaptive quantum reprogramming, but also does better

This page was built for publication: Nonadaptive one-way to hiding implies adaptive quantum reprogramming

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