% Encoding: UTF-8
@COMMENT{BibTeX export based on data in FAU CRIS: https://cris.fau.de/}
@COMMENT{For any questions please write to cris-support@fau.de}
@inproceedings{faucris.226676579,
abstract = {Time-lock puzzles allow one to encrypt messages for the future, by efficiently generating a puzzle with a solution s that remains hidden until time$$\mathcal {T}$$ has elapsed. The solution is required to be concealed from the eyes of any algorithm running in (parallel) time less than$$\mathcal {T}$$. 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$$(s:1, \dots, s{\_}n)$$ to obtain a puzzle that solves to$$f(s:1, \ldots, s{\_}n)$$, for any function f. 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.},
author = {Malavolta, Giulio and Thyagarajan, Sri Aravinda Krishnan},
booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
date = {2019-08-18/2019-08-22},
doi = {10.1007/978-3-030-26948-7{\_}22},
editor = {Daniele Micciancio, Alexandra Boldyreva},
faupublication = {yes},
isbn = {9783030269470},
note = {CRIS-Team Scopus Importer:2019-09-17},
pages = {620-649},
peerreviewed = {unknown},
publisher = {Springer Verlag},
title = {{Homomorphic} {Time}-{Lock} {Puzzles} and {Applications}},
venue = {Santa Barbara, CA},
volume = {11692 LNCS},
year = {2019}
}