Anti-aliasing on the web

Thirteenth International World Wide Web Conference Proceedings, WWW2004

Volumn , Issue , 2004, Pages 30-39

  Novak, Jasmine ^a   Raghavan, Prabhakar ^b   Tomkins, Andrew ^a  

^a IBM RESEARCH   (United States)

^b Verity Inc   (United States)

Author keywords

Alias detection; Aliases; Bulletin boards; Personas; Privacy; Pseudonyms

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BULLETIN BOARDS; CODES (SYMBOLS); INFORMATION THEORY; NATURAL LANGUAGE PROCESSING SYSTEMS; PATTERN RECOGNITION; PROBABILITY; STATISTICS;

ALIAS DETECTION; ALIASES; PERSONAS; PRIVACY; PSEUDONYMS;

WORLD WIDE WEB;

EID: 19944400484     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/988672.988678     Document Type: Conference Paper

References (24)

1. S. Argamon, M. Koppel, and G. Avneri. Routing documents according to style. In Proceedings of First International Workshop on Innovative Information Systems, 1998.
2. B. Brainerd. The computer in statistical studies of William Shakespeare. Computer Studies in the Humanities and Verbal Behavior, 4(1), 1973.
3. David Chaum. Untraceable electronic mail. Communications of the ACM, 24(2):84-88, February, 1981.
4. David Chaum. Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030-1044, October, 1985.
5. Olivier Y. de Vel, A. Anderson, M. Corney, and George M. Mohay. Mining email content for author identification forensics. SIGMOD Record, 30(4):55-64, 2001.
6. Joachim Diederich, Jrg Kindermann, Edda Leopold, and Gerhard Paass. Authorship attribution with support vector machines.
7. W. Frakes and R. Baeza-Yates. Information Retrieval: Data Structures and Algorithms. Prentice Hall, 1992.
8. E. Friedman and P. Resnick. The social cost of cheap pseudonyms. Journal of Economics and Management Strategy, 10(2):173-199, 2001.
9. Eran Gabber, Phillip B. Gibbons, David M. Kristol, Yossi Matias, and Alain Mayer. On secure and pseudonymous client-relationships with multiple servers. ACM Transactions on Information and System Security, 2(4):390-415, 1999.
10. I. Krsul and E. H. Spafford. Authorship analysis: Identifying the author of a program. In Proc. 18th NIST-NCSC National Information Systems Security Conference, pages 514-524, 1995.
11. Hang Li and Naoki Abe. Clustering words with the MDL principle. In COLING96, pages 4-9, 1996.
12. M. Meila. Comparing clusterings. Technical Report 418, UW Statistics Department, 2002.
13. F. Mosteller and D. Wallace. Inference and Disputed Authorship: The Federalist. Addison-Wesley, 1964.
14. Josyula R. Rao and Pankaj Rohatgi. Can pseudonymity really guarantee privacy? In Proceedings of the Ninth USENIX Security Symposium, pages 85-96. USENIX, August 2000.
15. Edie Rasmussen. Clustering Algorithms, chapter 16. Prentice Hall, 1992.
16. M. Reed and P. Syverson. Onion routing. In Proceedings of AIPA, 1999.
17. M. Reiter and A. Rubin. Anonymous web transactions with crowds. Communications of the ACM, 42(2):32-38, 1999.
18. Zero Knowledge Systems, 2000.
19. Yuta Tsuboi and Yuji Matsumoto. Authorship identification for heterogeneous documents. Master's thesis, Nara Institute of Science and Technology, 2002.
20. Ellen M. Voorhees. The effectiveness and efficiency of agglomerative hierarchic clustering in document retrieval. PhD thesis, Cornell University, 1986.
21. P. Willet. Recent trends in hierarchic document clustering: a critical review. Information Processing and Manaagement, 24(5):577-597, 1988.
22. C. Williams. Mendenhall's studies of word-length distribution in the works of Shakespeare and Bacon. Biometrika, 62:207-212, 1975.
23. G. U. Yule. Statistical Study of Literary Vocabulary. Cambridge University Press, 1944.
24. G. K. Zipf. Human Behavior and the Principle of Least Effort. Addison-Wesley, 1949.