Scalable Approximation of Quantitative Information Flow in Programs

Abstract : Quantitative information flow measurement techniques have been proven to be successful in detecting leakage of confidential information from programs. Modern approaches are based on formal methods, relying on program analysis to produce a SAT formula representing the program's behavior, and model counting to measure the possible information flow. However, while program analysis scales to large codebases like the OpenSSL project, the formulas produced are too complex for analysis with precise model counting. In this paper we use the approximate model counter ApproxMC2 to quantify information flow. We show that ApproxMC2 is able to provide a large performance increase for a very small loss of precision, allowing the analysis of SAT formulas produced from complex code. We call the resulting technique ApproxFlow and test it on a large set of benchmarks against the state of the art. Finally, we show that ApproxFlow can evaluate the leakage incurred by the Heartbleed OpenSSL bug, contrarily to the state of the art.
Type de document :
Pré-publication, Document de travail
2017
Liste complète des métadonnées

Littérature citée [32 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01629131
Contributeur : Fabrizio Biondi <>
Soumis le : lundi 6 novembre 2017 - 09:57:49
Dernière modification le : jeudi 11 janvier 2018 - 06:28:15

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01629131, version 1

Citation

Fabrizio Biondi, Michael Enescu, Annelie Heuser, Axel Legay, Kuldeep Meel, et al.. Scalable Approximation of Quantitative Information Flow in Programs. 2017. 〈hal-01629131〉

Partager

Métriques

Consultations de la notice

68

Téléchargements de fichiers

83