Anonymity Protocols as Noisy Channels

DOI10.1007/978-3-540-75336-0_18zbMath1211.94025OpenAlexW1630019606MaRDI QIDQ3608463

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)

Related Items (6)

A Monotonicity Principle for Information Theory ⋮ Evaluation of anonymity and confidentiality protocols using theorem proving ⋮ Compositional Methods for Information-Hiding ⋮ Epistemic Strategies and Games on Concurrent Processes ⋮ Quantifying information leakage in process calculi ⋮ A Bayesian Model for Event-based Trust

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Measuring the confinement of probabilistic systems
• Probable innocence revisited
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Authentication theory and hypothesis testing
• CONCUR 2005 – Concurrency Theory

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