Compositional methods for information-hiding

C. Braun; K. Chatzikokolakis; C. Palamidessi

doi:10.1007/978-3-540-78499-9_31

Compositional methods for information-hiding

C. Braun, K. Chatzikokolakis, C. Palamidessi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

23 Citations (Scopus)

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.

Original language	English
Title of host publication	Foundations of Software Science and Computational Structures
Subtitle of host publication	11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings
Editors	R. Amadio
Place of Publication	Berlin
Publisher	Springer
Chapter	31
Pages	443-457
Number of pages	15
ISBN (Electronic)	978-3-540-78499-9
ISBN (Print)	978-3-540-78497-5
DOIs	https://doi.org/10.1007/978-3-540-78499-9_31
Publication status	Published - 2008

Publication series

Name	Lecture Notes in Computer Science (LNCS)
Volume	4962
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-540-78499-9_31

Cite this

Braun, C., Chatzikokolakis, K., & Palamidessi, C. (2008). Compositional methods for information-hiding. In R. Amadio (Ed.), Foundations of Software Science and Computational Structures: 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings (pp. 443-457). (Lecture Notes in Computer Science (LNCS); Vol. 4962). Springer. https://doi.org/10.1007/978-3-540-78499-9_31

Braun, C. ; Chatzikokolakis, K. ; Palamidessi, C. / Compositional methods for information-hiding. Foundations of Software Science and Computational Structures: 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings. editor / R. Amadio. Berlin : Springer, 2008. pp. 443-457 (Lecture Notes in Computer Science (LNCS)).

@inproceedings{42bbe79f0c2244faa708a6b6fa9dd3d5,

title = "Compositional methods for information-hiding",

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{\textquoteright}s strong anonymity result.",

author = "C. Braun and K. Chatzikokolakis and C. Palamidessi",

year = "2008",

doi = "10.1007/978-3-540-78499-9_31",

language = "English",

isbn = "978-3-540-78497-5",

series = "Lecture Notes in Computer Science (LNCS)",

publisher = "Springer",

pages = "443--457",

editor = "R. Amadio",

booktitle = "Foundations of Software Science and Computational Structures",

address = "Germany",

}

Braun, C, Chatzikokolakis, K & Palamidessi, C 2008, Compositional methods for information-hiding. in R Amadio (ed.), Foundations of Software Science and Computational Structures: 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings. Lecture Notes in Computer Science (LNCS), vol. 4962, Springer, Berlin, pp. 443-457. https://doi.org/10.1007/978-3-540-78499-9_31

Compositional methods for information-hiding. / Braun, C.; Chatzikokolakis, K.; Palamidessi, C.
Foundations of Software Science and Computational Structures: 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings. ed. / R. Amadio. Berlin: Springer, 2008. p. 443-457 (Lecture Notes in Computer Science (LNCS); Vol. 4962).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Compositional methods for information-hiding

AU - Braun, C.

AU - Chatzikokolakis, K.

AU - Palamidessi, C.

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-540-78499-9_31

DO - 10.1007/978-3-540-78499-9_31

M3 - Conference contribution

SN - 978-3-540-78497-5

T3 - Lecture Notes in Computer Science (LNCS)

SP - 443

EP - 457

BT - Foundations of Software Science and Computational Structures

A2 - Amadio, R.

PB - Springer

CY - Berlin

ER -

Braun C, Chatzikokolakis K, Palamidessi C. Compositional methods for information-hiding. In Amadio R, editor, Foundations of Software Science and Computational Structures: 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings. Berlin: Springer. 2008. p. 443-457. (Lecture Notes in Computer Science (LNCS)). doi: 10.1007/978-3-540-78499-9_31

Compositional methods for information-hiding

Abstract

Publication series

Access to Document

Fingerprint

Cite this