发表机构
UCSB; Columbia University（加州大学圣塔芭芭拉分校; 哥伦比亚大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本研究在量子随机预言机模型中构造量子时间锁谜题，实现单轮生成、至多T轮求解，并抵御深度o(T)的量子对手，解决了2011年提出的开放问题。
AI 中文摘要
时间锁谜题允许发送方将消息隐藏在谜题中，使得恢复消息所需的顺序计算量显著超过生成谜题所需的时间，即使允许并行计算也是如此。时间锁谜题的应用包括定时发布加密、密封投标拍卖、电子投票、公平合同签署、抛硬币以及拜占庭共识。然而，已知在经典随机预言机模型中时间锁谜题是不可能的。为了克服经典障碍，在本工作中我们考虑量子时间锁谜题，其中谜题本身是一个量子态。我们在量子随机预言机模型中的构造实现了在一个预言机轮次内生成，在至多$T$个预言机轮次内求解，并且对于每个多项式有界延迟$T=T(\lambda)$，能够抵御深度为$o(T)$的多项式宽度量子对手的攻击，解决了Mahmoody、Moran和Vadhan（2011）提出的一个开放问题。
英文摘要
A time-lock puzzle allows a sender to hide a message in a puzzle such that recovering the message requires substantially more sequential computation than the time required to generate the puzzle, even when parallel computation is allowed. Applications of time-lock puzzles include timed-release encryption, sealed-bid auctions, electronic voting, fair contract signing, coin flipping, and Byzantine consensus. However, time-lock puzzles are known to be impossible in the classical random oracle model. To overcome the classical barrier, in this work we consider quantum time-lock puzzles, in which the puzzle itself is a quantum state. Our construction in the quantum random oracle model achieves generation in one oracle round, solving in at most $T$ oracle rounds, and security against polynomial-width quantum adversaries of depth $o(T)$ for every polynomially bounded delay $T=T(λ)$, resolving an open problem posed by Mahmoody, Moran, and Vadhan (2011).
Comments23 pages
