Anonymity protocols as noisy channels

DOI10.1016/j.ic.2007.07.003zbMath1147.68394OpenAlexW2056277260MaRDI QIDQ2482451

Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden

Publication date: 16 April 2008

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

Full work available at URL: https://hal.inria.fr/inria-00349225/file/full.pdf

zbMATH Keywords

model checking

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items (29)

Quantifying leakage in the presence of unreliable sources of information ⋮ Probabilistic and nondeterministic aspects of anonymity ⋮ Automation of Quantitative Information-Flow Analysis ⋮ Min-entropy as a resource ⋮ Thermodynamic aspects of confidentiality ⋮ Hybrid statistical estimation of mutual information and its application to information flow ⋮ An axiomatization of information flow measures ⋮ Searching secrets rationally ⋮ Unnamed Item ⋮ Squeeziness: an information theoretic measure for avoiding fault masking ⋮ Compositional methods for information-hiding ⋮ Maximizing entropy over Markov processes ⋮ Quantifying Vulnerability of Secret Generation Using Hyper-Distributions ⋮ Analyzing anonymity attacks through noisy channels ⋮ Conditional anonymity with non-probabilistic adversary ⋮ Information Theory and Security: Quantitative Information Flow ⋮ Generalized Differential Privacy: Regions of Priors That Admit Robust Optimal Mechanisms ⋮ Quantification of integrity ⋮ A semiring-based trace semantics for processes with applications to information leakage analysis ⋮ Asymptotic information leakage under one-try attacks ⋮ Quantifying opacity ⋮ Algebraic foundations for quantitative information flow ⋮ Information hiding in probabilistic concurrent systems ⋮ On the Foundations of Quantitative Information Flow ⋮ Quantitative Notions of Leakage for One-try Attacks ⋮ Worst- and average-case privacy breaches in randomization mechanisms ⋮ Quantifying information leakage of randomized protocols ⋮ Quantitative Information Flow and Applications to Differential Privacy ⋮ Quantifying information leakage in process calculi

Uses Software

• PRISM

Cites Work

• Unnamed Item
• 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
• Weak Probabilistic Anonymity
• Authentication theory and hypothesis testing
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
• CSP and anonymity
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Anonymity protocols as noisy channels