Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quantifying the Information Leak in Cache Attacks through Symbolic Execution (1611.04426v1)

Published 14 Nov 2016 in cs.CR

Abstract: Cache timing attacks allow attackers to infer the properties of a secret execution by observing cache hits and misses. But how much information can actually leak through such attacks? For a given program, a cache model, and an input, our CHALICE framework leverages symbolic execution to compute the amount of information that can possibly leak through cache attacks. At the core of CHALICE is a novel approach to quantify information leak that can highlight critical cache side-channel leaks on arbitrary binary code. In our evaluation on real-world programs from OpenSSL and Linux GDK libraries, CHALICE effectively quantifies information leaks: For an AES-128 implementation on Linux, for instance, CHALICE finds that a cache attack can leak as much as 127 out of 128 bits of the encryption key.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Sudipta Chattopadhyay (33 papers)
  2. Moritz Beck (2 papers)
  3. Ahmed Rezine (8 papers)
  4. Andreas Zeller (29 papers)
Citations (5)

Summary

We haven't generated a summary for this paper yet.