Malavolta G, Thyagarajan SAK (2019)
Publication Type: Conference contribution
Publication year: 2019
Publisher: Springer Verlag
Book Volume: 11692 LNCS
Pages Range: 620-649
Conference Proceedings Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Event location: Santa Barbara, CA
ISBN: 9783030269470
DOI: 10.1007/978-3-030-26948-7_22
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.
APA:
Malavolta, G., & Thyagarajan, S.A.K. (2019). Homomorphic Time-Lock Puzzles and Applications. In Daniele Micciancio, Alexandra Boldyreva (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 620-649). Santa Barbara, CA, US: Springer Verlag.
MLA:
Malavolta, Giulio, and Sri Aravinda Krishnan Thyagarajan. "Homomorphic Time-Lock Puzzles and Applications." Proceedings of the 39th Annual International Cryptology Conference, CRYPTO 2019, Santa Barbara, CA Ed. Daniele Micciancio, Alexandra Boldyreva, Springer Verlag, 2019. 620-649.
BibTeX: Download