CISPA
Browse
2022-1421.pdf (594.65 kB)

Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus

Download (594.65 kB)
conference contribution
posted on 2024-03-26, 08:57 authored by Shravan Srinivasan, Julian Loss, Giulio Malavolta, Kartik Nayak, Charalampos Papamanthou, Sri AravindaKrishnan Thyagarajan

Time-lock puzzles (TLP) are a fascinating type of cryptographic problem that is easy to generate, but takes a certain time to solve, even when arbitrary parallel speedup is allowed. TLPs have wide-ranging applications including fairness, round efficient computation, and more. To reduce the effort needed to solve large numbers of TLPs, prior work has proposed batching techniques to reduce the cost of solving. However, these proposals either require: (1) a trusted setup or (2) the puzzle size linear in the maximum batch size, which implies setting an a priori bound on the maximum size of the batch. Any of these limitations restrict the utility of TLPs in decentralized and dynamic settings like permissionless blockchains.


In this work, we demonstrate the feasibility and usefulness of a TLP that overcomes all of the above limitations. Our construction is based on indistinguishable obfuscation and shows that there are no fundamental barriers in achieving such a TLP construction. As a main application of our TLP, we show how to improve the resilience of consensus protocols toward network-level adversaries in the following two settings: (1) We show a generic compiler that boosts the resilience of a Byzantine broadcast protocol II as follows: if II is secure against t < n weakly adaptive corruptions, then the compiled protocol is secure against t < n  strongly adaptive corruptions. Here, `strong' refers to adaptively corrupting a party and deleting messages that it sent while still honest. Our compiler is round and communication preserving, and gives the first expected constant-round Byzantine broadcast protocol against a strongly adaptive adversary for the dishonest majority setting. (2) We adapt the Nakamoto consensus protocol to a weak model of synchrony where the adversary can adaptively create minority partitions in the network. Unlike prior works, we do not assume that all honest messages are delivered within a known upper bound on the message delay. To the best of our knowledge, this is the first work to show that it is possible to achieve consensus in the permissionless setting even after relaxing the standard synchrony assumption.

History

Primary Research Area

  • Algorithmic Foundations and Cryptography

Name of Conference

International Conference on Practice and Theory in Public Key Cryptography (PKC)

Journal

Public Key Cryptography (1)

Volume

13940

Page Range

554-584

Publisher

Springer Nature

Open Access Type

  • Not Open Access

BibTeX

@inproceedings{Srinivasan:Loss:Malavolta:Nayak:Papamanthou:Thyagarajan:2023, title = "Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus", author = "Srinivasan, Shravan" AND "Loss, Julian" AND "Malavolta, Giulio" AND "Nayak, Kartik" AND "Papamanthou, Charalampos" AND "Thyagarajan, Sri AravindaKrishnan", year = 2023, month = 5, journal = "Public Key Cryptography (1)", pages = "554--584", publisher = "Springer Nature", issn = "1611-3349", doi = "10.1007/978-3-031-31368-4_20" }