A Time-lock puzzle (TLP) sends information into the future: a predetermined number of sequential computations must occur (i.e., a predetermined amount of time must pass) to retrieve the information, regardless of parallelization. Buoyed by the excitement around secure decentralized applications and cryptocurrencies, the last decade has witnessed numerous constructions of TLP variants and related applications (e.g., cost-efficient blockchain designs, randomness beacons, e-voting, etc.). In this poster, we first extend the notion of TLP by formally defining the "time-lock public key encryption" (TLPKE) scheme. Next, we introduce and construct a "tight short-lived signatures" scheme using our TLPKE. Furthermore, to test the validity of our proposed schemes, we do a proof-of-concept implementation and run detailed simulations.

翻译：时间谜题（TLP）将信息发送至未来：无论并行计算能力如何，必须完成预定数量的顺序计算（即经过预定时间）才能获取信息。受安全去中心化应用与加密货币发展热潮的推动，过去十年间涌现出大量TLP变体构造及其相关应用（例如：高效区块链设计、随机信标、电子投票等）。本报告首先通过正式定义"时间锁公钥加密"（TLPKE）方案扩展了TLP的概念，继而基于该TLPKE提出并构造了"紧致短时签名"方案。为验证所提方案的有效性，我们进行了概念验证实现并开展了详尽的仿真实验。