Paper 2013/370

Leakage-Resilient Symmetric Cryptography Under Empirically Verifiable Assumptions

François-Xavier Standaert, Olivier Pereira, and Yu Yu

Abstract

Leakage-resilient cryptography aims at formally proving the security of cryptographic implementations against large classes of side-channel adversaries. One important challenge for such an approach to be relevant is to adequately connect the formal models used in the proofs with the practice of side-channel attacks. It raises the fundamental problem of finding reasonable restrictions of the leakage functions that can be empirically verified by evaluation laboratories. In this paper, we first argue that the previous ``bounded leakage" requirements used in leakage-resilient cryptography are hard to fulfill by hardware engineers. We then introduce a new, more realistic and empirically verifiable assumption of simulatable leakage, under which security proofs in the standard model can be obtained. We finally illustrate our claims by analyzing the physical security of an efficient pseudorandom generator (for which security could only be proven under a random oracle based assumption so far). These positive results come at the cost of (algorithm-level) specialization, as our new assumption is specifically defined for block ciphers. Nevertheless, since block ciphers are the main building block of many leakage-resilient cryptographic primitives, our results also open the way towards more realistic constructions and proofs for other pseudorandom objects.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. Long version of the paper to appear in the proceedings of Crypto 2013.
Keywords
leakage-resilient cryptography
Contact author(s)
fstandae @ uclouvain be
History
2013-06-12: received
Short URL
https://ia.cr/2013/370
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/370,
      author = {François-Xavier Standaert and Olivier Pereira and Yu Yu},
      title = {Leakage-Resilient Symmetric Cryptography Under Empirically Verifiable Assumptions},
      howpublished = {Cryptology ePrint Archive, Paper 2013/370},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/370}},
      url = {https://eprint.iacr.org/2013/370}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.