On the (im)possibility of time-lock puzzles in the quantum random oracle model
From MaRDI portal
Publication:6604881
Cites work
- CREW PRAM<scp>s</scp> and Decision Trees
- Efficient verifiable delay functions
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- On the complexity of two-party differential privacy
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- On the feasibility of unclonable encryption, and more
- On the impossibility of key agreements from quantum random oracles
- On the security of proofs of sequential work in a post-quantum world
- Publicly verifiable proofs of sequential work
- Quantum computation and quantum information. 10th anniversary edition
- Quantum security proofs using semi-classical oracles
- Query complexity, or why is it difficult to separate NP^ A coNP^ A from P^ A by random oracles A?
- Random oracles in a quantum world
- Revocable quantum timed-release encryption
- Secure identity-based encryption in the quantum random oracle model
- Simple proofs of sequential work
- Simple verifiable delay functions
- Strengths and Weaknesses of Quantum Computing
- The complexity of approximating a nonlinear program
- The need for structure in quantum speedups
- Time-lock puzzles in the random oracle model
- Time-release cryptography from minimal circuit assumptions
- Trustworthy public randomness with sloth, unicorn, and trx
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Verifiable delay functions
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)
