Limits of anonymity in open environments

DOI10.1007/3-540-36415-3_4MaRDI QIDQ4414180zbMATH OpenFDO

Authors Dogan Kedogan, Dakshi Agrawal, Stefan Penz

Publication date 23 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2578/25780053.htm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computing methodologies and applications (68U99)

Recommendations

• Towards an information theoretic metric for anonymity
• Towards measuring anonymity
• From a trickle to a flood: Active attacks on several mix types
• The disadvantages of free MIX routes and how to overcome them
• Analyzing anonymity attacks through noisy channels

Cited in

(14)

• Anonymity and individual risk
• Collaborative deanonymization
• The disadvantages of free MIX routes and how to overcome them
• Protection profiles for remailer mixes
• Breaking Anonymity by Learning a Unique Minimum Hitting Set
• From a trickle to a flood: Active attacks on several mix types
• scientific article; zbMATH DE number 1542823 (Why is no real title available?)
• Real world patterns of failure in anonymity systems
• Towards an information theoretic metric for anonymity
• Towards measuring anonymity
• Dummy traffic against long term intersection attacks
• Distributed Computing
• Privacy in Non-private Environments
• Identity-based mix: Anonymous communications without public key certificates

This page was built for publication: Limits of anonymity in open environments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414180)