Measuring the effectiveness and the fairness of relation hiding systems

Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008

Volumn , Issue , 2008, Pages 1387-1394

  Pashalidis, Andreas ^a  

^a NEC LABORATORIES EUROPE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION MANAGEMENT; MINING;

INFORMATION-THEORETIC METRICS; PRIVACY PROTECTING; SIGNIFICANT FACTORS; UNLINKABILITY;

INFORMATION THEORY;

EID: 67049107919     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APSCC.2008.20     Document Type: Conference Paper

References (33)

1. D. Hughes and V. Shmatikov, "Information hiding, anonymity and privacy: a modular approach," Journal of Computer Security, vol.12, no. 1, pp. 3-36, 2004.
2. A. Hevia and D. Micciancio, "An indistinguishability-based characterization of anonymous channels," in Privacy Enhancing Technologies, 8th International Symposium, PETS 2008, Leuven, Belgium, July 23-25, 2008, Proceedings, ser. Lecture Notes in Computer Science, N. Borisov and I. Goldberg, Eds., vol.5134. Springer, pp. 24-43.
3. C. Andersson and R. Lundin, "On the fundamentals of anonymity metrics," in The Future of Identity in the Information Society, ser. IFIP International Federation for Information Processing. Springer Science & Business Media, 2008.
4. S. Clauß, "A framework for quantification of linkability within a privacy-enhancing identity management system," in Emerging Trends in Information and Communication Security, International Conference, ETRICS 2006, Freiburg, Germany, June 6-9, 2006, Proceedings, ser. Lecture Notes in Computer Science, G. Müller, Ed., vol.3995. Springer Verlag, pp. 191-205. (Pubitemid 44156249)
5. S. Clauß and S. Schiffner, "Structuring anonymity metrics," in DIM '06: Proceedings of the second ACM workshop on Digital identity management. New York, NY, USA: ACM Press, 2006, pp. 55-62. (Pubitemid 47165645)
6. C. Díaz, "Anonymity metrics revisited," in Anonymous Communication and its Applications, number 05411 in Dagstuhl Seminar Proceedings, 2005.
7. C. Díaz, J. Claessens, S. Seys, and B. Preneel, "Information theory and anonymity," in Proceedings of the 23rd Symposium on Information Theory in the Benelux, B. Macq and J. Quisquater, Eds., 2002, pp. 179- 186.
8. C. D́1az, S. Seys, J. Claessens, and B. Preneel, "Towards measuring anonymity," in Privacy Enhancing Technologies, Second International Workshop, PET 2002, San Francisco, CA, USA, April 14-15, 2002, Revised Papers, ser. Lecture Notes in Computer Science, R. Dingledine and P. F. Syverson, Eds., no. 2482. Springer Verlag, Berlin, 2002, pp. 54-68. (Pubitemid 36309879)
9. M. Edman, F. Sivrikaya, and B. Yener, "A combinatorial approach to measuring anonymity," in Proceedings of the 2007 IEEE International Conference on Intelligence and Security Informatics. IEEE, 2007. (Pubitemid 47469264)
10. M. Franz, B. Meyer, and A. Pashalidis, "Attacking unlinkability: The importance of context," in Privacy Enhancing Technologies, 7th International Symposium, PET 2007 Ottawa, Canada, June 20-22, 2007, Revised Selected Papers, ser. Lecture Notes in Computer Science, N. Borisov and P. Golle, Eds., vol.4776. Springer Verlag, Berlin, pp. 1-16.
11. G. Maitland, J. Reid, E. Foo, C. Boyd, and E. Dawson, "Linkability in practical electronic cash design," in Information Security, Third International Workshop, ISW 2000, Wollongong, NSW, Australia, December 20-21, 2000, Proceedings, ser. Lecture Notes in Computer Science, J. Pieprzyk, E. Okamoto, and J. Seberry, Eds., vol.1975. Springer Verlag, pp. 149-163. (Pubitemid 33209754)
12. A. Serjantov and G. Danezis, "Towards an information theoretic metric for anonymity," in Privacy Enhancing Technologies, Second International Workshop, PET 2002, San Francisco, CA, USA, April 14- 15, 2002, Revised Papers, ser. Lecture Notes in Computer Science, R. Dingledine and P. F. Syverson, Eds., vol.2482. Springer Verlag, Berlin, pp. 41-53.
13. V. Shmatikov and M.-H. Wang, "Measuring relationship anonymity in mix networks," in WPES '06: Proceedings of the 5th ACM workshop on Privacy in electronic society. New York, NY, USA: ACM Press, 2006, pp. 59-62.
14. G. Tóth, Z. Hornák, and F. Vajda, "Measuring anonymity revisited," in Proceedings of the Ninth Nordic Workshop on Secure IT Systems, S. Liimatainen and T. Virtanen, Eds., Espoo, Finland, November 2004, pp. 85-90.
15. S. Steinbrecher and S. Köpsell, "Modelling unlinkability," in Privacy Enhancing Technologies, Third International Workshop, PET 2003, Dresden, Germany, March 26-28, 2003, Revised Papers, ser. Lecture Notes in Computer Science, R. Dingledine, Ed., vol.2760. Springer Verlag, Berlin, pp. 32-47.
16. M. Bellare, D. Micciancio, and B. Warinschi, "Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions," in Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings, ser. Lecture Notes in Computer Science, E. Biham, Ed., vol.2656. Springer, pp. 614-629.
17. C. E. Shannon, "Communication theory of secrecy systems," Bell System Technical Journal, vol.28, no. 4, pp. 656-715, 1949. [Online]. Available: http://netlab.cs.ucla.edu/wiki/files/shannon1949.pdf
18. G. Tóth and Z. Hornák, "Measuring anonymity in a non-adaptive, realtime system," in Privacy Enhancing Technologies, 4th International Workshop, PET 2004, Toronto, Canada, May 26-28, 2004, Revised Selected Papers, ser. Lecture Notes in Computer Science, D. Martin and A. Serjantov, Eds., vol.3424. Springer Verlag, Berlin, pp. 226-241.
19. C. Díaz, C. Troconso, and G. Danezis, "Does additional information always decrease anonymity?" in Proceedings of the 6th ACM Workshop on Privacy in the Electronic Society (WPES'07), T. Yu, Ed. ACM Press, 2007, pp. 72-75.
20. P. Venkitasubramaniam, T. He, and L. Tong, "Anonymous networking amidst eavesdroppers," The Computing Research Repository, vol. abs/0710.4903, 2007.
21. R. Jain, D. Chiu, and W. Hawe, "A quantitative measure of fairness and discrimination for resource allocation in shared computer systems," DEC, Research Report TR-301, 1984.
22. Z. Fang and B. Bensaou, "Fair bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networks," in Proceedings of IEEE INFOCOM 2004, The 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, Hong Kong, China, March 7-11, 2004. IEEE, 2004.
23. Z. Fu, P. Zerfos, H. Luo, S. Lu, L. Zhang, and M. Gerla, "The impact of multihop wireless channel on TCP throughput and loss," in Proceedings of IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30-April 3, 2003. IEEE, 2003.
24. M. D. Welsh, "An architecture for highly concurrent, well-conditioned internet services," PhD thesis, Universirty of California at Berkeley, 2002.
25. E. T. Bell, "Exponential numbers," American Mathematical Monthly, vol.41, pp. 411-419, 1934.
26. D. Chaum, "Security without identification: transaction systems to make big brother obsolete," Communications of the ACM, vol.28, no. 10, pp. 1030-1044, 1985.
27. "Showing credentials without identification: transferring signatures between unconditionally unlinkable pseudonyms," in Advances in Cryptology - AUSCRYPT 90, ser. Lecture Notes in Computer Science, J. Seberry and J. Pieprzyk, Eds., vol.453. Springer Verlag, Berlin, 1990, pp. 246-264.
28. L. Chen, "Access with pseudonyms," in Cryptography: Policy and Algorithms, International Conference, Brisbane, Queensland, Australia, July 3-5, 1995, Proceedings, ser. Lecture Notes in in Computer Science, E. Dawson and J. D. Golic, Eds., no. 1029. Springer Verlag, Berlin, 1995, pp. 232-243. (Pubitemid 126030177)
29. D. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms," Communications of the ACM, vol.24, no. 2, pp. 84-90, 1981. (Pubitemid 11480996)
30. B. Gierlichs, C. Troncoso, C. Díaz, B. Preneel, and I. Verbauwhede, "Revisiting a combinatorial approach toward measuring anonymity," in Proceedings of the 2008 ACM Workshop on Privacy in the Electronic Society, WPES 2008, Alexandria, Virginia, USA, October 27, 2008. ACM, 2008.
31. F. Harary and R. W. Robinson, "Labeled bipartite blocks," Canadian Journal of Mathematics, vol.31, pp. 60-68, 1979.
32. K. B. Frikken and P. Golle, "Private social network analysis: How to assemble pieces of a graph privately," in 2006 Workshop on Privacy in the Electronic Society. ACM Press, 2006, pp. 89-97.
33. P. Erdös and R. Rado, "A partition calculus in set theory," Bulletin of the American Mathematical Society, vol.62, no. 5, pp. 427-489, 1956.