Our technical contributions include novel abstractions to efficiently compute precise over-approximations of the possible side-channel observations for each of these adversaries. These approximations then yield upper bounds on the information that is revealed. In case studies we apply CacheAudit to binary executables of algorithms for symmetric encryption and sorting, obtaining the first formal proofs of security for implementations with countermeasures such as preloading and data-independent memory access patterns.
Category / Keywords: implementation / AES, Cache Side Channels, Program Analysis Date: received 3 May 2013 Contact author: boris koepf at imdea org Available format(s): PDF | BibTeX Citation Version: 20130508:201620 (All versions of this report) Short URL: ia.cr/2013/253