International Association for Cryptologic Research (IACR)
Abstract
With the advent of the Internet of Things, lightweight devices necessitate secure and cost-efficient key storage.
Since traditional secure key storage is expensive, novel solutions have been developed based on the idea of deriving the key from noisy entropy sources.
Such sources when combined with fuzzy extractors allow cryptographically strong key derivation.
Information theoretic fuzzy extractors require large amounts of input entropy to account for entropy loss in the key extraction process.
It has been shown by Fuller \textit{et al.}~(ASIACRYPT\u2713) that the entropy loss can be reduced if the requirement is relaxed to computational security based on the hardness of the Learning with Errors problem.
Using this computational fuzzy extractor, we show how to construct a device-server authentication system providing outsider chosen perturbation security and pre-application robustness.
We present the first implementation of a \emph{lossless} computational fuzzy extractor where the entropy of the source equals the entropy of the key on a constrained device.
The implementation needs only 1.45KB of SRAM and 9.8KB of Flash memory on an 8-bit microcontroller.
Furthermore, we also show how a device-server authentication system can be constructed and efficiently implemented in our system.
We compare our implementation to existing work in terms of security, while achieving no entropy loss
