Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal:

Search In Journal Title:

Abbravation:

Search In Journal Abbravation:

Publisher

Springer, Cham

Search In Publisher:

DOI

10.1016/0021-9991(73)90127-7

Search In DOI:

ISSN

Search In ISSN:
Search In Title Of Papers:

Efficient SATBased Preimage Enumeration for Quan

Authors: Alexander Weigl
Publish Date: 2016/9/26
Volume: , Issue: , Pages: 51-58
PDF Link

Abstract

Quantitative Information Flow Analysis QIF measures the loss of an attacker’s uncertainty about the confidential information preimage inside a software system after observing the system outputs image In this paper we supplement the SATbased QIF analysis for deterministic and terminating C programs by introducing three algorithms for counting the preimages and images which utilizes advantages of incremental SAT solvers Our tool sharpPI is competitive to mql quail and chimp An implementation is provided under http//formalitikitedu/sharpPIA Weigl—This work was supported by the DFG German Research Foundation in Priority Programme Reliably Secure Software Systems RS3 – DFG Priority Programme 1496 Thanks to Vladimir Klebanov for feedback during the creation of this paper and Laurent Simon for a dessert in Lisbon


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


    Search Result: