A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
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
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic analysis of an anonymity system
Journal of Computer Security - Special issue on CSFW15
Analyzing an Electronic Cash Protocol Using Applied Pi Calculus
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Dummy traffic against long term intersection attacks
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Hiding names: private authentication in the applied pi calculus
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
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
Analysis of an electronic voting protocol in the applied pi calculus
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Knowledge Aware Bisimulation and Anonymity
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Measuring Anonymous Systems with the Probabilistic Applied Pi Calculus
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
On the complexity of computing probabilistic bisimilarity
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On-the-Fly exact computation of bisimilarity distances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
Some systems offer probabilistic anonymity. The degree of anonymity is considered and defined by Reiter and Rubin [1]. In this paper metrics are proposed to measure anonymity of probabilistic systems. The metric induces a topology on probabilistic applied *** processes, which are used to model anonymous systems. The degree of anonymity is formally defined, and as an illustrating example, Crowds --- an anonymous system for web transaction --- is analyzed.