Open AccessProceedings Article
Timed Commitments
Dan Boneh,Moni Naor +1 more
- 20 Aug 2000
pp 236-254
308
TL;DR: This work introduces and constructs timed commitment schemes, an extension to the standard notion of commitments in which a potential forced opening phase permits the receiver to recover (with effort) the committed value without the help of the committer.
read more
Abstract: We introduce and construct timed commitment schemes, an extension to the standard notion of commitments in which a potential forced opening phase permits the receiver to recover (with effort) the committed value without the help of the committer. An important application of our timed-commitment scheme is contract signing: two mutually suspicious parties wish to exchange signatures on a contract. We show a two-party protocol that allows them to exchange RSA or Rabin signatures. The protocol is strongly fair: if one party quits the protocol early, then the two parties must invest comparable amounts of time to retrieve the signatures. This statement holds even if one party has many more machines than the other. Other applications, including honesty preserving auctions and collective coin-flipping, are discussed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Survey of Attacks on Ethereum Smart Contracts SoK
Nicola Atzei,Massimo Bartoletti,Tiziana Cimoli +2 more
- 22 Apr 2017
TL;DR: This work analyses the security vulnerabilities of Ethereum smart contracts, providing a taxonomy of common programming pitfalls which may lead to vulnerabilities, and shows a series of attacks which exploit these vulnerabilities, allowing an adversary to steal money or cause other damage.
1.5K
•Posted Content
A survey of attacks on Ethereum smart contracts.
TL;DR: In this article, a taxonomy of common programming pitfalls which may lead to security vulnerabilities in Ethereum smart contracts is presented, and a series of attacks which exploit these vulnerabilities, allowing an adversary to steal money or cause other damage.
Verifiable Delay Functions
Dan Boneh,Joseph Bonneau,Benedikt Bünz,Ben Fisch +3 more
- 19 Aug 2018
TL;DR: The requirements for a verifiable delay function (VDF) are formalized and new candidate constructions are presented that are the first to achieve an exponential gap between evaluation and verification time.
Secure Multiparty Computations on Bitcoin
Marcin Andrychowicz,Stefan Dziembowski,Daniel Malinowski,Lukasz Mazurek +3 more
- 18 May 2014
TL;DR: The Bit coin system can be used to go beyond the standard "emulation-based" definition of the MPCs, by constructing protocols that link their inputs and the outputs with the real Bit coin transactions.
Smart contract applications within blockchain technology: A systematic mapping study
TL;DR: There has been an increasing trend towards the publication of blockchain-based smart contract articles at conferences and journals, mainly reflecting experiments and presenting methods, tools and models since 2016, according to the results.
431
References
•Book
Handbook of Applied Cryptography
Alfred Menezes,Scott A. Vanstone,Paul C. van Oorschot +2 more
- 01 Jan 1996
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
15K
How to prove yourself: practical solutions to identification and signature problems
Amos Fiat,Adi Shamir +1 more
- 01 Jan 1987
TL;DR: Simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys are described.
Pricing via Processing or Combatting Junk Mail
Cynthia Dwork,Moni Naor +1 more
- 16 Aug 1992
TL;DR: A computational technique for combatting junk mail in particular and controlling access to a shared resource in general is presented, which requires a user to compute a moderately hard, but not intractable, function in order to gain access to the resource, thus preventing frivolous use.
1.6K
Wallet Databases with Observers
David Chaum,Torben P. Pedersen +1 more
- 16 Aug 1992
TL;DR: This article argues that a particular combination of these two kinds of mechanism can overcome the limitations of each alone, providing both security and correctness for organizations as well as privacy and even anonymity for individuals.
A randomized protocol for signing contracts
TL;DR: The 1-out-of-2 oblivious transfer as discussed by the authors allows one party to transfer exactly one secret, out of two recognizable secrets, to his counterpart, while the sender is ignorant of which secret has been received.
Related Papers (5)
Cynthia Dwork,Moni Naor +1 more
- 16 Aug 1992
Mihir Bellare,Phillip Rogaway +1 more
- 01 Dec 1993