Cryptology ePrint Archive: Report 2015/482

How to build time-lock encryption

Jia Liu and Tibor Jager and Saqib A. Kakvi and Bogdan Warinschi

Abstract: Time-lock encryption is a method to encrypt a message such that it can only be decrypted after a certain deadline has passed. We propose a novel time-lock encryption scheme, whose main advantage over prior constructions is that even receivers with relatively weak computational resources should immediately be able to decrypt after the deadline, without any interaction with the sender, other receivers, or a trusted third party. We build our time-lock encryption on top of the new concept of computational reference clocks and an extractable witness encryption scheme. We explain how to construct a computational reference clock based on Bitcoin. We show how to achieve constant level of multilinearity for witness encryption by using SNARKs. We propose a new construction of a witness encryption scheme which is of independent interest: our scheme, based on Subset-Sum, achieves extractable security without relying on obfuscation. The scheme employs multilinear maps of arbitrary order and is independent of the implementations of multilinear maps.

Category / Keywords: Time-lock encryption, Timed-release encryption, Bitcoin, Witness encryption, SNARKs, Time-lock puzzles, Timed commitments

Original Publication (in the same form): Designs, Codes and Cryptography
DOI:
10.1007/s10623-018-0461-x

Date: received 20 May 2015, last revised 14 Jun 2018

Contact author: jia kitoun liu at gmail com

Available format(s): PDF | BibTeX Citation

Note: This is a merged version of 2015/478 and 2015/482

Version: 20180614:094938 (All versions of this report)

Short URL: ia.cr/2015/482


[ Cryptology ePrint archive ]