Non-malleable Time-Lock Puzzles and Applications

Cody Freitag; Ilan Komargodski; Rafael Pass; Naomi Sirkin

doi:10.1007/978-3-030-90456-2_15

Non-malleable Time-Lock Puzzles and Applications

Cody Freitag, Ilan Komargodski, Rafael Pass, Naomi Sirkin

The Rachel and Selim Benin School of Engineering and Computer Science

The Hebrew University of Jerusalem

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Time-lock puzzles are a mechanism for sending messages “to the future”, by allowing a sender to quickly generate a puzzle with an underlying message that remains hidden until a receiver spends a moderately large amount of time solving it. We introduce and construct a variant of a time-lock puzzle which is non-malleable, which roughly guarantees that it is impossible to “maul” a puzzle into one for a related message without solving it. Using non-malleable time-lock puzzles, we achieve the following applications: The first fair non-interactive multi-party protocols for coin flipping and auctions in the plain model without setup.Practically efficient fair multi-party protocols for coin flipping and auctions proven secure in the (auxiliary-input) random oracle model. As a key step towards proving the security of our protocols, we introduce the notion of functional non-malleability, which protects against tampering attacks that affect a specific function of the related messages. To support an unbounded number of participants in our protocols, our time-lock puzzles satisfy functional non-malleability in the fully concurrent setting. We additionally show that standard (non-functional) non-malleability is impossible to achieve in the concurrent setting (even in the random oracle model).

Original language	English
Title of host publication	Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings
Editors	Kobbi Nissim, Brent Waters
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	447-479
Number of pages	33
ISBN (Print)	9783030904555
DOIs	https://doi.org/10.1007/978-3-030-90456-2_15
State	Published - 2021
Event	19th International Conference on Theory of Cryptography, TCC 2021 - Raleigh, United States Duration: 8 Nov 2021 → 11 Nov 2021

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13044 LNCS

Conference

Conference	19th International Conference on Theory of Cryptography, TCC 2021
Country/Territory	United States
City	Raleigh
Period	8/11/21 → 11/11/21

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-90456-2_15

Cite this

Freitag, C., Komargodski, I., Pass, R., & Sirkin, N. (2021). Non-malleable Time-Lock Puzzles and Applications. In K. Nissim, & B. Waters (Eds.), Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings (pp. 447-479). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13044 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-90456-2_15

Freitag, Cody ; Komargodski, Ilan ; Pass, Rafael et al. / Non-malleable Time-Lock Puzzles and Applications. Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings. editor / Kobbi Nissim ; Brent Waters. Springer Science and Business Media Deutschland GmbH, 2021. pp. 447-479 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5493fc59805848b5ad760cf7f3b2b914,

title = "Non-malleable Time-Lock Puzzles and Applications",

abstract = "Time-lock puzzles are a mechanism for sending messages “to the future”, by allowing a sender to quickly generate a puzzle with an underlying message that remains hidden until a receiver spends a moderately large amount of time solving it. We introduce and construct a variant of a time-lock puzzle which is non-malleable, which roughly guarantees that it is impossible to “maul” a puzzle into one for a related message without solving it. Using non-malleable time-lock puzzles, we achieve the following applications: The first fair non-interactive multi-party protocols for coin flipping and auctions in the plain model without setup.Practically efficient fair multi-party protocols for coin flipping and auctions proven secure in the (auxiliary-input) random oracle model. As a key step towards proving the security of our protocols, we introduce the notion of functional non-malleability, which protects against tampering attacks that affect a specific function of the related messages. To support an unbounded number of participants in our protocols, our time-lock puzzles satisfy functional non-malleability in the fully concurrent setting. We additionally show that standard (non-functional) non-malleability is impossible to achieve in the concurrent setting (even in the random oracle model).",

author = "Cody Freitag and Ilan Komargodski and Rafael Pass and Naomi Sirkin",

note = "Publisher Copyright: {\textcopyright} 2021, International Association for Cryptologic Research.; 19th International Conference on Theory of Cryptography, TCC 2021 ; Conference date: 08-11-2021 Through 11-11-2021",

