The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Elements of information theory
Elements of information theory
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Covert channels and anonymizing networks
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
PRISM 2.0: A Tool for Probabilistic Model Checking
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
CONCUR 2005 - Concurrency Theory
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Measuring the confinement of probabilistic systems
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Theoretical Computer Science - Automated reasoning for security protocol analysis
Probability of Error in Information-Hiding Protocols
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Probabilistic analysis of an anonymity system
Journal of Computer Security - Special issue on CSFW15
Journal of Computer Security - Special issue on WITS'02
Anonymity protocols as noisy channels
Information and Computation
Quantified Interference for a While Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Measuring anonymity with relative entropy
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Authentication theory and hypothesis testing
IEEE Transactions on Information Theory
Quantitative Notions of Leakage for One-try Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic and nondeterministic aspects of anonymity
Theoretical Computer Science
The optimum leakage principle for analyzing multi-threaded programs
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Compositionality of secure information flow
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Trust in crowds: probabilistic behaviour in anonymity protocols
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Asymptotic information leakage under one-try attacks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Quantitative information flow and applications to differential privacy
Foundations of security analysis and design VI
Quantitative information flow, with a view
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Anonymity attacks on mix systems: a formal analysis
IH'11 Proceedings of the 13th international conference on Information hiding
Probable innocence in the presence of independent knowledge
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
An information theoretic privacy and utility measure for data sanitization mechanisms
Proceedings of the second ACM conference on Data and Application Security and Privacy
Statistical measurement of information leakage
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Differential privacy: on the trade-off between utility and information leakage
FAST'11 Proceedings of the 8th international conference on Formal Aspects of Security and Trust
Worst- and average-case privacy breaches in randomization mechanisms
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Hi-index | 0.00 |
Randomized protocols for hiding private information can be regarded as noisy channels in the information-theoretic sense, and the inference of the concealed information can be regarded as a hypothesis-testing problem. We consider the Bayesian approach to the problem, and investigate the probability of error associated to the MAP (maximum a posteriori probability) inference rule. Our main result is a constructive characterization of a convex base of the probability of error, which allows us to compute its maximum value (over all possible input distributions), and to identify upper bounds for it in terms of simple functions. As a side result, we are able to improve the Hellman-Raviv and the Santhi-Vardy bounds expressed in terms of conditional entropy. We then discuss an application of our methodology to the Crowds protocol, and in particular we show how to compute the bounds on the probability that an adversary break anonymity.