Efficient Helper Data Key Extractor on FPGAs

321 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Lightweight and Privacy-Preserving Two-Factor Authentication Scheme for IoT Devices (2019, background): “Since repeated exposure of the helper data may result in additional min-entropy loss [17], [18], the helper data should not be exposed during the execution of the authentication protocol.”
Extended abstract: The butterfly PUF protecting IP on every FPGA (2008, methodology): “bit, we would need about 1500 Butterfly PUF cells to derive a uniformly distributed random 128-bit key with a failure rate of 10 based on the techniques described in [2].”
Physically Unclonable Functions (2012, methodology): “• A practical secure sketch applying a concatenation of a [7, 1, 3] repetition code and a [318, 174, 17] BCH code.”
PUFKY: A Fully Functional PUF-Based Cryptographic Key Generator (2012, background): “[4] demonstrated that code concatenation offers considerable advantages when used in secure sketch constructions.”
Physical unclonable functions (2020, methodology): “Most ECC decoding algorithms rely upon hard decision decoding, which treats each response bit with equally likely error probability 10,20,29 .”
Improved Ring Oscillator PUF: An FPGA-friendly Secure Primitive (2011, methodology): “Bosch et al. presented an implementation technique for the fuzzy extractor on FPGA [ 14 ].”