Analyzing anonymity attacks through noisy channels

DOI10.1016/j.ic.2015.08.003zbMath1335.94088OpenAlexW1134720454MaRDI QIDQ498398

Sami Zhioua

Publication date: 28 September 2015

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2015.08.003

zbMATH Keywords

information theoryinformation leakagesecurity analysisanonymity protocols

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (1)

Differential privacy in probabilistic systems

Cites Work

• Probable innocence revisited
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Anonymity protocols as noisy channels
• Learning Algorithms for Markov Decision Processes with Average Cost
• Quantitative Notions of Leakage for One-try Attacks
• On Divergences and Informations in Statistics and Information Theory
• On the Foundations of Quantitative Information Flow
• A New Value Iteration method for the Average Cost Dynamic Programming Problem
• On Choosing and Bounding Probability Metrics
• Elements of Information Theory
• A Stochastic Approximation Method
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analyzing anonymity attacks through noisy channels