Skip to Main content Skip to Navigation
Conference papers

Reasoning About Distributed Secrets

Abstract : In 1977 Tore Dalenius described how partial disclosure about one secret can impact the confidentiality of other correlated secrets, and indeed this phenomenon is well-known in privacy of databases. The aim here is to study this issue in a context of programs with distributed secrets. Moreover, we do not assume that secrets never change, in fact we investigate what happens when they do: we explore how updates to some (but not all) secrets can affect confidentiality elsewhere in the system.We provide methods to compute robust upper bounds on the impact of such information leakages with respect to all distributed secrets. Finally we illustrate our results on a defence against side channels.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01658413
Contributor : Hal Ifip <>
Submitted on : Thursday, December 7, 2017 - 3:48:40 PM
Last modification on : Sunday, December 29, 2019 - 6:00:02 PM

File

446833_1_En_11_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Nicolás Bordenabe, Annabelle Mciver, Carroll Morgan, Tahiry Rabehaja. Reasoning About Distributed Secrets. 37th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2017, Neuchâtel, Switzerland. pp.156-170, ⟨10.1007/978-3-319-60225-7_11⟩. ⟨hal-01658413⟩

Share

Metrics

Record views

168

Files downloads

175