Analyzing anonymity attacks through noisy channels
type: Item
instance of: scholarly article
title: Analyzing anonymity attacks through noisy channels
zbMATH Open document ID: 1335.94088
author: Sami Zhioua
published in: Information and Computation
publication date: 2015-09-28T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 6485811
zbMATH Keywords: anonymity protocols
zbMATH Keywords: information theory
zbMATH Keywords: information leakage
zbMATH Keywords: security analysis
MaRDI profile type: Publication
full work available at URL: j.ic.2015.08.003
OpenAlex ID: W1134720454
cites work: Q2763038
cites work: The dining cryptographers problem: Unconditional sender and recipient untraceability
cites work: Q4813520
cites work: Q4813519
cites work: Elements of Information Theory
cites work: On the Foundations of Quantitative Information Flow
cites work: Q3292859
cites work: Anonymity protocols as noisy channels
cites work: Probable innocence revisited
cites work: CONCUR 2005 – Concurrency Theory
cites work: Probabilistic and nondeterministic aspects of anonymity
cites work: Q5631860
cites work: On Choosing and Bounding Probability Metrics
cites work: Q4368722
cites work: Q5477863
cites work: A Stochastic Approximation Method
cites work: Learning algorithms for Markov decision processes with average cost
cites work: Q4315289
cites work: A New Value Iteration method for the Average Cost Dynamic Programming Problem
cites work: Quantitative notions of leakage for one-try attacks
cites work: Q2763271
cites work: On Divergences and Informations in Statistics and Information Theory
DOI: 10.1016/J.IC.2015.08.003
description: scientific article; zbMATH DE number 6485811