Compositional methods for information-hiding

Abstract : 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.
Type de document :
Article dans une revue
Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2016, 26 (6), pp.908-932. 〈10.1017/S0960129514000292〉
Liste complète des métadonnées

Littérature citée [38 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01006384
Contributeur : Catuscia Palamidessi <>
Soumis le : lundi 16 juin 2014 - 05:03:00
Dernière modification le : jeudi 7 février 2019 - 16:59:29
Document(s) archivé(s) le : mardi 16 septembre 2014 - 11:00:38

Fichier

journal.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Konstantinos Chatzikokolakis, Catuscia Palamidessi, Christelle Braun. Compositional methods for information-hiding. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2016, 26 (6), pp.908-932. 〈10.1017/S0960129514000292〉. 〈hal-01006384〉

Partager

Métriques

Consultations de la notice

807

Téléchargements de fichiers

242