Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-71677-8_9 | Journal of Universal Computer Science |
Keywords | DocType | Volume |
public key,standard model,security model,random oracle model,public key encryption,public key cryptography,provable security,one way function,security protocol | Journal | 14 |
Issue | ISSN | Citations |
3 | 0948-695X | 28 |
PageRank | References | Authors |
0.79 | 35 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yevgeniy Dodis | 1 | 5843 | 277.49 |
| Pil Joong Lee | 2 | 1039 | 103.09 |
| Dae Hyun Yum | 3 | 315 | 24.95 |