A Computationally Efficient Tensor Regression Network based Modeling Attack on XOR APUF

被引:0
作者
Santikellur, Pranesh [1 ]
Lakshya [1 ]
Prakash, Shashi Ranjan [1 ]
Chakraborty, Rajat Subhra [1 ]
机构
[1] IIT Kharagpur, SEAL, Dept Comp Sci & Engn, Kharagpur, W Bengal, India
来源
PROCEEDINGS OF THE 2019 ASIAN HARDWARE ORIENTED SECURITY AND TRUST SYMPOSIUM (ASIANHOST) | 2019年
关键词
decomposition; deep learning; modeling attacks; XOR Arbiter PUF; Tensor Regression Networks; ARBITER PUF; AUTHENTICATION;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
XOR-arbiter PUF (XOR APUF), where the outputs of multiple APUFs are XOR-ed, has proven to be robust to machine learning based modeling attacks. The reported successful modeling attacks for XOR APUF either employ auxiliary side-channel or reliability information, or require enormous computational effort. This robustness is primarily due to the difficulty in learning the unknown internal delay parameter terms in the mathematical model of a XOR APUF, and the robustness increases as the number of APUFs being XOR-ed increases. In this paper, we employ a novel machine learning based modeling technique called efficient CANDECOMP/PARAFAC-Tensor Regression Network (CP-TRN), a variant of CP-decomposition based tensor regression network, to reduce the computational resource requirement of model building attacks on XOR APUF. In addition, our proposed technique does not require any auxiliary information, and is robust to noisy training data. The proposed technique allowed us to successfully model 64-bit 8-XOR APUF and 128-bit 7-XOR APUF on a single desktop workstation, with high prediction accuracy.
引用
收藏
页数:6
相关论文
共 30 条
  • [1] Abadi M, 2016, PROCEEDINGS OF OSDI'16: 12TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, P265
  • [2] A Machine Learning-based Security Vulnerability Study on XOR PUFs for Resource-Constraint Internet of Things
    Aseeri, Ahmad O.
    Zhuang, Yu
    Alkatheiri, Mohammed Saeed
    [J]. 2018 IEEE INTERNATIONAL CONGRESS ON INTERNET OF THINGS (ICIOT), 2018, : 49 - 56
  • [3] The Gap Between Promise and Reality: On the Insecurity of XOR Arbiter PUFs
    Becker, Georg T.
    [J]. CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2015, 2015, 9293 : 535 - 555
  • [4] Brandi G., 2018, THESIS LUISS G CARLI
  • [5] Cao XW, 2018, Arxiv, DOI arXiv:1712.09520
  • [6] Why Attackers Win: On the Learnability of XOR Arbiter PUFs
    Ganji, Fatemeh
    Tajik, Shahin
    Seifert, Jean-Pierre
    [J]. TRUST AND TRUSTWORTHY COMPUTING, TRUST 2015, 2015, 9229 : 22 - 39
  • [7] Controlled Physical Random Functions
    Gassend, B
    Clarke, D
    van Dijk, M
    Devadas, S
    [J]. 18TH ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE, PROCEEDINGS, 2002, : 149 - 160
  • [8] Glorot X., 2010, PROC AISTAT, P249
  • [9] A Linear Support Higher-Order Tensor Machine for Classification
    Hao, Zhifeng
    He, Lifang
    Chen, Bingqian
    Yang, Xiaowei
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2013, 22 (07) : 2911 - 2920
  • [10] Hastad J., 1989, INT C AUTOMATA LANGU, P451