Quantum cryptography in Algorithmica
From MaRDI portal
Cites work
- (Pseudo) random quantum states with binary phase
- A note on computational indistinguishability
- Advances in Cryptology - CRYPTO 2003
- BQP and the polynomial hierarchy
- Cryptography from pseudorandom quantum states
- Forrelation: a problem that optimally separates quantum from classical computing
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- k-forrelation optimally separates Quantum and classical query complexity
- New directions in cryptography
- Oblivious transfer is in MiniQCrypt
- On perfect completeness for QMA
- One-way functions imply secure computation in a quantum world
- Oracle separation of BQP and PH
- Parity, circuits, and the polynomial-time hierarchy
- Pseudorandom generators from polarizing random walks
- Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates
- Pseudorandom quantum states
- Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
- Quantum commitments and signatures without one-way functions
- Quantum cryptography: public key distribution and coin tossing
- Quantum versus classical proofs and advice
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Tight bounds on the Fourier spectrum of \(\mathsf{AC}^0\)
- Unitary 2-designs from random X- and Z-diagonal unitaries
Cited in
(26)- Weakening assumptions for publicly-verifiable deletion
- Unconditionally secure quantum commitments with preprocessing
- Quantum public-key encryption with tamper-resilient public keys from one-way functions
- Exponential quantum one-wayness and EFI pairs
- One-wayness in quantum cryptography
- Quantum cryptography and meta-complexity
- Pseudorandom unitaries in the Haar random oracle model
- Translating between the common Haar random state model and the unitary 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
- Quantum public-key encryption of quantum states, and more
- Robust combiners and universal constructions for quantum cryptography
- Quantum pseudorandom scramblers
- Quantum unpredictability
- Pseudorandom function-like states from common Haar unitary
- Publicly verifiable deletion: general compilers from minimal assumptions
- 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
This page was built for publication: Quantum cryptography in Algorithmica
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499325)
