Delegated Time-Lock Puzzle

Time-Lock Puzzles (TLPs) are cryptographic protocols that enable a client to lock a message in such a way that a server can only unlock it after a specific time period. However, existing TLPs have certain limitations: (i) they assume that both the client and server always possess sufficient computational resources and (ii) they solely focus on the lower time bound for finding a solution, disregarding the upper bound that guarantees a regular server can find a solution within a certain time frame. Additionally, existing TLPs designed to handle multiple puzzles either (a) entail high verification costs or (b) lack generality, requiring identical time intervals between consecutive solutions. To address these limitations, this paper introduces, for the first time, the concept of a"Delegated Time-Lock Puzzle"and presents a protocol called"Efficient Delegated Time-Lock Puzzle"(ED-TLP) that realises this concept. ED-TLP allows the client and server to delegate their resource-demanding tasks to third-party helpers. It facilitates real-time verification of solution correctness and efficiently handles multiple puzzles with varying time intervals. ED-TLP ensures the delivery of solutions within predefined time limits by incorporating both an upper bound and a fair payment algorithm. We have implemented ED-TLP and conducted a comprehensive analysis of its overheads, demonstrating the efficiency of the construction.

[1]  Angelique Faye Loe,et al.  SoK: Delay-Based Cryptography , 2023, 2023 IEEE 36th Computer Security Foundations Symposium (CSF).

[2]  Aniket Kate,et al.  OpenSquare: Decentralized Repeated Modular Squaring Service , 2021, IACR Cryptol. ePrint Arch..

[3]  Nico Döttling,et al.  Verifiable Timed Signatures Made Practical , 2020, CCS.

[4]  Ilan Komargodski,et al.  Continuous Verifiable Delay Functions , 2020, IACR Cryptol. ePrint Arch..

[5]  Zvika Brakerski,et al.  Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles , 2019, IACR Cryptol. ePrint Arch..

[6]  Giulio Malavolta,et al.  Homomorphic Time-Lock Puzzles and Applications , 2019, IACR Cryptol. ePrint Arch..

[7]  Benjamin Wesolowski,et al.  Efficient Verifiable Delay Functions , 2019, Journal of Cryptology.

[8]  Dan Boneh,et al.  Verifiable Delay Functions , 2018, IACR Cryptol. ePrint Arch..

[9]  Ueli Maurer,et al.  Bitcoin as a Transaction Ledger: A Composable Treatment , 2017, CRYPTO.

[10]  Aggelos Kiayias,et al.  The Bitcoin Backbone Protocol: Analysis and Applications , 2015, EUROCRYPT.

[11]  Hsing-Chung Chen,et al.  A Secure E-Voting System Based on RSA Time-Lock Puzzle Mechanism , 2012, 2012 Seventh International Conference on Broadband, Wireless Computing, Communication and Applications.

[12]  Markus Jakobsson,et al.  Timed Release of Standard Digital Signatures , 2002, Financial Cryptography.

[13]  Moni Naor,et al.  Timed Commitments , 2000, CRYPTO.

[14]  Ronald L. Rivest,et al.  Time-lock Puzzles and Timed-release Crypto , 1996 .

[15]  Torben P. Pedersen.  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

[16]  Adi Shamir,et al.  Multiple non-interactive zero knowledge proofs based on a single random string , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[17]  Philipp Jovanovic,et al.  Timed Secret Sharing , 2023, IACR Cryptol. ePrint Arch..

[18]  Sri Aravinda Krishnan Thyagarajan,et al.  Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus , 2022, IACR Cryptol. ePrint Arch..

[19]  Aggelos Kiayias,et al.  Multi-instance Publicly Verifiable Time-Lock Puzzle and Its Applications , 2021, Financial Cryptography.

[20]  Daniel Slamanig,et al.  Versatile and Sustainable Timed-Release Encryption and Sequential Time-Lock Puzzles (Extended Abstract) , 2021, ESORICS.

[21]  Rafael Dowsley,et al.  TARDIS: A Foundation of Time-Lock Puzzles in UC , 2021, EUROCRYPT.

[22]  Daniel Slamanig,et al.  Generic Constructions of Incremental and Homomorphic Timed-Release Encryption , 2020, IACR Cryptol. ePrint Arch..

[23]  Aggelos Kiayias,et al.  Iterated Search Problems and Blockchain Security under Falsifiable Assumptions , 2019, IACR Cryptol. ePrint Arch..

[24]  Dan Boneh,et al.  A Survey of Two Verifiable Delay Functions , 2018, IACR Cryptol. ePrint Arch..

[25]  Krzysztof Pietrzak,et al.  Simple Verifiable Delay Functions , 2018, IACR Cryptol. ePrint Arch..

[26]  Daniel Davis Wood.  ETHEREUM: A SECURE DECENTRALISED GENERALISED TRANSACTION LEDGER , 2014 .

[27]  A. Shamir,et al.  Time-lock puzzles and timed-release , 1996 .

[28]  S. Micali,et al.  Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..

[29]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.