Quantum cryptography in Algorithmica
From MaRDI portal
Publication:6499325
DOI10.1145/3564246.3585225WikidataQ130908110 ScholiaQ130908110MaRDI QIDQ6499325
William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal
Publication date: 8 May 2024
Related Items (4)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- Pseudorandom quantum states
- A note on computational indistinguishability
- Oblivious transfer is in MiniQCrypt
- One-way functions imply secure computation in a quantum world
- (Pseudo) random quantum states with binary phase
- BQP and the polynomial hierarchy
- Parity, circuits, and the polynomial-time hierarchy
- Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)
- SECURITY OF QUANTUM KEY DISTRIBUTION
- New directions in cryptography
- 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
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing
- High-Dimensional Probability
- Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates
- Oracle separation of BQP and PH
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Unitary 2-designs from random X- and Z-diagonal unitaries
- k-forrelation optimally separates Quantum and classical query complexity
- Cryptography from pseudorandom quantum states
- Quantum commitments and signatures without one-way functions
This page was built for publication: Quantum cryptography in Algorithmica
