Steve Kremer and Jean-Francois Raskin. A game-based verification of nonrepudiation and fair exchange protocols. In Kim G. Larsen and Mogens Nielsen, editors, Concurrency Theory---CONCUR 2001, volume 2154 of Lecture Notes in Computer Science, pages 551--565, Aalborg, Denmark, August 2001. SpringerVerlag.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....is of the sort mssg. Once a fact N(m) for some m is added to the state, it is never removed. As in contract signing protocols in the literature [3, 18] we assume that channels between signers and T are inaccessible to the adversary and separate from the network between O and R (by contrast, [20] considers security of contract signing protocols under relaxed assumptions about channel security) Channels between signers and T are modeled by ternary TTPchannel predicates, whose arguments are of the sort public key, public key and mssg, respectively. For example, tc o (k o ; k t ; m) models ....

....tr) that A is participating in the protocol, i.e. there is another trace tr from S 0 to some S such that Obsv C (S ) is indistinguishable by C from Obsv C (S; tr) and A is not participating in tr . 6 Related work Previous game theoretic approaches to the study of fair exchange [11, 20, 21] focused on formalizing fairness for the strongest possible honest player without taking optimism into account. In [20] fairness is formalized as the existence of a defense strategy for the honest player, which is not sufficient if the honest player faces nondeterministic choices in the protocol, ....

[Article contains additional citation context not shown here]

S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In Proc. CONCUR '01, pages 551--565, 2001.

....[2] In particular, we have to cover the following two aspects. First, non repudiation, i.e. the ability to demonstrate that a certain actor has committed to a certain action (e.g. to a payment) To capture non repudiation we have to extend the tool we have with a game based semantics, as shown in [9]. Secondly, we have to consider multi part communication. In a context in which licenses can be split and recombined together, we cannot think of protocols as being carried out just by two honest principals and an intruder: the increased number of principals can allow for more complex attacks, in ....

S. Kremer and J-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In K. G. Larsen and M. Nielsen, editors, Proc. Concur'01, 12th International Conference of Concurrency Theory, number 2154 in LNCS, pages 551--565. Springer-Verlag, 2001.

No context found.

Steve Kremer and Jean-Francois Raskin. A game-based verification of nonrepudiation and fair exchange protocols. In Kim G. Larsen and Mogens Nielsen, editors, Concurrency Theory---CONCUR 2001, volume 2154 of Lecture Notes in Computer Science, pages 551--565, Aalborg, Denmark, August 2001. SpringerVerlag.

No context found.

S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In K. Larsen and M. Nielsen, editors, Concurrency Theory - Concur 2001.

No context found.

S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In K. Larsen and M. Nielsen, editors, Concurrency Theory - Concur 2001.

No context found.

S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In K. Larsen and M. Nielsen, editors, CONCUR: 12th International Conference on Concurrency Theory, volume 2154 of Lecture Notes in Computer Science, Aalborg, Denmark, Aug. 2001. Springer-Verlag.

No context found.

S. Kremer, J.-F. Raskin, A game-based verification of non-repudiation and fair exchange protocols, in: K. G. Larsen, M. Nielson (Eds.), Concur'01, Vol. 2154 of Lecture Notes in Computer Science, Springer-Verlag, 2001.

....a temporal logic, ATL, having game semantics and the corresponding model checker Mocha to analyse several non repudiation and fair exchange protocols. In this paper, we show how this method can be used for analyzing contract signing protocols and model abuse freeness in a natural way. As shown in [10], games can be used to model accurately exchange protocols. They are particularly interesting, as we have to model the fact that the entities, participating in the protocol, may be dishonest. This is one of the major di#erences with other classical security protocols. We 2 do not model an ....

....and Bob have to choose to continue the main protocol or to launch a subprotocol by contacting the TTP. Moreover, subprotcols may be executed at a moment not foreseen by the protocol and lead to subtle flaws. Therefore, no predefined order is given to these actions when specifying the protocol. In [10], Kremer and Raskin show for instance that fairness can be rephrased naturally in terms of strategies. We say that the protocol is fair for Alice, if Bob in collaboration with the communication channels does not have a strategy against Alice to obtain Alice s signature on the contract, without ....

[Article contains additional citation context not shown here]

S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In K. Larsen and M. Nielsen, editors, Concurrency Theory - Concur

No context found.

S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In Proc. CONCUR '01, pages 551--565, 2001.

No context found.

S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In Proceedings of the 12th International Conference on Concurrency Theory, volume 2154 of Lecture Notes in Computer Science, pages 551--565. Springer, 2001.

No context found.

S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In Proceedings of the 12th International Conference on Concurrency Theory, volume 2154 of Lecture Notes in Computer Science, pages 551--565. Springer, 2001.

No context found.

S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In Proc. CONCUR '01, pages 551--565, 2001.

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