Provable anonymity

FMSE'05: Proceedings of the 2005 ACM Workshop on Formal Methods in Security Engineering

Volumn , Issue , 2005, Pages 63-71

  Garcia, Flavio D ^a   Hasuo, Ichiro ^a   Pieters, Wolter ^a   Van Rossum, Peter ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Anonymity; Crowds; Cryptography; Epistemic Logic; Formal Methods; Knowledge; Onion Routing; Privacy; Unlinkability

Indexed keywords

DATA PRIVACY; ERROR ANALYSIS; FORMAL LOGIC; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY;

ANONYMITY; CROWDS; FORMAL METHODS; ONION ROUTING; UNLINKABILITY;

INFORMATION RETRIEVAL;

EID: 31844437820     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1103576.1103585     Document Type: Conference Paper

References (18)

1. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
2. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Number 53 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2001.
3. D. L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
4. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet; A distributed anonymous information storage and retrieval system. In Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, pages 46-66, July 2000.
5. G. Oanezis, R. Dingledine, and N. Mathewson. Mixminion: Design of a type III anonymous remailer protocol. In Proceedings of the 2008 IEEE Symposium on Security and Privacy, pages 2-15, May 2003.
6. R. Dingledine, N. Mathewson, and P. Syverson. Tor: The second-generation onion router. In Proceedings of the 19th USENIX Security Symposium, pages 303-320, Aug. 2004.
7. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
8. R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning About Knowledge. MIT Press, Cambridge, MA, 1995.
9. D. M. Goldschlag, M. G. Reed, and P. F. Syverson. Hiding Routing Information. In R. Anderson, editor, Proceedings of Information Hiding: First International Workshop, volume 1174 of Lecture Notes in Computer Science, pages 137-150. Springer-Verlag, May 1996.
10. J. Guttman. Key compromise, strand spaces, and the authentication tests. In Mathematical Foundations of Programming Semantics 17, volume 47 of Electronic Notes in Theoretical Computer Science, pages 1-21. Elsevier, Amsterdam, 2001.
11. J. Halpern and K. O'Neill. Anonymity and information hiding in multiagent systems. In 16th IEEE Computer Security Foundations Workshop (CSFW '03), pages 75-88, 2003.
12. B. Jacobs. Semantics and logic for security protocols. Preprint, 2004.
13. S. Mauw, J. Verschuren, and E. de Vink. A formalization of anonymity and onion routing. In Esorics 2004, volume 3193 of Lecture Notes in Computer Science, pages 109-124, Sophia Antipolis, 2004.
14. L. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998.
15. A. Pfitzmann and M. Köhntopp. Anonymity, unobservability, and pseudonymity: A consolidated proposal for terminology. Draft, version 0.22, July 2000.
16. M. Reiter and A. Rubin. Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security, 1(1):66-92, 1998.
17. A. Serjantov. On the Anonymity of Anonymity Systems. PhD thesis, University of Cambridge, Mar. 2004.
18. V. Shmatikov. Probabilistic model checking of an anonymity system. Journal of Computer Security, 12(3):355-377, 2004.