Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions

被引:0
作者
Armknecht, Frederik [1 ]
Maes, Roel [2 ]
Sadeghi, Ahmad-Reza [1 ]
Sunar, Berk [3 ]
Tuyls, Pim [2 ,4 ]
机构
[1] Ruhr Univ Bochum, Horst Gortz Inst IT Secur, Bochum, Germany
[2] Katholieke Univ Leuven, ESAT COSIC & IBBT, Leuven, Belgium
[3] Cryptog & Informat Secur, WPI, Boston, MA USA
[4] Intrins ID, Eindhoven, Netherlands
来源
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2009 | 2009年 / 5912卷
基金
美国国家科学基金会;
关键词
COMPUTATION; HARDWARE; SECURE; BITS; KEYS;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Physical attacks on cryptographic implementations and devices have become crucial. In this context; a recent line of research on a new class of side-channel attacks; called memory attacks, has received increasingly more attention. These attacks allow an adversary to measure a significant fraction of secret key bits directly from memory, independent of any computational side-channels. Physically Unclonable Functions (PUFs) represent a. promising new technology that allows to store secrets in a tamper-evident and unclonable manner. PUFs enjoy their security from physical structures at sub-micron level and are very useful primitives to protect; against memory attacks. In this paper we aim at making the first step towards combining and binding algorithmic properties of cryptographic schemes with physical structure of the underlying hardware by means of PUFs. We introduce a new cryptographic primitive based on PUFs, which we call PUF-PRFs. These primitives can be used as a. source of randomness like pseudorandom functions (PRFs). We construct; a block cipher based on PUF-PRFs that allows simultaneous protection against algorithmic and physical attackers, in particular against memory attacks. While PUF-PRFs in general differ in some aspects from traditional PRFs, we show a concrete instantiation based on established SRAM technology that closes these gaps.
引用
收藏
页码:685 / +
页数:5
相关论文
共 48 条
[1]  
Agrawal D, 2002, LECT NOTES COMPUT SC, V2523, P29
[2]  
Akavik A, 2009, LECT NOTES COMPUT SC, V5444, P474
[3]   Science and the savage: The Linnean Society of New South Wales, 1874 -1900 [J].
Anderson, K .
ECUMENE, 1998, 5 (02) :125-143
[4]  
[Anonymous], LNCS
[5]  
[Anonymous], 1998, J UNIVERS COMPUT SCI
[6]  
[Anonymous], 1985, LNCS, DOI DOI 10.1007/3-540-39568-722
[7]  
[Anonymous], 1996, CRYPTO, DOI DOI 10.1007/3-540-68697-5_9
[8]  
Bellare M, 2000, LECT NOTES COMPUT SC, V1807, P139
[9]   A concrete security treatment of symmetric encryption [J].
Bellare, M ;
Desai, A ;
Jokipii, E ;
Rogaway, P .
38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, :394-403
[10]  
Bellare M., 1995, Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, P57, DOI 10.1145/225058.225084