International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

A Provably Secure And Efficient Countermeasure Against Timing Attacks

Authors:
Boris Köpf
Markus Dürmuth
Download:
URL: http://eprint.iacr.org/2009/089
Search ePrint
Search Google
Abstract: We show that the expected number of key bits that an unknown-message attacker can extract from a deterministic side-channel is bounded from above by |O| log_2 (n+1), where n is the number of side-channel measurements and O is the set of possible observations. We use this bound to derive a novel countermeasure against timing attacks, where the strength of the security guarantee can be freely traded for the resulting performance penalty. We give algorithms that efficiently and optimally adjust this trade-off for given constraints on the side-channel leakage or on the efficiency of the cryptosystem. Finally, we perform a case-study that shows that applying our countermeasure leads to implementations with minor performance overhead and strong security guarantees.
BibTeX
@misc{eprint-2009-18266,
  title={A Provably Secure And Efficient Countermeasure Against Timing Attacks},
  booktitle={IACR Eprint archive},
  keywords={applications / Side-Channel Attacks, Implementation, Information theory},
  url={http://eprint.iacr.org/2009/089},
  note={ bkoepf@mpi-sws.mpg.de 14295 received 20 Feb 2009},
  author={Boris Köpf and Markus Dürmuth},
  year=2009
}