CSP and anonymity [chapter]

Steve Schneider, Abraham Sidiropoulos
1996 Lecture Notes in Computer Science  
Security protocols are designed to meet particular security properties. In order to analyse such protocols formally, it is necessary to provide a formal de nition of the property that they are intended to provide. This paper is concerned with the property o f a n o n ymity. I t proposes a de nition of anonymity within the CSP notation, discusses the approach taken by CSP to anonymity with respect to di erent viewpoints, and illustrates this approach on some toy examples, and then applies it to
more » ... machine-assisted analysis of the dining cryptographers example and some variants. CRYPTS = CRYPT (0) jjj CRYPT (1) jjj CRYPT (2) COINS = COIN (0) jjj COIN (1) jjj COIN (2) They must synchronise on the events representing the examination of coins and the MASTER decides who is paying. MEAL = ( ( CRYPTS j look ]j COINS) j pays notpays ]j MASTER) n notpays
doi:10.1007/3-540-61770-1_38 fatcat:q5yx2aj2m5hgrpg47iycnlo2za