The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
CRYPTO '88 Proceedings on Advances in cryptology
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Electronic Notes in Theoretical Computer Science (ENTCS)
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Probabilistic and Nondeterministic Aspects of Anonymity
Electronic Notes in Theoretical Computer Science (ENTCS)
A probabilistic applied pi-calculus
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Analysing the MUTE anonymous file-sharing system using the pi-calculus
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
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.