Reasoning About Distributed Secrets - Formal Techniques for Distributed Objects, Components, and Systems Access content directly
Conference Papers Year : 2017

Reasoning About Distributed Secrets

Nicolás Bordenabe
  • Function : Author
  • PersonId : 1024695
Tahiry Rabehaja
  • Function : Author
  • PersonId : 1024697

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.
Fichier principal
Vignette du fichier
446833_1_En_11_Chapter.pdf (390.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01658413 , version 1 (07-12-2017)

Licence

Attribution

Identifiers

Cite

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⟩
92 View
121 Download

Altmetric

Share

Gmail Facebook X LinkedIn More