We propose a probabilistic variant of the pi-calculus as a framework to specify randomized security protocols and their intended properties. In order to express an verify the correctness of the protocols, we develop a probabilistic version of the testing semantics. We then illustrate these concepts on an extended example: the Partial Secret Exchange, a protocol which uses a randomized primitive, the Oblivious Transfer, to achieve fairness of information exchange between two parties.
|Title of host publication||Trustworthy Global Computing (International Symposium, TGC 2005, Edinburgh, UK, April 7-9, 2005, Revised Selected Papers)|
|Editors||R. De Nicola, D. Sangiorgi|
|Place of Publication||Berlin|
|Publication status||Published - 2005|
|Name||Lecture Notes in Computer Science|