Birgit Pfitzmann, Matthias Schunter, Michael Waidner: Optimal E#ciency of Optimistic Contract Signing; ACM Principles of Distributed Computing (PODC), Puerto Vallarta, June 1998, 113--122. 10  Home/Search   Document Not in Database   Summary   Related Articles

....a non negligible error. Basically the error probability is at least linear in the number of rounds [BGMR90] and obviously this result holds for the multi party case as well. The first optimistic 2 party contract signing protocol was proposed in [BGMR90] the first communication optimized ones in [AsSW97, PfSW98]. The first asynchronous 2 party protocol was described in [AsSW98, AsSW198] 1 A preliminary version of Protocol 1 has been described in the technical report [AsSW296] 1 So far contract signing has not been used as verifiable commit. Generic optimistic 2 party fair exchange protocols (in the ....

....T is received, and stops. Verification: Any verifier V accepts a contract if it sees a full and consistent M 2 or an m T containing a full and consistent M 1 . # In the all honest case, each party broadcasts at most 2 messages in 2 rounds. For n = 2 Protocol 1 becomes identical to Scheme 2 of [PfSW98]. Using their argument one can trivially conclude that Protocol 1 is round optimal. In any case, the protocol needs at most 4 rounds of communication. In the all honest case 2n messages are broadcast to n 1 parties. If some parties cheat one has to add, in the worst case, n messages of type m ....

[Article contains additional citation context not shown here]

Birgit Pfitzmann, Matthias Schunter, Michael Waidner: Optimal E#ciency of Optimistic Contract Signing; ACM Principles of Distributed Computing (PODC), Puerto Vallarta, June 1998, 113--122. 10

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC