Pseudorandom strings from pseudorandom quantum states
From MaRDI portal
Cites work
- A dozen de Finetti-style results in search of a theory
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
- A note on a method for generating points uniformly on n -dimensional spheres
- A note on computational indistinguishability
- Bit commitment using pseudorandomness
- Commitments to quantum states
- Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract)
- Computationally private randomizing polynomials and their applications
- Cryptography from pseudorandom quantum states
- Hardness vs randomness
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- Natural proofs
- Oblivious transfer is in MiniQCrypt
- On Convergence in the Mean for Densities
- On one-way functions and Kolmogorov complexity
- One-way functions imply secure computation in a quantum world
- Pseudorandom (function-Like) quantum state generators: new definitions and applications
- Pseudorandom quantum states
- Pseudorandomness with proof of destruction and applications
- Quantum advantage in learning from experiments
- Quantum computation and quantum information. 10th anniversary edition
- Quantum garbled circuits
- Scalable pseudorandom quantum states
- Security Amplification for Interactive Cryptographic Primitives
- The random matrix theory of the classical compact groups
Cited in
(3)
This page was built for publication: Pseudorandom strings from pseudorandom quantum states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906434)