Cryptography from pseudorandom quantum states
From MaRDI portal
Abstract: Pseudorandom states, introduced by Ji, Liu and Song (Crypto'18), are efficiently-computable quantum states that are computationally indistinguishable from Haar-random states. One-way functions imply the existence of pseudorandom states, but Kretschmer (TQC'20) recently constructed an oracle relative to which there are no one-way functions but pseudorandom states still exist. Motivated by this, we study the intriguing possibility of basing interesting cryptographic tasks on pseudorandom states. We construct, assuming the existence of pseudorandom state generators that map a -bit seed to a -qubit state, (a) statistically binding and computationally hiding commitments and (b) pseudo one-time encryption schemes. A consequence of (a) is that pseudorandom states are sufficient to construct maliciously secure multiparty computation protocols in the dishonest majority setting. Our constructions are derived via a new notion called pseudorandom function-like states (PRFS), a generalization of pseudorandom states that parallels the classical notion of pseudorandom functions. Beyond the above two applications, we believe our notion can effectively replace pseudorandom functions in many other cryptographic applications.
Recommendations
- Quantum Cryptography Based on Orthogonal States
- Quantum cryptography using any two nonorthogonal states
- Quantum cryptography
- Quantum cryptography
- Quantum cryptography
- Quantum-chaotic cryptography
- Cryptographic distinguishability measures for quantum-mechanical states
- Quantum computational cryptography
Cites work
- (Pseudo) random quantum states with binary phase
- A note on computational indistinguishability
- Bit commitment using pseudorandomness
- Classical binding for quantum commitments
- Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract)
- Computationally binding quantum commitments
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- Oblivious transfer is in MiniQCrypt
- One-way functions imply secure computation in a quantum world
- Pseudorandom quantum states
- Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
- Quantum computing, postselection, and probabilistic polynomial-time
- Quantum cryptography: public key distribution and coin tossing
- Scalable pseudorandom quantum states
Cited in
(56)- Extended space for quantum cryptography using mixed states
- Efficient simulation of random states and random unitaries
- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
- Scalable pseudorandom quantum states
- (Pseudo) random quantum states with binary phase
- A method of enciphering quantum states
- Computational indistinguishability between quantum states and its cryptographic application
- Orthogonal-state-based cryptography in quantum mechanics and local post-quantum theories
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Quantum commitments and signatures without one-way functions
- 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)
- Commitments to quantum states
- Quantum cryptography in Algorithmica
- Pseudorandomness with proof of destruction and applications
- Public-key encryption with quantum keys
- Quantum CCA-secure PKE, revisited
- Quantum advantage from one-way functions
- Unconditionally secure quantum commitments with preprocessing
- Unconditionally secure commitments with quantum auxiliary inputs
- Quantum public-key encryption with tamper-resilient public keys from one-way functions
- How (not) to build quantum PKE in Minicrypt
- On central primitives for quantum cryptography with classical communication
- Exponential quantum one-wayness and EFI pairs
- Quantum cryptography and meta-complexity
- Pseudorandom unitaries in the Haar random oracle model
- Pseudorandomness in the (inverseless) Haar random oracle model
- The power of a single Haar random state: constructing and separating quantum pseudorandomness
- A meta-complexity characterization of quantum cryptography
- Hard quantum extrapolations in quantum cryptography
- A new world in the depths of Microcrypt: separating OWSGs and quantum money from QEFID
- Oracle separation between quantum commitments and quantum one-wayness
- Pseudorandom strings from pseudorandom quantum states
- Quantum CCA-secure PKE, revisited
- On black-box separations of quantum digital signatures from pseudorandom states
- Robust combiners and universal constructions for quantum cryptography
- Cryptography in the common Haar state model: feasibility results and separations
- Quantum pseudorandom scramblers
- Quantum unpredictability
- Signatures from pseudorandom states via -PRFs
- MicroCrypt assumptions with quantum input sampling and pseudodeterminism: constructions and separations
- Untelegraphable encryption and its applications
- On the limitations of pseudorandom unitaries. Or: cryptographic applications of LOCC indistinguishability of identical versus independent Haar unitaries
- Pseudorandom function-like states from common Haar unitary
- Revocable encryption, programs, and more: the case of multi-copy security
- The black-box simulation barrier persists in a fully quantum world
- Efficient quantum pseudorandomness from Hamiltonian phase states
- On the efficiency of generic, quantum cryptographic constructions
- Towards the impossibility of quantum public key encryption with classical keys from one-way functions
- Quantum pseudorandom scramblers
- A note on the minimality of one-way functions in post-quantum cryptography
- Pseudorandom quantum states
This page was built for publication: Cryptography from pseudorandom quantum states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097262)
