Cryptography from pseudorandom quantum states

DOI10.1007/978-3-031-15802-5_8zbMath1523.81051arXiv2112.10020MaRDI QIDQ6097262

Prabhanjan V. Ananth, Henry C. Yuen, Luowen Qian

Publication date: 12 June 2023

Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45) Quantum cryptography (quantum-theoretic aspects) (81P94) Quantum state tomography, quantum state discrimination (81P18)

Related Items (6)

Pseudorandom (function-Like) quantum state generators: new definitions and applications ⋮ Black-box separations for non-interactive classical commitments in a quantum world ⋮ A new framework for quantum oblivious transfer ⋮ Cloning games: a general framework for unclonable primitives ⋮ Cryptography with certified deletion ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Pseudorandom quantum states
• Bit commitment using pseudorandomness
• A note on computational indistinguishability
• Oblivious transfer is in MiniQCrypt
• Scalable pseudorandom quantum states
• One-way functions imply secure computation in a quantum world
• (Pseudo) random quantum states with binary phase
• Classical binding for quantum commitments
• Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)
• Quantum computing, postselection, and probabilistic polynomial-time
• Computationally Binding Quantum Commitments
• Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract)

This page was built for publication: Cryptography from pseudorandom quantum states