Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information Security Practice and Experience

ISPEC 2009: Information Security Practice and Experience pp 183–194Cite as

Measuring Anonymity

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5451))

Abstract

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.

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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Reiter, M., Rubin, A.: Crowds: anonymity for Web transactions. ACM Transactions on Information and System Security 1(1), 66–92 (1998)

    Article  Google Scholar 

  2. Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. Auscrypt. 92, 244–251 (1993)

    MATH  Google Scholar 

  3. Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 319–327. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  4. Chothia, T.: Analysing the Mute Anonymous File-sharing System Using the Pi Calculus. In: Proceedings of the 26th Conference on Formal Methods for Networked and Distributed Systems. LNCS. Springer, Heidelberg (2006)

    Google Scholar 

  5. Deng, Y., Palamidessi, C., Pang, J.: Weak Probabilistic Anonymity. Electronic Notes in Theoretical Computer Science 180(1), 55–76 (2007)

    Article  MATH  Google Scholar 

  6. Shmatikov, V.: Probabilistic model checking of an anonymity system. Journal of Computer Security 12(3/4), 355–377 (2004)

    Article  MATH  Google Scholar 

  7. Halpern, J.: Anonymity and Information Hiding in Multiagent Systems. Journal of Computer Security 13(3), 483–514 (2005)

    Article  Google Scholar 

  8. Díaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol. 2482, pp. 54–68. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Lowe, G.: Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. Software - Concepts and Tools 17(3), 93–102 (1996)

    Google Scholar 

  10. Abadi, M., Gordon, A.: A Calculus for Cryptographic Protocols: The Spi Calculus. In: Proceedings of 4th ACM Conference on Computer and Communications Security, pp. 36–47 (1997), http://www.research.digital.com/SRC/~abadi

  11. Abadi, M., Fournet, C.: Mobile Values, New Names, and Secure Communication. In: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 104–115. ACM Press, New York (2001)

    Google Scholar 

  12. Abadi, M., Blanchet, B., Fournet, C.: Just fast keying in the pi calculus. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 340–354. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Fournet, C., Abadi, M.: Hiding names: Private authentication in the applied pi calculus. In: Okada, M., Pierce, B.C., Scedrov, A., Tokuda, H., Yonezawa, A. (eds.) ISSS 2002. LNCS, vol. 2609, pp. 317–338. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Luo, Z., Cai, X., Pang, J., Deng, Y.: Analyzing an electronic cash protocol using applied pi calculus. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 87–103. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. 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)

    Chapter  Google Scholar 

  16. Deng, Y., Chothia, T., Palamidessi, C., Pang, J.: Metrics for Action-labelled Quantitative Transition Systems. ENTCS 153(2), 79–96 (2006)

    Google Scholar 

  17. Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled Markov processes. Theoretical Computer Science 318(3), 323–354 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  18. 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)

    Google Scholar 

  19. Kremer, S., Ryan, M.D.: Analysis of an electronic voting protocol in the applied pi calculus. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 186–200. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Pfitzmann, A., Köhntopp, M.: Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 1–9. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Berthold, O., Langos, H.: Dummy traffic against long term intersection attacks. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol. 2482, pp. 110–128. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BASICS Lab, Department of Computer Science, Shanghai Jiao Tong University, Shanghai, China, 200240

    Xiaojuan Cai

  2. Department of Computer Science, Huzhou Teacher College, Zhejiang, China, 313000

    Yonggen Gu

Authors
  1. Xiaojuan Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yonggen Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Infocomm Research (I<Superscript>2</Superscript>R) 1, Fusionopolis Way #19-01 Connexis, 138632, South Tower, Singapore

    Feng Bao

  2. School of Telecommunications Engineering, Xidian University, No.2 South Taibai Road, 710071, Xi’an, Shaanxi, P. R. China

    Hui Li

  3. School of Computer Science, University of Birmingham Homepage: http://www.cs.bham.ac.uk/~gzw/, B15 2TT, Birmingham, UK

    Guilin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, X., Gu, Y. (2009). Measuring Anonymity. In: Bao, F., Li, H., Wang, G. (eds) Information Security Practice and Experience. ISPEC 2009. Lecture Notes in Computer Science, vol 5451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00843-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00843-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00842-9

  • Online ISBN: 978-3-642-00843-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation