2005
DOI: 10.1007/11580850_9
|View full text |Cite
|
Sign up to set email alerts
|

A Framework for Analyzing Probabilistic Protocols and Its Application to the Partial Secrets Exchange

Abstract: Abstract. 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
24
0

Year Published

2005
2005
2012
2012

Publication Types

Select...
4
2

Relationship

4
2

Authors

Journals

citations
Cited by 18 publications
(24 citation statements)
references
References 11 publications
0
24
0
Order By: Relevance
“…Here we are able to make such distinction, and we express strong anonymity in terms of belief (see Section 4). A similar consideration holds for the properties of the Oblivious Transfer analysed in (Chatzikokolakis et al, 2007a), which are represented here by using both belief and probabilistic truth (see Section 5).…”
Section: Contributionmentioning
confidence: 96%
See 4 more Smart Citations
“…Here we are able to make such distinction, and we express strong anonymity in terms of belief (see Section 4). A similar consideration holds for the properties of the Oblivious Transfer analysed in (Chatzikokolakis et al, 2007a), which are represented here by using both belief and probabilistic truth (see Section 5).…”
Section: Contributionmentioning
confidence: 96%
“…The formulas of DµCEC are interpreted in terms of the processes of a small protocol specification formalism, namely CCS with probabilistic internal choice (CCS p ), which is a variant of the language proposed in (Chatzikokolakis et al, 2007a;Chatzikokolakis et al, 2007b). We show some application examples of our logic to the archetypical dining cryptographers (Chaum, 1988), and to oblivious transfer (Rabin, 1981) for single bits and entire strings.…”
Section: Contributionmentioning
confidence: 99%
See 3 more Smart Citations