Timed Release of Standard Digital Signatures

Garay, Juan A.; Jakobsson, Markus

doi:10.1007/3-540-36504-4_13

Cited by 59 publications

(63 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Starting from early works [13,50], gradual release mechanism have been employed to solve the problem of fair exchange in several situations [22,42,46]. A good survey of this area can be found in [90].…”

Section: Related Workmentioning

confidence: 99%

How to Use Bitcoin to Design Fair Protocols

Bentov

Kumaresan

2014

Lecture Notes in Computer Science

275

252

View full text Add to dashboard Cite

We study a model of fairness in secure computation in which an adversarial party that aborts on receiving output is forced to pay a mutually predefined monetary penalty. We then show how the Bitcoin network can be used to achieve the above notion of fairness in the two-party as well as the multiparty setting (with a dishonest majority). In particular, we propose new ideal functionalities and protocols for fair secure computation and fair lottery in this model.One of our main contributions is the definition of an ideal primitive, which we call F CR (CR stands for "claim-or-refund"), that formalizes and abstracts the exact properties we require from the Bitcoin network to achieve our goals. Naturally, this abstraction allows us to design fair protocols in a hybrid model in which parties have access to the F CR functionality, and is otherwise independent of the Bitcoin ecosystem. We also show an efficient realization of F CR that requires only two Bitcoin transactions to be made on the network.Our constructions also enjoy high efficiency. In a multiparty setting, our protocols only require a constant number of calls to F CR per party on top of a standard multiparty secure computation protocol. Our fair multiparty lottery protocol improves over previous solutions which required a quadratic number of Bitcoin transactions.

show abstract

Section: Related Workmentioning

confidence: 99%

How to Use Bitcoin to Design Fair Protocols

Bentov

Kumaresan

2014

Lecture Notes in Computer Science

275

252

View full text Add to dashboard Cite

show abstract

“…[8,19,25], but this line of research uses a completely different approach from ours. It is based on a gradual release of information and if the protocol is interrupted prematurely than both parties can reconstruct the result with a huge computational effort.…”

Section: Introductionmentioning

confidence: 99%

Fair Two-Party Computations via Bitcoin Deposits

Andrychowicz

Dziembowski

Malinowski

et al. 2014

Lecture Notes in Computer Science

122

101

View full text Add to dashboard Cite

Abstract. We show how the Bitcoin currency system (with a small modification) can be used to obtain fairness in any two-party secure computation protocol in the following sense: if one party aborts the protocol after learning the output then the other party gets a financial compensation (in bitcoins). One possible application of such protocols is the fair contract signing: each party is forced to complete the protocol, or to pay to the other one a fine. We also show how to link the output of this protocol to the Bitcoin currency. More precisely: we show a method to design secure two-party protocols for functionalities that result in a "forced" financial transfer from one party to the other. Our protocols build upon the ideas of our recent paper "Secure Multiparty Computations on Bitcoin" (Cryptology ePrint Archive, Report 2013/784). Compared to that paper, our results are more general, since our protocols allow to compute any function, while in the previous paper we concentrated only on some specific tasks (commitment schemes and lotteries). On the other hand, as opposed to "Secure Multiparty Computations on Bitcoin", to obtain security we need to modify the Bitcoin specification so that the transactions are "non-malleable" (we discuss this concept in more detail in the paper).

show abstract

“…[28], various research on timed-release cryptography including timed-release signatures (e.g., Refs. [16], [17]) and timed-release encryption have been done based on computational security. In particular, TRE in the public-key setting has been recently researched on intensively (e.g., Refs.…”

Section: Introductionmentioning

confidence: 99%

Information-theoretically Secure Timed-release Secret Sharing Schemes

Watanabe

Shikata

2016

Journal of Information Processing

View full text Add to dashboard Cite

Abstract:In modern cryptography, the secret sharing scheme is an important cryptographic primitive, and it is used in various situations. In this paper, timed-release secret sharing (TR-SS) schemes with information-theoretic security is first studied. TR-SS is a secret sharing scheme with the property that more than a threshold number of participants can reconstruct a secret by using their shares only when the time specified by a dealer has come. Specifically, in this paper we first introduce models and formalization of security for two kinds of TR-SS based on the traditional secret sharing scheme and information-theoretic timed-release security. We also derive tight lower bounds on the sizes of shares, time-signals, and entities' secret-keys required for each TR-SS scheme. In addition, we propose direct constructions for the TR-SS schemes. Each direct construction is optimal in the sense that the construction meets equality in each of our bounds, respectively. As a result, it is shown that timed-release security can be realized without any additional redundancy on the share size.

show abstract

Timed Release of Standard Digital Signatures

Cited by 59 publications

References 16 publications

How to Use Bitcoin to Design Fair Protocols

How to Use Bitcoin to Design Fair Protocols

Fair Two-Party Computations via Bitcoin Deposits

Information-theoretically Secure Timed-release Secret Sharing Schemes

Contact Info

Product

Resources

About