Optimistic fair exchange in a multi-user setting

Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum

Research output: Contribution to journalArticle

Abstract

This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-user setting guarantees the security in a multi-user setting, we show that the situation is different in the optimistic fair exchange. First, we show how to break, in the multi-user setting, an optimistic fair exchange scheme provably secure in the single-user setting. This example separates the security of optimistic fair exchange between the single-user setting and the multi-user setting. We then define the formal security model of optimistic fair exchange in the multi-user setting, which is the first complete security model of optimistic fair exchange in the multi-user setting. We prove the existence of a generic construction meeting our multi-user security based on oneway functions in the random oracle model and trapdoor one-way permutations in the standard model. Finally, we revisit two well-known methodologies of optimistic fair exchange, which are based on the verifiably encrypted signature and the sequential two-party multisignature, respectively. Our result shows that these paradigms remain valid in the multi-user setting.

Original languageEnglish (US)
Pages (from-to)318-346
Number of pages29
JournalJournal of Universal Computer Science
Volume14
Issue number3
StatePublished - 2008

Fingerprint

Fair Exchange
Security Model
Cryptography
Multisignature
One-way Function
Public Key Encryption
Random Oracle Model
Public key
Signature Scheme
Formal Model
Standard Model
Permutation
Signature
Paradigm
Valid
Methodology

Keywords

  • Fair exchange
  • Public key cryptography
  • Security protocol

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Optimistic fair exchange in a multi-user setting. / Dodis, Yevgeniy; Lee, Pil Joong; Yum, Dae Hyun.

In: Journal of Universal Computer Science, Vol. 14, No. 3, 2008, p. 318-346.

Research output: Contribution to journalArticle

Dodis, Yevgeniy ; Lee, Pil Joong ; Yum, Dae Hyun. / Optimistic fair exchange in a multi-user setting. In: Journal of Universal Computer Science. 2008 ; Vol. 14, No. 3. pp. 318-346.
@article{4fe0d223a8244b26800e84a2cb171f1a,
title = "Optimistic fair exchange in a multi-user setting",
abstract = "This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-user setting guarantees the security in a multi-user setting, we show that the situation is different in the optimistic fair exchange. First, we show how to break, in the multi-user setting, an optimistic fair exchange scheme provably secure in the single-user setting. This example separates the security of optimistic fair exchange between the single-user setting and the multi-user setting. We then define the formal security model of optimistic fair exchange in the multi-user setting, which is the first complete security model of optimistic fair exchange in the multi-user setting. We prove the existence of a generic construction meeting our multi-user security based on oneway functions in the random oracle model and trapdoor one-way permutations in the standard model. Finally, we revisit two well-known methodologies of optimistic fair exchange, which are based on the verifiably encrypted signature and the sequential two-party multisignature, respectively. Our result shows that these paradigms remain valid in the multi-user setting.",
keywords = "Fair exchange, Public key cryptography, Security protocol",
author = "Yevgeniy Dodis and Lee, {Pil Joong} and Yum, {Dae Hyun}",
year = "2008",
language = "English (US)",
volume = "14",
pages = "318--346",
journal = "Journal of Universal Computer Science",
issn = "0948-695X",
publisher = "Springer Verlag",
number = "3",

}

TY - JOUR

T1 - Optimistic fair exchange in a multi-user setting

AU - Dodis, Yevgeniy

AU - Lee, Pil Joong

AU - Yum, Dae Hyun

PY - 2008

Y1 - 2008

N2 - This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-user setting guarantees the security in a multi-user setting, we show that the situation is different in the optimistic fair exchange. First, we show how to break, in the multi-user setting, an optimistic fair exchange scheme provably secure in the single-user setting. This example separates the security of optimistic fair exchange between the single-user setting and the multi-user setting. We then define the formal security model of optimistic fair exchange in the multi-user setting, which is the first complete security model of optimistic fair exchange in the multi-user setting. We prove the existence of a generic construction meeting our multi-user security based on oneway functions in the random oracle model and trapdoor one-way permutations in the standard model. Finally, we revisit two well-known methodologies of optimistic fair exchange, which are based on the verifiably encrypted signature and the sequential two-party multisignature, respectively. Our result shows that these paradigms remain valid in the multi-user setting.

AB - This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-user setting guarantees the security in a multi-user setting, we show that the situation is different in the optimistic fair exchange. First, we show how to break, in the multi-user setting, an optimistic fair exchange scheme provably secure in the single-user setting. This example separates the security of optimistic fair exchange between the single-user setting and the multi-user setting. We then define the formal security model of optimistic fair exchange in the multi-user setting, which is the first complete security model of optimistic fair exchange in the multi-user setting. We prove the existence of a generic construction meeting our multi-user security based on oneway functions in the random oracle model and trapdoor one-way permutations in the standard model. Finally, we revisit two well-known methodologies of optimistic fair exchange, which are based on the verifiably encrypted signature and the sequential two-party multisignature, respectively. Our result shows that these paradigms remain valid in the multi-user setting.

KW - Fair exchange

KW - Public key cryptography

KW - Security protocol

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

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

M3 - Article

AN - SCOPUS:44349184441

VL - 14

SP - 318

EP - 346

JO - Journal of Universal Computer Science

JF - Journal of Universal Computer Science

SN - 0948-695X

IS - 3

ER -