Name
Abstract | ||
|---|---|---|
In [1] a formulation of anonymity based on metrics of Probabilistic Applied Pi processes was proposed. As an extension to [1], we consider to neglect all the internal interactions in the definition of metric. In other words, the new metric between two processes turns out to be 0 when these two processes are weakly bisimilar (strongly bisimilar in [1]). Upon metric, the degree of probabilistic anonymity is modelled for general anonymous systems where there are no explicit senders or receivers. In addition, we devise an algorithm to calculate the metric between two finite processes. As a running example, we analyze the classical anonymous protocol -- Probabilistic Dining Cryptographer Problem -- to illustrate the effectiveness of our approach. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02457-3_52 | ICCSA |
Keywords | Field | DocType |
finite process,explicit sender,general anonymous system,probabilistic dining cryptographer problem,weakly bisimilar,probabilistic applied pi calculus,probabilistic anonymity,probabilistic applied pi process,measuring anonymous systems,internal interaction,classical anonymous protocol | Discrete mathematics,Mathematical optimization,Computer science,Pi calculus,Theoretical computer science,Anonymity,Probabilistic logic | Conference |
Volume | ISSN | Citations |
5593 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 13 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaojuan Cai | 1 | 36 | 5.95 |
| Yonggen Gu | 2 | 18 | 6.83 |