[MT19] Homomorphic Time-Lock Puzzles and Applications
Authors: Giulio Malavolta, Sri Aravinda Krishnan Thyagarajan | Venue: CRYPTO 2019 | Source
Abstract
Time-lock puzzles allow one to encrypt messages for the future, by efficiently generating a puzzle with a solution that remains hidden until time has elapsed. The solution is required to be concealed from the eyes of any algorithm running in (parallel) time less than .
We put forth the concept of homomorphic time-lock puzzles, where one can evaluate functions over puzzles without solving them, i.e., one can manipulate a set of puzzles with solutions to obtain a puzzle that solves to , for any function . We propose candidate constructions under concrete cryptographic assumptions for different classes of functions. Then we show how homomorphic time-lock puzzles overcome the limitations of classical time-lock puzzles by proposing new protocols for applications of interest, such as e-voting, multi-party coin flipping, and fair contract signing.
BibTeX
@Inproceedings{C:MalThy19,
author = {Giulio Malavolta and Sri Aravinda Krishnan Thyagarajan},
title = {Homomorphic Time-Lock Puzzles and Applications},
pages = {620--649},
editor = {Alexandra Boldyreva and Daniele Micciancio},
booktitle = {Advances in Cryptology -- {CRYPTO}~2019, Part~I},
volume = {11692},
series = {Lecture Notes in Computer Science},
address = {Santa Barbara, CA, USA},
month = {aug~18--22},
publisher = {Springer, Cham, Switzerland},
year = {2019},
doi = {10.1007/978-3-030-26948-7_22},
}