On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model

ePrint Report: On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model

Abtin Afshar, Kai-Min Chung, Yao-Ching Hsieh, Yao-Ting Lin, Mohammad Mahmoody

Time-lock puzzles wrap a solution $\mathrm{s}$ inside a puzzle $\mathrm{P}$ in such a way that ``solving'' $\mathrm{P}$ to find $\mathrm{s}$ requires significantly more time than generating the pair $(\mathrm{s},\mathrm{P})$, even if the adversary has access to parallel computing; hence it can be thought of as sending a message $\mathrm{s}$ to the future. It is known [Mahmoody, …

eprint report find lock oracle puzzle quantum random report solution