Filters








34 Hits in 6.9 sec

Low-Overhead Implementation of a Soft Decision Helper Data Algorithm for SRAM PUFs [chapter]

Roel Maes, Pim Tuyls, Ingrid Verbauwhede
2009 Lecture Notes in Computer Science  
Introduction •H Regular error-correcting algorithms assume fixed bit error probability for every bit • Additional reliability information of every response bit is available -enables Soft-Decision error  ...  • Efficient Soft-Decision Decoder reduces minentropy loss of HDA → smaller PUF (-58.4%) • Using FPGA-optimized shift registers significantly reduces implementation cost of Universal Hash → smaller HDA  ... 
doi:10.1007/978-3-642-04138-9_24 fatcat:zww2bstq3vfwvhcnoi3cd5cgoq

Design dependent SRAM PUF robustness analysis

Mafalda Cortez, Said Hamdioui, Ryoichi Ishihara
2015 2015 16th Latin-American Test Symposium (LATS)  
PUF-based Key Generation and Storage fuzzy extractor PUF Reference Response Key Key PUF Response Key B. SRAM PUF  ...  × Physical Unclonable Functions uniqueness repeatability ngerprint non-volatile memory error-correcting code • • A.  ...  of a Soft Decision Helper Data Algorithm for SRAM PUFs Physical Unclonable Functions and Public-key Crypto for FPGA IP Protection FPGA Intrinsic PUFs and Their Use for IP Protection An Alternative  ... 
doi:10.1109/latw.2015.7102498 dblp:conf/latw/CortezHI15 fatcat:2aooaijdg5cinja6ulhzonnr4u

A soft decision helper data algorithm for SRAM PUFs

Roel Maes, Pim Tuyls, Ingrid Verbauwhede
2009 2009 IEEE International Symposium on Information Theory  
In this paper we propose the idea of using soft decision information in helper data algorithms (HDA).  ...  This significantly improves the implementation overhead of using an SRAM PUF + HDA for key generation compared to previous constructions.  ...  ACKNOWLEDGMENT This work was supported by the IAP Program P6/26 BCRYPT of the Belgian State (Belgian Science Policy) and by K.U.Leuven-BOF funding (OT/06/04).  ... 
doi:10.1109/isit.2009.5205263 dblp:conf/isit/MaesTV09 fatcat:jlecfyegjjfcppv7qo7kemo5p4

Lightweight (Reverse) Fuzzy Extractor With Multiple Reference PUF Responses

Yansong Gao, Yang Su, Lei Xu, Damith C. Ranasinghe
2019 IEEE Transactions on Information Forensics and Security  
identification devices, where realistic PUF data is collected from the embedded intrinsic SRAM PUFs.  ...  Overall, MRR greatly reduces the demand for the expected number of erroneous bits for correction and, subsequently, achieve a significant reduction in the error correction overhead.  ...  In general, we believe the MRR approach used with a soft-decision decoding strategy can further reduce implementation overhead.  ... 
doi:10.1109/tifs.2018.2886624 fatcat:k4fiob4ipvhrlggua4eetzigx4

A non-volatile memory based physically unclonable function without helper data

Wenjie Che, Jim Plusquellic, Swarup Bhunia
2014 2014 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)  
Unfortunately, helper data adds time and area overhead to the PUF system and provides opportunities for adversaries to reverse engineer the secret bitstring.  ...  In this paper, we propose a non-volatile memorybased (NVM) PUF that is able to avoid bit flips without requiring any type of helper data.  ...  In this paper, we propose a NVM-based PUF implementation that does not require helper data for regeneration.  ... 
doi:10.1109/iccad.2014.7001345 dblp:conf/iccad/ChePB14 fatcat:j2tvzxf75ffpbpbyaus6rtpm2i

Helper Data Masking for Physically Unclonable Function-based Key Generation Algorithms

Amir Ali Pour, Fatemeh Afghah, David Hely, Vincent Beroulle, Giorgio Di Natale, Ashwija Reddy Korenda, Bertrand Cambou
2022 IEEE Access  
In this work, we propose to protect helper data via a PUF-based masking mechanism with variable positioning.  ...  Our experimental results show that for 256-bit helper data, a 16-bit mask value can increase the guessing entropy by 5 folds against a Reed Muller majority logic vote decoder.  ...  Some of the functions implemented as part of our SRAM-PUF include a function for reading the real time PUF response after refreshing the SRAM every 2 seconds, and a function for enrolling the PUF, where  ... 
doi:10.1109/access.2022.3165284 fatcat:ra2f6xj6ezaq7njieldwt2zw6i

Systematic Correlation and Cell Neighborhood Analysis of SRAM PUF for Robust and Unique Key Generation

M. Tauhidur Rahman, Alison Hosey, Zimu Guo, Jackson Carroll, Domenic Forte, Mark Tehranipoor
2017 Journal of Hardware and Systems Security  
, and low temperature for NICSA.  ...  A current challenge in SRAM PUFs is their sensitivity to temperature and voltage variations as well as aging.  ...  The on-board SRAM provided a proper environment for the implementation of SRAM PUF, with the FPGA reading the SRAM and sending the data to a computer to be recorded.  ... 
doi:10.1007/s41635-017-0012-3 dblp:journals/jhss/RahmanHGCFT17 fatcat:2lybwctwz5aiblcvdvjegmjply

Review of error correction for PUFs and evaluation on state-of-the-art FPGAs

