How to construct quantum random functions

DOI10.1109/FOCS.2012.37MaRDI QIDQ6988175zbMATH OpenFDO

Authors Mark Zhandry

Publication date 5 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2012.37

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(20)

• Secret sharing with publicly verifiable deletion
• Quantum public-key encryption of quantum states, and more
• Quantum pseudoentanglement
• On security notions for encryption in a quantum world
• Quantum CCA-secure PKE, revisited
• New quantum attacks on some Feistel variants
• The security of hash-and-sign with retry against superposition attacks
• Real-valued somewhat-pseudorandom unitaries
• Quantum algorithms for fast correlation attacks on LFSR-based stream ciphers
• Quantum cryptanalysis of reduced-round E2 algorithm
• On quantum query complexities of collision-finding in non-uniform random functions
• Nonadaptive one-way to hiding implies adaptive quantum reprogramming
• MicroCrypt assumptions with quantum input sampling and pseudodeterminism: constructions and separations
• NISQ security and complexity via simple classical reasoning
• On the efficiency of generic, quantum cryptographic constructions
• On quantum simulation-soundness
• Hash-based multi-signatures for post-quantum Ethereum
• On TRP-RF switch in the quantum query model
• Scalable two-round n-out-of-n and multi-signatures from lattices in the quantum random oracle model
• Quantum black-box separations: succinct non-interactive arguments from falsifiable assumptions

This page was built for publication: How to construct quantum random functions

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