Computationally sound typing for non-interference: the case of deterministic encryption

  • Authors:
  • Judicaël Courant;Cristian Ene;Yassine Lakhnech

  • Affiliations:
  • VERIMAG, University Joseph Fourier, CNRS, INPG, Gières, France;VERIMAG, University Joseph Fourier, CNRS, INPG, Gières, France;VERIMAG, University Joseph Fourier, CNRS, INPG, Gières, France

  • Venue:
  • FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Type systems for secure information flow aim to prevent a program from leaking information from variables that hold secret data to variables that hold public data. In this work we present a type system to address deterministic encryption. The intuition that encrypting a secret yields a public value, that can be stored in a public variable, is faithful for probabilistic encryption but erroneous for deterministic encryption. We prove the computational soundness of our type system in the concrete security framework.