Analyzing anonymity attacks through noisy channels

DOI10.1016/J.IC.2015.08.003MaRDI QIDQ498398zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Anonymity Protocols as Noisy Channels
• Anonymity protocols as noisy channels
• scientific article; zbMATH DE number 2090929
• scientific article; zbMATH DE number 2090930
• scientific article; zbMATH DE number 2043306

Cites work

• scientific article; zbMATH DE number 1689866 (Why is no real title available?)
• scientific article; zbMATH DE number 1690177 (Why is no real title available?)
• scientific article; zbMATH DE number 3173999 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1095138 (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?)
• scientific article; zbMATH DE number 3357742 (Why is no real title available?)
• A New Value Iteration method for the Average Cost Dynamic Programming Problem
• A Stochastic Approximation Method
• Anonymity protocols as noisy channels
• Average reward reinforcement learning: foundations, algorithms, and empirical results
• CONCUR 2005 – Concurrency Theory
• Elements of Information Theory
• Learning algorithms for Markov decision processes with average cost
• On Choosing and Bounding Probability Metrics
• On Divergences and Informations in Statistics and Information Theory
• On the Foundations of Quantitative Information Flow
• Probabilistic and nondeterministic aspects of anonymity
• Probable innocence revisited
• Quantitative notions of leakage for one-try attacks
• The dining cryptographers problem: Unconditional sender and recipient untraceability

Cited in

(11)

• scientific article; zbMATH DE number 1952747 (Why is no real title available?)
• Evaluation of anonymity and confidentiality protocols using theorem proving
• scientific article; zbMATH DE number 2090929 (Why is no real title available?)
• Breaking Anonymity by Learning a Unique Minimum Hitting Set
• scientific article; zbMATH DE number 2043306 (Why is no real title available?)
• scientific article; zbMATH DE number 2090930 (Why is no real title available?)
• Anonymity Protocols as Noisy Channels
• Trust in anonymity networks
• Anonymity protocols as noisy channels
• Differential privacy in probabilistic systems
• Anonymous Networking Amidst Eavesdroppers

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

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