Compositional methods for information-hiding - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematical Structures in Computer Science Year : 2016

Compositional methods for information-hiding


Systems concerned with information hiding often use randomization to obfuscate the link between the observables and the information to be protected. The degree of protection provided by a system can be expressed in terms of the probability of error associated with the inference of the secret information. We consider a probabilistic process calculus to specify such systems, 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 these systems. As a case study, we apply these techniques to the Dining Cryptographers, and we derive a generalization of Chaum's strong anonymity result.
Fichier principal
Vignette du fichier
journal.pdf (290.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01006384 , version 1 (16-06-2014)



Konstantinos Chatzikokolakis, Catuscia Palamidessi, Christelle Braun. Compositional methods for information-hiding. Mathematical Structures in Computer Science, 2016, 26 (6), pp.908-932. ⟨10.1017/S0960129514000292⟩. ⟨hal-01006384⟩
378 View
211 Download



Gmail Facebook X LinkedIn More