How to Construct Quantum Random Functions

DOI10.1145/3450745MaRDI QIDQ5056422zbMATH OpenOpenAlexWikidataFDO

Authors Mark Zhandry

Publication date 8 December 2022

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3450745

zbMATH Keywords

pseudorandom functionsecurity proofs

Mathematics Subject Classification ID

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

Recommendations

• A combinatorial approach to quantum random functions
• XOR of PRPs in a quantum world
• Quantum security of NMAC and related constructions. PRF domain extension against quantum attacks
• Pseudorandom functions and lattices
• Quantum indistinguishability of random sponges

Cited in

(12)

• A combinatorial approach to quantum random functions
• QCB is blindly unforgeable
• Quantum attacks on PRFs based on public random permutations
• A detailed analysis of Fiat-Shamir with aborts
• New Demiric–Selçuk meet-in-the-middle attacks on Misty and Feistel schemes
• On quantum secure compressing pseudorandom functions
• Decoherence and quantum threats in voice biometric authentication with post-quantum countermeasures
• Quantum pseudorandom scramblers
• Generalized hybrid search with applications to blockchains and hash function security
• Security framework for quantum distance-bounding
• Generic composition: from classical to quantum security
• Quantum pseudorandom scramblers

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 Q5056422)