year = "2021",

doi = "10.1007/978-3-030-90456-2\_15",

language = "الإنجليزيّة",

isbn = "9783030904555",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "447--479",

editor = "Kobbi Nissim and Brent Waters",

booktitle = "Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings",

address = "ألمانيا",

}

Freitag, C, Komargodski, I , Pass, R & Sirkin, N 2021, Non-malleable Time-Lock Puzzles and Applications. in K Nissim & B Waters (eds), Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13044 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 447-479, 19th International Conference on Theory of Cryptography, TCC 2021, Raleigh, United States, 8/11/21. https://doi.org/10.1007/978-3-030-90456-2_15

Non-malleable Time-Lock Puzzles and Applications. / Freitag, Cody; Komargodski, Ilan ; Pass, Rafael et al.
Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings. ed. / Kobbi Nissim; Brent Waters. Springer Science and Business Media Deutschland GmbH, 2021. p. 447-479 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13044 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Non-malleable Time-Lock Puzzles and Applications

AU - Freitag, Cody

AU - Komargodski, Ilan

AU - Pass, Rafael

AU - Sirkin, Naomi

PY - 2021

Y1 - 2021

N2 - Time-lock puzzles are a mechanism for sending messages “to the future”, by allowing a sender to quickly generate a puzzle with an underlying message that remains hidden until a receiver spends a moderately large amount of time solving it. We introduce and construct a variant of a time-lock puzzle which is non-malleable, which roughly guarantees that it is impossible to “maul” a puzzle into one for a related message without solving it. Using non-malleable time-lock puzzles, we achieve the following applications: The first fair non-interactive multi-party protocols for coin flipping and auctions in the plain model without setup.Practically efficient fair multi-party protocols for coin flipping and auctions proven secure in the (auxiliary-input) random oracle model. As a key step towards proving the security of our protocols, we introduce the notion of functional non-malleability, which protects against tampering attacks that affect a specific function of the related messages. To support an unbounded number of participants in our protocols, our time-lock puzzles satisfy functional non-malleability in the fully concurrent setting. We additionally show that standard (non-functional) non-malleability is impossible to achieve in the concurrent setting (even in the random oracle model).

AB - Time-lock puzzles are a mechanism for sending messages “to the future”, by allowing a sender to quickly generate a puzzle with an underlying message that remains hidden until a receiver spends a moderately large amount of time solving it. We introduce and construct a variant of a time-lock puzzle which is non-malleable, which roughly guarantees that it is impossible to “maul” a puzzle into one for a related message without solving it. Using non-malleable time-lock puzzles, we achieve the following applications: The first fair non-interactive multi-party protocols for coin flipping and auctions in the plain model without setup.Practically efficient fair multi-party protocols for coin flipping and auctions proven secure in the (auxiliary-input) random oracle model. As a key step towards proving the security of our protocols, we introduce the notion of functional non-malleability, which protects against tampering attacks that affect a specific function of the related messages. To support an unbounded number of participants in our protocols, our time-lock puzzles satisfy functional non-malleability in the fully concurrent setting. We additionally show that standard (non-functional) non-malleability is impossible to achieve in the concurrent setting (even in the random oracle model).

UR - http://www.scopus.com/inward/record.url?scp=85120033911&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-90456-2_15

DO - 10.1007/978-3-030-90456-2_15

M3 - منشور من مؤتمر

SN - 9783030904555

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 447

EP - 479

BT - Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings

A2 - Nissim, Kobbi

A2 - Waters, Brent

PB - Springer Science and Business Media Deutschland GmbH

T2 - 19th International Conference on Theory of Cryptography, TCC 2021

Y2 - 8 November 2021 through 11 November 2021

ER -

Freitag C, Komargodski I , Pass R, Sirkin N. Non-malleable Time-Lock Puzzles and Applications. In Nissim K, Waters B, editors, Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings. Springer Science and Business Media Deutschland GmbH. 2021. p. 447-479. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-90456-2_15

Non-malleable Time-Lock Puzzles and Applications

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this