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.
This work is supported by the National 973 Project (2003CB317005), the National Nature Science Foundation of China (60573002, 60703033), the Nature Science Foundation of Huzhou City Zhejiang Province (2007YZ10) and the Sci-Tech Brainstorm Stress Project of Huzhou City Zhejiang Province (2007G22).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cai, X., Gu, Y.: Measuring Anonymity. In: Bao, F., Li, H., Wang, G. (eds.) ISPEC 2009. LNCS, vol. 5451, pp. 183–194. Springer, Heidelberg (2009)
Fujioka, A., Okamoto, T., Ohta, K.: A Practical Secret Voting Scheme for Large Scale Elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 244–251. Springer, Heidelberg (1993)
Chaum, D., Fiat, A., Naor, M.: Untraceable Electronic Cash. In: Proceedings on Advances in cryptology table of contents, pp. 319–327. Springer, New York (1990)
Chothia, T.: Analysing the Mute Anonymous File-sharing System Using the Pi Calculus. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol. 4229, pp. 115–130. Springer, Heidelberg (2006)
Reiter, M., Rubin, A.: Crowds: Anonymity for Web Transactions. ACM Transactions on Information and System Security 1(1), 66–92 (1998)
Deng, Y., Palamidessi, C., Pang, J.: Weak Probabilistic Anonymity. Electronic Notes in Theoretical Computer Science 180(1), 55–76 (2007)
Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The Metric Analogue of Weak Bisimulation for Probabilistic Processes. In: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, pp. 413–422 (2002)
Goubault-Larrecq, J., Palamidessi, C., Troina, A.: A Probabilistic Applied Pi-Calculus. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 175–190. Springer, Heidelberg (2007)
Dolev, D., Yao, A.: On the Security of Public Key Protocols. IEEE Transactions on Information Theory 29(2), 198–208 (1983)
Palamidessi, C.: Probabilistic and Nondeterministic Aspects of Anonymity. Electronic Notes in Theoretical Computer Science 155, 33–42 (2006)
Chaum, D.: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology 1(1), 65–75 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, X., Gu, Y. (2009). Measuring Anonymous Systems with the Probabilistic Applied Pi Calculus. In: Gervasi, O., Taniar, D., Murgante, B., Laganà, A., Mun, Y., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2009. ICCSA 2009. Lecture Notes in Computer Science, vol 5593. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02457-3_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-02457-3_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02456-6
Online ISBN: 978-3-642-02457-3
eBook Packages: Computer ScienceComputer Science (R0)