Compositional Methods for Information-Hiding - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Compositional Methods for Information-Hiding

Résumé

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.
Fichier principal
Vignette du fichier
fossacs.pdf (153.92 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00349227 , version 1 (25-12-2008)

Identifiants

Citer

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⟩
181 Consultations
124 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More