基于lwe的物联网无损计算模糊提取器

Christopher Huth, Daniela Becker, J. Guajardo, P. Duplys, T. Güneysu
{"title":"基于lwe的物联网无损计算模糊提取器","authors":"Christopher Huth, Daniela Becker, J. Guajardo, P. Duplys, T. Güneysu","doi":"10.1109/HST.2017.7951818","DOIUrl":null,"url":null,"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 et al. (ASIACRYPT'13) that the entropy loss can be reduced if the security requirement is relaxed to computational security based on the hardness of the Learning with Errors problem. We present the first implementation of a lossless computational fuzzy extractor (CFE) where the entropy of the source equals the entropy of the key. We explore efficiency and complexity design trade-offs for a system based on the implementation of a lossless CFE on a constrained device. To investigate the limits of the construction, we choose as implementation platforms a very constrained 8-bit AVR microcontroller device, as well as a 32-bit ARM Cortex-M3 microcontroller device. The latter speeds up the clients generate procedure from 34.9 to 0.4 seconds. We also show how to reduce the memory footprint of the algorithms proposed by Fuller et al. Our implementation requires only 1.45KB of SRAM and 9.8KB of Flash memory on an 8-bit microcontroller. Our evaluation indicates that it is feasible to implement such CFE schemes in highly constrained environments.","PeriodicalId":190635,"journal":{"name":"2017 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"LWE-based lossless computational fuzzy extractor for the Internet of Things\",\"authors\":\"Christopher Huth, Daniela Becker, J. Guajardo, P. Duplys, T. Güneysu\",\"doi\":\"10.1109/HST.2017.7951818\",\"DOIUrl\":null,\"url\":null,\"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 et al. (ASIACRYPT'13) that the entropy loss can be reduced if the security requirement is relaxed to computational security based on the hardness of the Learning with Errors problem. We present the first implementation of a lossless computational fuzzy extractor (CFE) where the entropy of the source equals the entropy of the key. We explore efficiency and complexity design trade-offs for a system based on the implementation of a lossless CFE on a constrained device. To investigate the limits of the construction, we choose as implementation platforms a very constrained 8-bit AVR microcontroller device, as well as a 32-bit ARM Cortex-M3 microcontroller device. The latter speeds up the clients generate procedure from 34.9 to 0.4 seconds. We also show how to reduce the memory footprint of the algorithms proposed by Fuller et al. Our implementation requires only 1.45KB of SRAM and 9.8KB of Flash memory on an 8-bit microcontroller. Our evaluation indicates that it is feasible to implement such CFE schemes in highly constrained environments.\",\"PeriodicalId\":190635,\"journal\":{\"name\":\"2017 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HST.2017.7951818\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HST.2017.7951818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

随着物联网的出现,轻量级设备需要安全且经济高效的密钥存储。由于传统的安全密钥存储成本昂贵,基于从噪声熵源中提取密钥的思想开发了新的解决方案。当这些源与模糊提取器结合使用时,可以实现密码学上强的密钥派生。信息理论模糊提取器需要大量的输入熵来解释密钥提取过程中的熵损失。Fuller等人(ASIACRYPT'13)已经证明,如果将安全要求放宽到基于有误差学习问题的计算安全性,则可以减少熵损失。我们提出了一种无损计算模糊提取器(CFE)的第一个实现,其中源的熵等于密钥的熵。我们探讨了基于在受限设备上实现无损CFE的系统的效率和复杂性设计权衡。为了研究结构的限制,我们选择一个非常受限的8位AVR微控制器设备作为实现平台,以及一个32位ARM Cortex-M3微控制器设备。后者将客户机生成过程从34.9秒加快到0.4秒。我们还展示了如何减少Fuller等人提出的算法的内存占用。我们的实现在8位微控制器上只需要1.45KB的SRAM和9.8KB的闪存。我们的评估表明,在高度受限的环境中实施这种CFE方案是可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
LWE-based lossless computational fuzzy extractor for the Internet of Things
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 et al. (ASIACRYPT'13) that the entropy loss can be reduced if the security requirement is relaxed to computational security based on the hardness of the Learning with Errors problem. We present the first implementation of a lossless computational fuzzy extractor (CFE) where the entropy of the source equals the entropy of the key. We explore efficiency and complexity design trade-offs for a system based on the implementation of a lossless CFE on a constrained device. To investigate the limits of the construction, we choose as implementation platforms a very constrained 8-bit AVR microcontroller device, as well as a 32-bit ARM Cortex-M3 microcontroller device. The latter speeds up the clients generate procedure from 34.9 to 0.4 seconds. We also show how to reduce the memory footprint of the algorithms proposed by Fuller et al. Our implementation requires only 1.45KB of SRAM and 9.8KB of Flash memory on an 8-bit microcontroller. Our evaluation indicates that it is feasible to implement such CFE schemes in highly constrained environments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信