Abstract
We present a framework for describing and analyzing security protocols. It simplifies the applied pi calculus of Abadi and Fournet by moving away the infinite processes and the capability of transmitting channels in order to make the framework fit for describing practical protocols. An alternative operational semantics is given to make the framework more efficient when analyzing protocols. The semantics turns out to be well defined, since in this semantics labeled bisimilarity coincides with observational equivalence. We benefit from this result in analyzing the anonymity of an electronic cash protocol by the bisimulation method.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - International Symposium on Computer Science and Computational Technology, ISCSCT 2008 |
| Publisher | IEEE Computer Society |
| Pages | 87-90 |
| Number of pages | 4 |
| ISBN (Print) | 9780769534985 |
| DOIs | |
| State | Published - 2008 |
| Externally published | Yes |
| Event | International Symposium on Computer Science and Computational Technology, ISCSCT 2008 - Shanghai, China Duration: 20 Dec 2008 → 22 Dec 2008 |
Publication series
| Name | Proceedings - International Symposium on Computer Science and Computational Technology, ISCSCT 2008 |
|---|---|
| Volume | 2 |
Conference
| Conference | International Symposium on Computer Science and Computational Technology, ISCSCT 2008 |
|---|---|
| Country/Territory | China |
| City | Shanghai |
| Period | 20/12/08 → 22/12/08 |
Keywords
- Anonymity
- Component: Applied pi calculus
- Electronic cash protocol