Anonymity Protocols as Noisy Channels

DOI10.1007/978-3-540-75336-0_18MaRDI QIDQ3608463zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 2090929 (Why is no real title available?)
• scientific article; zbMATH DE number 2090930 (Why is no real title available?)
• Authentication theory and hypothesis testing
• CONCUR 2005 – Concurrency Theory
• Measuring the confinement of probabilistic systems
• Probable innocence revisited
• Quantified interference for a while language
• The dining cryptographers problem: Unconditional sender and recipient untraceability

Cited in

(24)

• Probabilistic and nondeterministic aspects of anonymity
• scientific article; zbMATH DE number 1107712 (Why is no real title available?)
• Financial Cryptography
• Secure Pseudonymous Channels
• Evaluation of anonymity and confidentiality protocols using theorem proving
• Quantifying information leakage in process calculi
• Probable innocence revisited
• Breaking Anonymity by Learning a Unique Minimum Hitting Set
• scientific article; zbMATH DE number 2043306 (Why is no real title available?)
• A Bayesian model for event-based trust
• Compositional Methods for Information-Hiding
• scientific article; zbMATH DE number 2090930 (Why is no real title available?)
• Anonymity protocols as noisy channels
• PROPOSAL OF A SEMIFORMAL MODEL OF ANONYMOUS COMMUNICATION
• Weak probabilistic anonymity
• Epistemic Strategies and Games on Concurrent Processes
• Analyzing anonymity attacks through noisy channels
• CSP and anonymity
• Anonymous Networking Amidst Eavesdroppers
• Automatic verification of anonymity of protocols
• The cost of becoming anonymous: on the participant payload in crowds
• Conditional anonymity with non-probabilistic adversary
• A monotonicity principle for information theory
• Relations among privacy notions

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)