Computing the leakage of information-hiding systems

Miguel E. Andrés; Catuscia Palamidessi; Peter Van Rossum; Geoffrey Smith

doi:10.1007/978-3-642-12002-2_32

Computing the leakage of information-hiding systems

Miguel E. Andrés
, Catuscia Palamidessi
, Peter Van Rossum
, Geoffrey Smith

Institute for Computing and Information Sciences
Florida International University

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

Abstract

We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the other based on techniques from quantitative counterexample generation. The second approach can be used either for exact or approximate computation, and provides feedback for debugging. These methods can be applied also in the case in which the input distribution is unknown. We then consider the interactive case and we point out that the definition of associated channel proposed in literature is not sound. We show however that the leakage can still be defined consistently, and that our methods extend smoothly.

Original language	English
Title of host publication	Tools and Algorithms for the Construction and Analysis of Systems - 16th Int. Conf., TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Proc.
Editors	Javier Esparza, Rupak Majumdar
Publisher	Springer Verlag
Pages	373-389
Number of pages	17
ISBN (Print)	3642120016, 9783642120015
DOIs	https://doi.org/10.1007/978-3-642-12002-2_32
Publication status	Published - 1 Jan 2010
Event	16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010 - Paphos, Cyprus Duration: 20 Mar 2010 → 28 Mar 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6015 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010
Country/Territory	Cyprus
City	Paphos
Period	20/03/10 → 28/03/10

Access to Document

10.1007/978-3-642-12002-2_32

Cite this

Andrés, M. E., Palamidessi, C., Van Rossum, P., & Smith, G. (2010). Computing the leakage of information-hiding systems. In J. Esparza, & R. Majumdar (Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 16th Int. Conf., TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Proc. (pp. 373-389). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6015 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-12002-2_32

Andrés, Miguel E. ; Palamidessi, Catuscia ; Van Rossum, Peter et al. / Computing the leakage of information-hiding systems. Tools and Algorithms for the Construction and Analysis of Systems - 16th Int. Conf., TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Proc.. editor / Javier Esparza ; Rupak Majumdar. Springer Verlag, 2010. pp. 373-389 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0aed7554ed204e159a81546988a6ac12,

title = "Computing the leakage of information-hiding systems",

abstract = "We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the other based on techniques from quantitative counterexample generation. The second approach can be used either for exact or approximate computation, and provides feedback for debugging. These methods can be applied also in the case in which the input distribution is unknown. We then consider the interactive case and we point out that the definition of associated channel proposed in literature is not sound. We show however that the leakage can still be defined consistently, and that our methods extend smoothly.",

author = "Andr{\'e}s, \{Miguel E.\} and Catuscia Palamidessi and \{Van Rossum\}, Peter and Geoffrey Smith",

year = "2010",

month = jan,

day = "1",

doi = "10.1007/978-3-642-12002-2\_32",

language = "English",

isbn = "3642120016",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "373--389",

editor = "Javier Esparza and Rupak Majumdar",

booktitle = "Tools and Algorithms for the Construction and Analysis of Systems - 16th Int. Conf., TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Proc.",

note = "16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010 ; Conference date: 20-03-2010 Through 28-03-2010",

}

Andrés, ME, Palamidessi, C, Van Rossum, P & Smith, G 2010, Computing the leakage of information-hiding systems. in J Esparza & R Majumdar (eds), Tools and Algorithms for the Construction and Analysis of Systems - 16th Int. Conf., TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Proc.. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6015 LNCS, Springer Verlag, pp. 373-389, 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, 20/03/10. https://doi.org/10.1007/978-3-642-12002-2_32

Computing the leakage of information-hiding systems. / Andrés, Miguel E.; Palamidessi, Catuscia; Van Rossum, Peter et al.
Tools and Algorithms for the Construction and Analysis of Systems - 16th Int. Conf., TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Proc.. ed. / Javier Esparza; Rupak Majumdar. Springer Verlag, 2010. p. 373-389 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6015 LNCS).

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

TY - GEN

T1 - Computing the leakage of information-hiding systems

AU - Andrés, Miguel E.

AU - Palamidessi, Catuscia

AU - Van Rossum, Peter

AU - Smith, Geoffrey

PY - 2010/1/1

Y1 - 2010/1/1

N2 - We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the other based on techniques from quantitative counterexample generation. The second approach can be used either for exact or approximate computation, and provides feedback for debugging. These methods can be applied also in the case in which the input distribution is unknown. We then consider the interactive case and we point out that the definition of associated channel proposed in literature is not sound. We show however that the leakage can still be defined consistently, and that our methods extend smoothly.

AB - We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the other based on techniques from quantitative counterexample generation. The second approach can be used either for exact or approximate computation, and provides feedback for debugging. These methods can be applied also in the case in which the input distribution is unknown. We then consider the interactive case and we point out that the definition of associated channel proposed in literature is not sound. We show however that the leakage can still be defined consistently, and that our methods extend smoothly.

UR - https://www.scopus.com/pages/publications/77951595720

U2 - 10.1007/978-3-642-12002-2_32

DO - 10.1007/978-3-642-12002-2_32

M3 - Conference contribution

AN - SCOPUS:77951595720

SN - 3642120016

SN - 9783642120015

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 373

EP - 389

BT - Tools and Algorithms for the Construction and Analysis of Systems - 16th Int. Conf., TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Proc.

A2 - Esparza, Javier

A2 - Majumdar, Rupak

PB - Springer Verlag

T2 - 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010

Y2 - 20 March 2010 through 28 March 2010

ER -

Andrés ME, Palamidessi C, Van Rossum P, Smith G. Computing the leakage of information-hiding systems. In Esparza J, Majumdar R, editors, Tools and Algorithms for the Construction and Analysis of Systems - 16th Int. Conf., TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Proc.. Springer Verlag. 2010. p. 373-389. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-12002-2_32

Computing the leakage of information-hiding systems

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this