Skip to Main content Skip to Navigation
Journal articles

On the Bayes Risk in Information-Hiding Protocols

Abstract : 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 Aposteriori 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download
Contributor : Catuscia Palamidessi <>
Submitted on : Thursday, December 25, 2008 - 2:29:02 AM
Last modification on : Thursday, June 18, 2020 - 12:32:04 PM
Long-term archiving on: : Thursday, October 11, 2012 - 2:50:36 PM


Files produced by the author(s)




Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden. On the Bayes Risk in Information-Hiding Protocols. Journal of Computer Security, IOS Press, 2008, 16 (5), pp.531--571. ⟨10.3233/JCS-2008-0333⟩. ⟨inria-00349224⟩



Record views


Files downloads