Optimistic protocols for fair exchange

Asokan, N.; Schunter, Matthias; Waidner, Michael

doi:10.1145/266420.266426

Cited by 392 publications

(269 citation statements)

References 23 publications

Supporting

Mentioning

267

Contrasting

Unclassified

Order By: Relevance

“…Optimistic Fair Exchange Optimistic fair exchange, introduced by Asokan, Schunter and Waidner [1] allows two parties, Alice and Bob, to exchange digital signatures with the help of a passive trusted third party. Haung et al [12] presents an elegant realization based on a secure two-party ring signatures.…”

Section: Applicationsmentioning

confidence: 99%

Two-Party (Blind) Ring Signatures and Their Applications

Susilo

2014

Information Security Practice and Experience

View full text Add to dashboard Cite

Abstract. Ring signatures, introduced by Rivest, Shamir and Tauman, attest the fact that one member from a ring of signers has endorsed the message but no one can identify who from the ring is actually responsible for its generation. It was designed canonically for secret leaking. Since then, various applications have been discovered. For instance, it is a building block of optimistic fair exchange, destinated verifier signatures and ad-hoc key exchange. Interestingly, many of these applications require the signer to create a ring signature on behalf of two possible signers (a two-party ring signature) only. An efficient two-party ring signature scheme due to Bender, Katz, and Morselli, is known. Unfortunately, it cannot be used in many of the aforementioned applications since it is secure only in a weaker model. In this paper, we revisit their construction and proposed a scheme that is secure in the strongest sense. In addition, we extend the construction to a two-party blind ring signature. Our proposals are secure in the standard model under well-known number-theoretic assumptions. Finally, we discuss the applications of our construction, which include designated verifier signatures, optimistic fair exchange and fair outsourcing of computational task.

show abstract

Section: Applicationsmentioning

confidence: 99%

Two-Party (Blind) Ring Signatures and Their Applications

Susilo

2014

Information Security Practice and Experience

View full text Add to dashboard Cite

show abstract

“…Our scheme is also to some degree related to the problem of fair exchange of signatures (see, e.g., [2]). Recall that we aim to obtain security of our scheme via software updates.…”

Section: Related Workmentioning

confidence: 99%

Discouraging Software Piracy Using Software Aging

Jakobsson¹,

Reiter

2002

Security and Privacy in Digital Rights Management

View full text Add to dashboard Cite

Abstract. Most people consider frequent software updates a nuisance. However, we show how this common phenomenon can be turned into a feature that protects against software piracy. We define a protocol for "drop-in" upgrades of software that renders a large class of software piracy more traceable. A novel feature of our approach is a software aging technique by which we force the updates to occur, or else the software becomes decreasingly useful over time.

show abstract

“…Though this solution does not fit our goal, it is important to note that an important line of research has focused on designing protocols where the TTP is only required when "something goes wrong". These protocols are said to be optimistically fair : See [1,25] and [22] for some recent work.…”

Section: Introductionmentioning

confidence: 99%

Fair Exchange of Short Signatures without Trusted Third Party

Camacho

2013

Topics in Cryptology – CT-RSA 2013

View full text Add to dashboard Cite

We propose a protocol to exchange Boneh-Boyen short signatures in a fair way and without relying on a trusted third party. Our protocol is quite practical and is the first of the sort to the best of our knowledge. Our construction uses a new non-interactive zero-knowledge (NIZK) argument to prove that a commitment is the encryption of a bit vector. We also design a NIZK argument to prove that a commitment to a bit vector v = (b1, b2, ..., bκ) is such that i∈[κ] bi2 i−1 = θ where θ is the discrete logarithm of some public value D = g θ . These arguments may be of independent interest.

show abstract

Optimistic protocols for fair exchange

Cited by 392 publications

References 23 publications

Two-Party (Blind) Ring Signatures and Their Applications

Two-Party (Blind) Ring Signatures and Their Applications

Discouraging Software Piracy Using Software Aging

Fair Exchange of Short Signatures without Trusted Third Party

Contact Info

Product

Resources

About