Timed Commitments

By Dan Boneh, Moni Naor. Annual International Cryptology Conference, 2000

315 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

How to Use Bitcoin to Design Fair Protocols (2014, background): “Unfortunately, as is the case with fair secure computation, it is known that fair exchange in the standard model cannot be achieved [22, 35].”
Rational secret sharing and multiparty computation: extended abstract (2004, background): “Again all the protocols we could find have a commonly-known upper bound on the running time [2, 3, 7, 8, 9, 14].”
A Survey of Attacks on Ethereum Smart Contracts (SoK) (2017, background): “Alternative solutions to this problem are based on timed commitment protocols [25, 29].”
Verifiable Delay Functions (2018, background): “Another construction for a slow function dating to Dwork and Naor [31] is extracting modular square roots.”
Secure Multiparty Computations on Bitcoin (2014, methodology): “First of all, we show that the Bitcoin system provides an attractive way to construct a version of “timed commitments” [11], [27], where the committer has to reveal his secret within a certain time frame, or to pay a fine.”