HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Compositional Methods for Information-Hiding

Christelle Braun 1 Konstantinos Chatzikokolakis 1 Catuscia Palamidessi 1
1 COMETE - Concurrency, Mobility and Transactions
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : Protocols for information-hiding often use randomized primitives to obfuscate the link between the observables and the information to be protected. The degree of protection provided by a protocol can be expressed in terms of the probability of error associated to the inference of the secret information. We consider a probabilistic process calculus approach to the specification of such protocols, and we study how the operators affect the probability of error. In particular, we characterize constructs that have the property of not decreasing the degree of protection, and that can therefore be considered safe in the modular construction of protocols. As a case study, we apply these techniques to the Dining Cryptographers, and we are able to derive a generalization of Chaum's strong anonymity result.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

Contributor : Catuscia Palamidessi Connect in order to contact the contributor
Submitted on : Thursday, December 25, 2008 - 4:25:26 AM
Last modification on : Thursday, January 20, 2022 - 4:12:42 PM
Long-term archiving on: : Tuesday, June 8, 2010 - 6:13:25 PM


Files produced by the author(s)




Christelle Braun, Konstantinos Chatzikokolakis, Catuscia Palamidessi. Compositional Methods for Information-Hiding. Foundations of Software Science and Computation Structures (FOSSACS), 2008, Budapest, Hungary. ⟨10.1007/978-3-540-78499-9_31⟩. ⟨inria-00349227⟩



Record views


Files downloads