Quantum depth in the random oracle model
From MaRDI portal
Publication:6499289
DOI10.1145/3564246.3585153WikidataQ130908674 ScholiaQ130908674MaRDI QIDQ6499289
Alexandru Gheorghiu, Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Uttam Singh, Hendrik Waldner
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Circuit depth relative to a random oracle
- Random oracles and non-uniformity
- Verifiable delay functions
- From obfuscation to the security of Fiat-Shamir for proofs
- Classical vs quantum random oracles
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- How to record quantum queries, and applications to quantum indifferentiability
- Quantum security proofs using semi-classical oracles
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- Time-Lock Puzzles from Randomized Encodings
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
- BQP and the polynomial hierarchy
- Forrelation
- The random oracle methodology, revisited
- Parity, circuits, and the polynomial-time hierarchy
- Quantum lower bounds for the collision and the element distinctness problems
- Exponential algorithmic speedup by a quantum walk
- On the Power of Quantum Computation
- Computations with greater Quantum depth are strictly more powerful (relative to an oracle)
- On the need for large Quantum depth
- On the (im)possibility of obfuscating programs
- Cryptography in $NC^0$
- Natural proofs
This page was built for publication: Quantum depth in the random oracle model
