Tight Short-Lived Signatures

Abstract:

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 variants TLPs and related applications (e.g., cost-efficient blockchain designs, randomness beacons, e-voting, etc.).

In this poster, first we extend the notion of TLP by formally defining "time-lock public key encryption" (TLPKE) scheme, then we introduce and construct a tight short-lived signatures'' scheme from our TLPKE. Furthermore, to test the validity of our proposed schemes, we do a proof-of-concept implementation and run detailed simulations.