How to Generate Robust Keys from Noisy DRAMs?

被引:1
|
作者
Karimian, Nima [1 ]
Tehranipoor, Fatemeh [1 ]
机构
[1] San Francisco State Univ, San Francisco, CA 94132 USA
关键词
DRAM PUF; Quantization; Noise;
D O I
10.1145/3299874.3319494
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Security primitives based on Dynamic Random Access Memory (DRAM) can provide cost-efficient and practical security solutions, especially for resource-constrained devices, such as hardware used in the Internet of Things (IoT), as DRAMs are an intrinsic part of most contemporary computer systems [1]. Over the past few years, DRAM-based physical unclonable functions became very popular among researchers in this field. However, similar to other types of PUFs, DRAM PUF reliability for authentication and key generation is highly dependent on its resistance against the environmental noises such as Temperature variation, Voltage variations, and Device aging. This paper addresses the challenges related to the reliability and robustness of DRAM PUFs under noisy environments. In this paper we apply a new approach (Quantization) that extracts keys from DRAM startup values with a high reliability and stability rate. This quantization technique identifies suitable features from power-up values of DRAM memories and quantize them into binary bits using tunable parameters that control and predict the environmental noises. Our experimental result shows a high reliability and min-entropy rate for relatively large number of DRAM key bits.
引用
收藏
页码:465 / 469
页数:5
相关论文
共 50 条
  • [1] Fuzzy extractors: How to generate strong keys from biometrics and other noisy data
    Dodis, Yevgeniy
    Ostrovsky, Rafail
    Reyzin, Leonid
    Smith, Adam
    SIAM JOURNAL ON COMPUTING, 2008, 38 (01) : 97 - 139
  • [2] Fuzzy extractors: How to generate strong keys from biometrics and other noisy data
    Dodis, Y
    Reyzin, L
    Smith, A
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004, PROCEEDINGS, 2004, 3027 : 523 - 540
  • [3] How to handle noisy labels for robust learning from uncertainty
    Ji, Daehyun
    Oh, Dokwan
    Hyun, Yoonsuk
    Kwon, Oh-Min
    Park, Myeong-Jin
    NEURAL NETWORKS, 2021, 143 : 209 - 217
  • [4] Communicating with noise: How chaos and noise combine to generate secure encryption keys
    Minai, AA
    Pandian, TD
    CHAOS, 1998, 8 (03) : 621 - 628
  • [5] Robust Keys from Physical Unclonable Functions
    Spain, Merrielle
    Fuller, Benjamin
    Ingols, Kyle
    Cunningham, Robert
    2014 IEEE INTERNATIONAL SYMPOSIUM ON HARDWARE-ORIENTED SECURITY AND TRUST (HOST), 2014, : 88 - 92
  • [6] Controlled Hallucinations: Learning to Generate Faithfully from Noisy Data
    Fillippova, Katja
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, EMNLP 2020, 2020, : 864 - 870
  • [7] How to Design Robust Algorithms using Noisy Comparison Oracle
    Addanki, Raghavendra
    Galhotra, Sainyam
    Saha, Barna
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2021, 14 (10): : 1703 - 1716
  • [8] Robust Graph Learning From Noisy Data
    Kang, Zhao
    Pan, Haiqi
    Hoi, Steven C. H.
    Xu, Zenglin
    IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (05) : 1833 - 1843
  • [9] ROBUST OBJECT RECONSTRUCTION FROM NOISY OBSERVATIONS
    SUNDARAMOORTHY, G
    RAGHUVEER, MR
    DIANAT, SA
    VISUAL COMMUNICATIONS AND IMAGE PROCESSING IV, PTS 1-3, 1989, 1199 : 104 - 114
  • [10] Robust Imitation Learning from Noisy Demonstrations
    Tangkaratt, Voot
    Charoenphakdee, Nontawat
    Sugiyama, Masashi
    24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130 : 298 - +