Anonymity Protocols as Noisy Channels

DOI10.1007/978-3-540-75336-0_18zbMATH Open1211.94025OpenAlexW1630019606MaRDI QIDQ3608463FDOQ3608463

Authors: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden 

Publication date: 5 March 2009

Published in: Trustworthy Global Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75336-0_18

Recommendations

• Anonymity protocols as noisy channels
• Analyzing anonymity attacks through noisy channels
• scientific article; zbMATH DE number 2090930
• Weak probabilistic anonymity
• A Formal Treatment of Onion Routing

Mathematics Subject Classification ID

Cryptography (94A60) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Title not available (Why is that?)
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• CONCUR 2005 – Concurrency Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probable innocence revisited
• Quantified interference for a while language
• Measuring the confinement of probabilistic systems
• Authentication theory and hypothesis testing

Cited In (20)

• Title not available (Why is that?)
• Evaluation of anonymity and confidentiality protocols using theorem proving
• Epistemic Strategies and Games on Concurrent Processes
• Anonymous Networking Amidst Eavesdroppers
• Compositional Methods for Information-Hiding
• Title not available (Why is that?)
• Quantifying information leakage in process calculi
• Anonymity protocols as noisy channels
• The cost of becoming anonymous: on the participant payload in crowds
• A Bayesian model for event-based trust
• Title not available (Why is that?)
• Automatic verification of anonymity of protocols
• Breaking Anonymity by Learning a Unique Minimum Hitting Set
• Secure Pseudonymous Channels
• Relations among privacy notions
• Financial Cryptography
• Probabilistic and nondeterministic aspects of anonymity
• Probable innocence revisited
• PROPOSAL OF A SEMIFORMAL MODEL OF ANONYMOUS COMMUNICATION
• A Monotonicity Principle for Information Theory

This page was built for publication: Anonymity Protocols as Noisy Channels

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