On the (im)possibility of time-lock puzzles in the quantum random oracle model
From MaRDI portal
Publication:6604881
DOI10.1007/978-981-99-8730-6_11MaRDI QIDQ6604881FDOQ6604881
Authors: A. Afshar, Kai-Min Chung, Yao-Ching Hsieh, Yaoting Lin, Mohammad Mahmoody 
Publication date: 13 September 2024
Cites Work
- Secure identity-based encryption in the quantum random oracle model
- Quantum computation and quantum information. 10th anniversary edition
- Strengths and Weaknesses of Quantum Computing
- CREW PRAM<scp>s</scp> and Decision Trees
- The need for structure in quantum speedups
- The complexity of approximating a nonlinear program
- Random oracles in a quantum world
- Trustworthy public randomness with sloth, unicorn, and trx
- Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
- Time-lock puzzles in the random oracle model
- Revocable quantum timed-release encryption
- Verifiable delay functions
- Simple verifiable delay functions
- Efficient verifiable delay functions
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Simple proofs of sequential work
- Publicly verifiable proofs of sequential work
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Quantum security proofs using semi-classical oracles
- On the security of proofs of sequential work in a post-quantum world
- On the complexity of two-party differential privacy
- Time-release cryptography from minimal circuit assumptions
- On the impossibility of key agreements from quantum random oracles
- On the feasibility of unclonable encryption, and more
This page was built for publication: On the (im)possibility of time-lock puzzles in the quantum random oracle model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604881)
