Views
5 years ago

Optimistic Fair Exchange - SciDok - Universität des Saarlandes

Optimistic Fair Exchange - SciDok - Universität des Saarlandes

Abstract A fair exchange

Abstract A fair exchange guarantees that a participant only reveals its items (such as signatures, payments, or data) if it receives the expected items in exchange. Efficient fair exchange requires a so-called third party, which is assumed to be correct. Optimistic fair exchange involves this third party only if needed, i.e., if the participants cheat or disagree. In Part I, we prove lower bounds on the message and time complexity of two particular instances of fair exchange in varying models, namely contract signing (fair exchange of two signatures under a contract) and certified mail (fair exchange of data for a receipt). We show that all given bounds are tight by describing provably time- and message-optimal protocols for all considered models and instances. In Part II, we have a closer look at formalizing the security of fair exchange. We introduce a new formal notion of security (including secrecy) for reactive distributed systems. We illustrate this new formalism by a specification of certified mail as an alternative to the traditional specification given in Part I. In Part III, we describe protocols for generic and optimistic fair exchange of arbitrary items. These protocols are embedded into the SEMPER Fair Exchange Layer, which is a central part of the SEMPER Framework for Secure Electronic Commerce. i

  • Page 1: Optimistic Fair Exchange Dissertati
  • Page 5 and 6: Zusammenfassung Ein zentrales Probl
  • Page 7 and 8: Contents Zusammenfassung iii 1 Intr
  • Page 9 and 10: CONTENTS 8 Security of Reactive Sys
  • Page 11 and 12: Chapter 1 Introduction and Overview
  • Page 13 and 14: 1.1. Overview be more efficient tha
  • Page 15 and 16: Chapter 2 Related Work In this chap
  • Page 17 and 18: 2.2. Contract Signing • the proto
  • Page 19 and 20: 2.2.3 Gradual Protocols 2.2. Contra
  • Page 21 and 22: sender: S → third party T1 → ..
  • Page 23 and 24: Sender S Third Party T Recipient R
  • Page 25 and 26: 2.3. Certified Mail Sender S Recipi
  • Page 27 and 28: 2.5. Other Instances of Fair Exchan
  • Page 29 and 30: 2.5. Other Instances of Fair Exchan
  • Page 31 and 32: 2.5. Other Instances of Fair Exchan
  • Page 33: Part I Optimal Efficiency of Optimi
  • Page 36 and 37: 3. Optimal Efficiency of Optimistic
  • Page 38 and 39: 3. Optimal Efficiency of Optimistic
  • Page 40 and 41: 3. Optimal Efficiency of Optimistic
  • Page 42 and 43: 3. Optimal Efficiency of Optimistic
  • Page 44 and 45: 3. Optimal Efficiency of Optimistic
  • Page 46 and 47: 3. Optimal Efficiency of Optimistic
  • Page 48 and 49: 3. Optimal Efficiency of Optimistic
  • Page 50 and 51: 3. Optimal Efficiency of Optimistic
  • Page 52 and 53:

    3. Optimal Efficiency of Optimistic

  • Page 54 and 55:

    3. Optimal Efficiency of Optimistic

  • Page 56 and 57:

    3. Optimal Efficiency of Optimistic

  • Page 58 and 59:

    3. Optimal Efficiency of Optimistic

  • Page 60 and 61:

    3. Optimal Efficiency of Optimistic

  • Page 62 and 63:

    3. Optimal Efficiency of Optimistic

  • Page 64 and 65:

    3. Optimal Efficiency of Optimistic

  • Page 66 and 67:

    3. Optimal Efficiency of Optimistic

  • Page 68 and 69:

    3. Optimal Efficiency of Optimistic

  • Page 70 and 71:

    3. Optimal Efficiency of Optimistic

  • Page 72 and 73:

    3. Optimal Efficiency of Optimistic

  • Page 74 and 75:

    4. Optimal Efficiency of Optimistic

  • Page 76 and 77:

    4. Optimal Efficiency of Optimistic

  • Page 78 and 79:

    4. Optimal Efficiency of Optimistic

  • Page 80 and 81:

    4. Optimal Efficiency of Optimistic

  • Page 82 and 83:

    4. Optimal Efficiency of Optimistic

  • Page 84 and 85:

    4. Optimal Efficiency of Optimistic

  • Page 86 and 87:

    4. Optimal Efficiency of Optimistic

  • Page 88 and 89:

    4. Optimal Efficiency of Optimistic

  • Page 90 and 91:

    4. Optimal Efficiency of Optimistic

  • Page 92 and 93:

    4. Optimal Efficiency of Optimistic

  • Page 94 and 95:

    4. Optimal Efficiency of Optimistic

  • Page 96 and 97:

    4. Optimal Efficiency of Optimistic

  • Page 98 and 99:

    4. Optimal Efficiency of Optimistic

  • Page 100 and 101:

    4. Optimal Efficiency of Optimistic

  • Page 102 and 103:

    5. Conclusion and Outlook 92

  • Page 105 and 106:

    Chapter 6 Introduction Most practic

  • Page 107 and 108:

    6.2. “Real-world” Trusted Hosts

  • Page 109 and 110:

    Chapter 7 Related Work Early resear

  • Page 111 and 112:

    7.4. Reactive and General Simulatab

  • Page 113 and 114:

    Chapter 8 Security of Reactive Syst

  • Page 115 and 116:

    8.1.4 Honest Users 8.1. Building Bl

  • Page 117 and 118:

    8.1. Building Blocks of a Model of

  • Page 119 and 120:

    8.2. Simulateability Definition of

  • Page 121 and 122:

    8.3. Properties of our Definition

  • Page 123 and 124:

    8.3. Properties of our Definition I

  • Page 125 and 126:

    H g M 1 H g M 2 G AH,g,1 G 1 A g,1

  • Page 127 and 128:

    8.3. Properties of our Definition N

  • Page 129 and 130:

    8.3. Properties of our Definition P

  • Page 131 and 132:

    9.1. Secure Channels delays. For in

  • Page 133 and 134:

    9.1. Secure Channels {1,... ,rnds}

  • Page 135 and 136:

    M u in'(u) out'(u) in'(w) out'(w) i

  • Page 137 and 138:

    9.1. Secure Channels expects to see

  • Page 139 and 140:

    9.1. Secure Channels sketched in [C

  • Page 141 and 142:

    9.1. Secure Channels the real syste

  • Page 143 and 144:

    9.2. Labeled Certified Mail Let pt(

  • Page 145 and 146:

    9.2. Labeled Certified Mail whateve

  • Page 147 and 148:

    adv_show / (rec_to_v, l, m, tid) ad

  • Page 149 and 150:

    9.2. Labeled Certified Mail disting

  • Page 151 and 152:

    9.2. Labeled Certified Mail diagram

  • Page 153 and 154:

    9.2. Labeled Certified Mail Each re

  • Page 155 and 156:

    9.2. Labeled Certified Mail cm ss(r

  • Page 157 and 158:

    9.2. Labeled Certified Mail Round c

  • Page 159 and 160:

    9.2. Labeled Certified Mail H are i

  • Page 161 and 162:

    9.2. Labeled Certified Mail TH Adve

  • Page 163 and 164:

    9.2. Labeled Certified Mail s∗ (H

  • Page 165 and 166:

    9.2. Labeled Certified Mail break t

  • Page 167 and 168:

    9.2. Labeled Certified Mail changes

  • Page 169 and 170:

    Chapter 10 Conclusion and Outlook I

  • Page 171:

    Part III Transfer-based Optimistic

  • Page 174 and 175:

    11. Introduction and Overview both

  • Page 176 and 177:

    11. Introduction and Overview Selle

  • Page 178 and 179:

    11. Introduction and Overview 11.3

  • Page 180 and 181:

    11. Introduction and Overview Howev

  • Page 182 and 183:

    12. Foundations of Transfer-based F

  • Page 184 and 185:

    12. Foundations of Transfer-based F

  • Page 186 and 187:

    12. Foundations of Transfer-based F

  • Page 188 and 189:

    12. Foundations of Transfer-based F

  • Page 190 and 191:

    12. Foundations of Transfer-based F

  • Page 192 and 193:

    12. Foundations of Transfer-based F

  • Page 194 and 195:

    12. Foundations of Transfer-based F

  • Page 196 and 197:

    12. Foundations of Transfer-based F

  • Page 198 and 199:

    12. Foundations of Transfer-based F

  • Page 200 and 201:

    12. Foundations of Transfer-based F

  • Page 202 and 203:

    12. Foundations of Transfer-based F

  • Page 204 and 205:

    12. Foundations of Transfer-based F

  • Page 206 and 207:

    12. Foundations of Transfer-based F

  • Page 208 and 209:

    Chapter 13 Protocols for Transfer-b

  • Page 210 and 211:

    13. Protocols for Transfer-based Fa

  • Page 212 and 213:

    13. Protocols for Transfer-based Fa

  • Page 214 and 215:

    13. Protocols for Transfer-based Fa

  • Page 216 and 217:

    13. Protocols for Transfer-based Fa

  • Page 218 and 219:

    13. Protocols for Transfer-based Fa

  • Page 220 and 221:

    13. Protocols for Transfer-based Fa

  • Page 222 and 223:

    13. Protocols for Transfer-based Fa

  • Page 224 and 225:

    13. Protocols for Transfer-based Fa

  • Page 226 and 227:

    13. Protocols for Transfer-based Fa

  • Page 228 and 229:

    Chapter 14 The SEMPER Fair Exchange

  • Page 230 and 231:

    14. The SEMPER Fair Exchange Framew

  • Page 232 and 233:

    14. The SEMPER Fair Exchange Framew

  • Page 234 and 235:

    14. The SEMPER Fair Exchange Framew

  • Page 236 and 237:

    14. The SEMPER Fair Exchange Framew

  • Page 238 and 239:

    14. The SEMPER Fair Exchange Framew

  • Page 240 and 241:

    15. Conclusion and Outlook “pure

  • Page 242 and 243:

    BIBLIOGRAPHY [AsSW 98] N. Asokan, V

  • Page 244 and 245:

    BIBLIOGRAPHY [BrDo 84] Andrei Z. Br

  • Page 246 and 247:

    BIBLIOGRAPHY [EvGL 85] Shimon Even,

  • Page 248 and 249:

    BIBLIOGRAPHY [HaTs 96] Ralf Hauser,

  • Page 250 and 251:

    BIBLIOGRAPHY [PfSW1 00] Birgit Pfit

  • Page 252 and 253:

    BIBLIOGRAPHY [SuTy 96] Jiawen Su, J

  • Page 254 and 255:

    Index 〈X, Y〉, 65, 168, 169 |S|,

  • Page 256 and 257:

    INDEX fair exchange framework exten

  • Page 258 and 259:

    INDEX simple certified mail, 87 sec

The Spotlight Principle - Universität des Saarlandes
Woher kommen Software-Fehler - Universität des Saarlandes
An Optimistic Fair Exchange Protocol and its Security in the ...
Embedded Systems (WS 2002/2003) - Universität des Saarlandes
Probabilistic CEGAR* - Universität des Saarlandes
Amoebas - Mathematik - Universität des Saarlandes
Literature Fingerprinting - Universität des Saarlandes
Universität des Saarlandes Fachrichtung 6.1 – Mathematik
Efficiency of optimistic fair exchange using trusted ... - AVANTSSAR
What are operator spaces? - Mathematik - Universität des Saarlandes
t - Fachrichtung Mathematik, Universität des Saarlandes
Universität des Saarlandes Fachrichtung 6.1 – Mathematik
Calculemus - Prof. Jörg Siekmann - Universität des Saarlandes
Universität des Saarlandes Fachrichtung 6.1 – Mathematik
Statement - o r g a . u n i - Universität des Saarlandes