EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

Obtaining Information Leakage Bounds via Approximate Model Counting

Seemanta Saha, Surendra Ghentiyala, Shihua Lu, Lucas Bang, Tevfik Bultan

Proceedings of the ACM on Programming Languages · 06.06.2023 · 7 (PLDI) · 1488-1509

DOI: 10.1145/3591281 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Programming Languages, online erschienen am 06.06.2023. Verfasst von Seemanta Saha und 4 weiteren Autor:innen. Die Arbeit wurde bisher 14-mal zitiert (Crossref) und nennt 37 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: NSF.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Information leaks are a significant problem in modern software systems. In recent years, information theoretic concepts, such as Shannon entropy, have been applied to quantifying information leaks in programs. One recent approach is to use symbolic execution together with model counting constraints solvers in order to quantify information leakage. There are at least two reasons for unsoundness in quantifying information leakage using this approach: 1) Symbolic execution may not be able to explore all execution paths, 2) Model counting constraints solvers may not be able to provide an exact count. We present a sound symbolic quantitative information flow analysis that bounds the information leakage both for the cases where the program behavior is not fully explored and the model counting constraint solver is unable to provide a precise model count but provides an upper and a lower bound. We implemented our approach as an extension to KLEE for computing sound bounds for information leakage in C programs.

Förderung

  • NSF

Zitieren

APA

Saha, S., Ghentiyala, S., Lu, S., Bang, L., & Bultan, T. (2023). Obtaining Information Leakage Bounds via Approximate Model Counting. Proceedings of the ACM on Programming Languages, 7(PLDI), 1488-1509. https://doi.org/10.1145/3591281

Vancouver

Saha S, Ghentiyala S, Lu S, Bang L, Bultan T. Obtaining Information Leakage Bounds via Approximate Model Counting. Proceedings of the ACM on Programming Languages. 2023;7(PLDI):1488-1509. doi:10.1145/3591281

BibTeX
@article{Saha2023,
  author = {Saha, Seemanta and Ghentiyala, Surendra and Lu, Shihua and Bang, Lucas and Bultan, Tevfik},
  title = {Obtaining Information Leakage Bounds via Approximate Model Counting},
  journal = {Proceedings of the ACM on Programming Languages},
  year = {2023},
  volume = {7},
  number = {PLDI},
  pages = {1488--1509},
  doi = {10.1145/3591281}
}
Kostenlos starten →