Optimistic fair exchange in a multi-user setting

Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 one-way 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)
Title of host publicationPublic Key Cryptography - PKC 2007 - 10th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings
Pages118-133
Number of pages16
Volume4450 LNCS
StatePublished - 2007
Event10th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2007 - Beijing, China
Duration: Apr 16 2007Apr 20 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4450 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other10th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2007
CountryChina
CityBeijing
Period4/16/074/20/07

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Dodis, Y., Lee, P. J., & Yum, D. H. (2007). Optimistic fair exchange in a multi-user setting. In Public Key Cryptography - PKC 2007 - 10th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 4450 LNCS, pp. 118-133). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4450 LNCS).

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

Public Key Cryptography - PKC 2007 - 10th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. Vol. 4450 LNCS 2007. p. 118-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4450 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dodis, Y, Lee, PJ & Yum, DH 2007, Optimistic fair exchange in a multi-user setting. in Public Key Cryptography - PKC 2007 - 10th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. vol. 4450 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4450 LNCS, pp. 118-133, 10th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2007, Beijing, China, 4/16/07.
Dodis Y, Lee PJ, Yum DH. Optimistic fair exchange in a multi-user setting. In Public Key Cryptography - PKC 2007 - 10th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. Vol. 4450 LNCS. 2007. p. 118-133. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Dodis, Yevgeniy ; Lee, Pil Joong ; Yum, Dae Hyun. / Optimistic fair exchange in a multi-user setting. Public Key Cryptography - PKC 2007 - 10th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. Vol. 4450 LNCS 2007. pp. 118-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{09d5a5cb608b40d4bc75e103a7acdfa7,
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 one-way 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.",
author = "Yevgeniy Dodis and Lee, {Pil Joong} and Yum, {Dae Hyun}",
year = "2007",
language = "English (US)",
isbn = "9783540716761",
volume = "4450 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "118--133",
booktitle = "Public Key Cryptography - PKC 2007 - 10th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings",

}

TY - GEN

T1 - Optimistic fair exchange in a multi-user setting

AU - Dodis, Yevgeniy

AU - Lee, Pil Joong

AU - Yum, Dae Hyun

PY - 2007

Y1 - 2007

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 one-way 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 one-way 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.

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

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

M3 - Conference contribution

SN - 9783540716761

VL - 4450 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 118

EP - 133

BT - Public Key Cryptography - PKC 2007 - 10th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings

ER -