Matthias Hiller, Ludwig Kürzinger, Georg Sigl
2020 Journal of Cryptographic Engineering  
This work compares the performance of several previous designs on an algorithmic level concerning the required number of PUF response bits, helper data bits, number of clock cycles, and FPGA slices for  ...  In addition, we provide a wide span of new implementation results on state-of-the-art Xilinx FPGAs and set them in context to old synthesis results on legacy FPGAs.  ...  , and the anonymous reviewers for the several rounds of detailed and constructive feedback.  ... 
doi:10.1007/s13389-020-00223-w fatcat:oh2ce3ugrvfozg4y6qkj3xhkhu

Helper Data Algorithms for PUF-Based Key Generation: Overview and Analysis

Jeroen Delvaux, Dawu Gu, Dries Schellekens, Ingrid Verbauwhede
2015 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
However, post-processing by helper data algorithms is indispensable to meet the stringent key requirements: reproducibility, high-entropy and control. The novelty of our work is threefold.  ...  Second, our analysis does expose new threats regarding helper data leakage and manipulation. Third, we identify several hiatuses in current research.  ...  Soft-decision Soft-decision decoding, in the context of PUFs, has been introduced conceptually in [24] , with a subsequent implementation in [25] .  ... 
doi:10.1109/tcad.2014.2370531 fatcat:jdfurc2vkngfnfbgd67jgtfg4m

TREVERSE: Trial-and-Error Lightweight Secure Reverse Authentication with Simulatable PUFs [article]

Yansong Gao, Marten van Dijk, Lei Xu, Wei Yang, Surya Nepal, Damith C. Ranasinghe
2020 arXiv   pre-print
Although PUFs provide the potential for lightweight and secure authentication for increasing numbers of low-end Internet of Things devices, practical and secure mechanisms remain elusive.  ...  Given a challenge, a securely stored SimPUF in possession of a trusted server computes the corresponding response and its bit-specific reliability.  ...  The number of measurements is in the order of 10 to 100 [25] , [41] that has been shown to be applicable to the soft-decision based error correction.  ... 
arXiv:1807.11046v2 fatcat:xwwfmqwihjeqtl4dgbkgeofrkm

Reliable and efficient PUF-based key generation using pattern matching

Z. Paral, S. Devadas
2011 2011 IEEE International Symposium on Hardware-Oriented Security and Trust  
The method reveals only relatively short PUF output data in public store, thwarting opportunities for modeling attacks.  ...  The key is assembled from a series of small (initially chosen or random), secret integers, each being an index into a string of bits produced by the PUF circuit(s); a PUF unique pattern at each respective  ...  Because of this extra information which indicates the reliability of each input data point, soft-decision coding yields a higher coding gain than their hard-decision counterparts.  ... 
doi:10.1109/hst.2011.5955010 dblp:conf/host/ParalD11 fatcat:pi7zbnomkrenzbw27pmw2773xm

An Alternative to Error Correction for SRAM-Like PUFs [chapter]

Maximilian Hofer, Christoph Boehm
2010 Lecture Notes in Computer Science  
To verify the concept, a statistical view to this approach is given. Furthermore, an SRAM-like PUF implementation is suggested that puts the approach into practice.  ...  The concept is based on the influence of the mismatch on the stability of the PUF-cells' output.  ...  Maes, R., Tuyls, P., Verbauwhede, I.: Low-Overhead Implementation of a Soft Decision Helper Data Algorithm for SRAM PUFs. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 332-347.  ... 
doi:10.1007/978-3-642-15031-9_23 fatcat:d7drlxnhmbeypbch7kxfxesele

Physical Unclonable Functions and Applications: A Tutorial

Charles Herder, Meng-Day Yu, Farinaz Koushanfar, Srinivas Devadas
2014 Proceedings of the IEEE  
| This paper describes the use of physical unclonable functions (PUFs) in low-cost authentication and key generation applications.  ...  It describes strong PUF implementations and their use for lowcost authentication. After this description, the paper covers both attacks and protocols to address errors.  ...  Maes et al. describe a low-overhead approach to implementing a soft-decision helper algorithm [18] .  ... 
doi:10.1109/jproc.2014.2320516 fatcat:5vlcesm54fhxjparjkhhu5dn6a

Correlation-Based Robust Authentication (Cobra) Using Helper Data Only

Jim Plusquellic, Matt Areno
2018 Cryptography  
The server constructs Helper Data bitstrings using enrollment data that it stores for all valid chips in a secure database and computes correlation coefficients (CCs) between the chip's Helper Data bitstring  ...  Instead, the chip transmits a Helper Data bitstring to the server and this information is used for authentication instead.  ...  For example, the RO PUF typically selects a pair of ROs and then computes a difference by subtracting the soft data associated with the two ROs.  ... 
doi:10.3390/cryptography2030021 fatcat:malxu4d5qjeqrfbwr5a2dwiaba

PUFKY: A Fully Functional PUF-Based Cryptographic Key Generator [chapter]

Roel Maes, Anthony Van Herrewege, Ingrid Verbauwhede
2012 Lecture Notes in Computer Science  
This first complete implementation of a PUF-based key generator, including a PUF, a BCH decoder and a cryptographic entropy accumulator, utilizes merely 17% (1162 slices) of the available resources on  ...  The design's modularity allows for rapid and scalable adaptations for other PUF implementations or for alternative key requirements.  ...  The repetition block generates 36 bits of helper data for every 42-bit PUF response and outputs 6 bits to the BCH block.  ... 
doi:10.1007/978-3-642-33027-8_18 fatcat:lrgvs3nm2jeojaiysgofmgebpu
« Previous Showing results 1 — 15 out of 34 results