Cryptology ePrint Archive: Report 2010/205
On Protecting Cryptographic Keys Against Continual Leakage
Ali Juma and Yevgeniy Vahlis
Abstract: Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys and computing on them in a manner that preserves security even when the adversary is able to obtain information leakage during the computation on the key.
Using the recently achieved fully homomorphic encryption, we show how to encapsulate a key and repeatedly evaluate arbitrary functions on it so that no adversary can gain any useful information from a large class of side-channel attacks. We work in the model of Micali and Reyzin, assuming that only the active part of memory during computation leaks information. Similarly to previous works, our construction makes use of a single ``leak-free'' hardware token that samples from a globally-fixed distribution that does not depend on the key.
Our construction is the first general compiler to achieve resilience against polytime leakage functions without performing any leak-free computation on the underlying secret key. Furthermore, the amount of computation our construction must perform does not grow with the amount of leakage the adversary is able to obtain; instead, it suffices to make a stronger assumption about the security of the fully homomorphic encryption.
Category / Keywords: leakage, homomorphic encryption, compiler
Date: received 13 Apr 2010
Contact author: evahlis at cs toronto edu
Available format(s): PDF | BibTeX Citation
Version: 20100419:171322 (All versions of this report)
Short URL: ia.cr/2010/205
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]