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 QIDQ6604881
Mohammad Mahmoody, Kai-Min Chung, Yao-Ching Hsieh, Abtin Afshar, Yaoting Lin
Publication date: 13 September 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
- Trustworthy public randomness with sloth, unicorn, and trx
- Simple proofs of sequential work
- Verifiable delay functions
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Quantum security proofs using semi-classical oracles
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Secure Identity-Based Encryption in the Quantum Random Oracle Model
- Publicly verifiable proofs of sequential work
- Quantum Computation and Quantum Information
- Random Oracles in a Quantum World
- CREW PRAM<scp>s</scp> and Decision Trees
- Strengths and Weaknesses of Quantum Computing
- Simple verifiable delay functions
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
- Time-Lock Puzzles in the Random Oracle Model
- Revocable Quantum Timed-Release Encryption
- Efficient verifiable delay functions
- On the complexity of two-party differential privacy
- On the impossibility of key agreements from quantum random oracles
- On the feasibility of unclonable encryption, and more
- Time-release cryptography from minimal circuit assumptions
This page was built for publication: On the (im)possibility of time-lock puzzles in the quantum random oracle model
