Information hiding, anonymity and privacy: A modular approach

Journal of Computer Security

Volumn 12, Issue 1 SPEC. ISS., 2004, Pages 3-36

  Hughes, Dominic ^a   Shmatikov, Vitaly ^b  

^a Stanford University   (United States)

^b SRI INTERNATIONAL   (United States)

Author keywords

Anonymity; Information hiding; Knowledge; Kripke structure; Logic; Privacy; Security; Verification

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; EQUIVALENCE CLASSES; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; RANDOM NUMBER GENERATION; SECURITY OF DATA; SET THEORY;

ANONYMITY PRIVACY; FORMAL REASONING; INFORMATION HIDING;

DATA PRIVACY;

EID: 0344875575     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/jcs-2004-12102     Document Type: Conference Paper

References (39)

1. M. Abadi, Private authentication, in: Proc. Workshop on Privacy-Enhancing Technologies (PET), 2002 (to appear).
2. M. Abadi and A. Gordon, A calculus for cryptographic protocols: the spi-calculus, Information and Computation 148(1) (1999), 1-70.
3. S. Abramsky and A. Jung, Domain theory, in: Handbook of Logic in Computer Science, Volume 3, Oxford University Press, 1994, pp. 1-168.
4. http://www.anonymizer.com.
5. M. Abadi and P. Rogaway, Reconciling two views of cryptography (the computational soundness of formal encryption), J. Cryptology 15(2) (2002), 103-127.
6. M. Boreale, R. De Nicola and R. Pugliese, Proof techniques for cryptographic processes, in: Proc. 14th IEEE Symposium on Logic in Computer Science (LICS), 1999, pp. 157-166.
7. D. Cooper and K. Birman, Preserving privacy in a network of mobile computers, in: Proc. IEEE Symposium on Security and Privacy, 1995, pp. 26-38.
8. D. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM 24(2) (1981), 84-88.
9. D. Chaum, Security without identification: transaction systems to make Big Brother obsolete, Communications of the ACM 28(10) (1985), 1030-1044.
10. D. Chaum, The Dining Cryptographers problem: unconditional sender and recipient untraceability, J. Cryptology 1 (1) (1988), 65-75.
11. L. Cottrell, Frequently asked questions about Mixmaster remailers, 1996, http://www.obscura.com/̃loki/remailer/mixmaster-faq.html.
12. I. Clarke, O. Sandberg, B. Wiley and T.W. Hong, Freenet: A distributed anonymous information storage and retrieval system, in: Proc. International Workshop on Design Issues in Anonymity and Unobservability, Volume 2009 of LNCS, Springer-Verlag, 2000, pp. 46-66.
13. W. Dai, Pipenet, Post to the cypherpunks mailing list, February 1995.
14. D. Dolev and A. Yao, On the security of public key protocols, IEEE Transactions on Information Theory 29(2) (1983), 198-208.
15. R. Fagin, J. Halpern, Y. Moses and M. Vardi, Reasoning about Knowledge, MIT Press, 1995.
16. J. Goguen and J. Meseguer, Security policy and security models, in: Proc. IEEE Symposium on Security and Privacy, 1982, pp. 11-20.
17. C. Gunter, Semantics of Programming Languages: Structures and Techniques, MIT Press, 1992.
18. I. Goldberg, D. Wagner and E. Brewer, Privacy-enhancing technologies for the Internet, in: Proc. 42nd IEEE Spring COMPCON, 1997, pp. 103-109.
19. J. Hintikka, Knowledge and Belief, Cornell University Press, 1962.
20. J. Halpern and M. Tuttle, Knowledge, probability, and adversaries, J. ACM 40(4) (1993), 917-962.
21. E. Hughes, A Cypherpunk's Manifesto, http://www.activism.net/cypherpunk/manifesto.html, 1993.
22. ISO, IS 15408, http://www.commoncriteria.org/, 1999.
23. S. Kripke, A semantic analysis of modal logic I: normal modal prepositional calculi, Zeitschrift für Matematische Logik und Grundlagen der Mathematik 9 (1963), 67-96.
24. P. Lincoln, J.C. Mitchell, M. Mitchell and A. Scedrov, Probabilistic polynomial-time equivalence and security analysis, in: Proc. World Congress on Formal Methods, Volume 1708 of LNCS, Springer-Verlag, 1999, pp. 776-793.
25. D. Malkhi, Private communication, 2001.
26. A. Pfitzmann, M. Köhntopp and A. Shostack, Anonymity?unobservability, and pseudonymity - a proposal for terminology, Manuscript (available from A. Pfitzmann), June 2001.
27. A. Pfitzmann, B. Pfitzmann and M. Waidner, ISDN-MIXes - untraceable communication with very small bandwidth overhead, in: Proc. IFIP/Sec 91, 1991, pp. 245-258.
28. A. Pfitzmann and M. Waidner, Networks without user observability, Computers and Security 6(2) (1987), 158-166.
29. M. Reiter and A. Rubin, Crowds: Anonymity for web transactions, ACM Transactions on Information and System Security 1(1) (1998), 66-92.
30. S. Schneider, Security properties and CSP, in: Proc. IEEE Symposium on Security and Privacy, 1996, pp. 174-187.
31. D.S. Scott, Continuous lattices, in: Topases, Algebraic Geometry and Logic, Lecture Note in Mathematics 274, E. Lawvere, ed., Springer-Verlag, 1972, pp. 97-136.
32. P. Syverson, D. Goldschlag and M. Reed, Anonymous connections and onion routing, in: Proc. IEEE Symposium on Security and Privacy, 1997, pp. 44-54.
33. D. Samfat, R. Molva and N. Asokan, Anonymity and untraceability in mobile networks, in: Proc. 1st Annual International Conference on Mobile Computing and Networking (MOBICOM), 1995, pp. 26-36.
34. E. Sumii and B.C. Pierce, Logical relations for encryption, in: Proc. 14th IEEE Computer Security Foundations Workshop, 2001, pp. 256-269.
35. S. Schneider and A. Sidiroupoulos, CSP and anonymity, in: Proc. 4th European Symposium on Research in Computer Security (ESORICS), Volume 1146 of LNCS, Springer-Verlag, 1996, pp. 198-218.
36. P. Samarati and L. Sweeney, Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression, Technical Report SRI-CSL-98-03, Computer Science Laboratory, SRI, 1998.
37. P. Syverson and S. Stubblebine, Group principals and the formalization of anonymity, in: Proc. World Congress on Formal Methods, Volume 1708 of LNCS, Springer-Verlag, 1999, pp. 814-833.
38. J.E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, 1977.
39. P. Syverson, G. Tsudik, M. Reed and C. Landwehr, Towards an analysis of onion routing security, in: Proc. International Workshop on Design Issues in Anonymity and Unobservability, Volume 2009 of LNCS, Springer-Verlag, 2000, pp. 96-114.