{"title":"强大的身份验证和数据存储,具有完美的保密性","authors":"Sebastian Baur, H. Boche","doi":"10.1109/INFCOMW.2017.8116437","DOIUrl":null,"url":null,"abstract":"We consider a Physical-Unclonable-Function (PUF)-based authentication process. We define achievable secret-key rate versus privacy-leakage rate pairs featuring perfect secrecy and uniform distribution of the secret-key. We derive the capacity region corresponding to this definition of achievability and thus show that it equals the known capacity region corresponding to weak secrecy. We define achievability requiring a small false acceptance probability and show that the corresponding capacity region is the same. We generalize our result for perfect secrecy to the case of a compound source. We also discuss the problem of secure data storage using data from a PUF when the statistics of the PUF are not perfectly known.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Robust authentication and data storage with perfect secrecy\",\"authors\":\"Sebastian Baur, H. Boche\",\"doi\":\"10.1109/INFCOMW.2017.8116437\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a Physical-Unclonable-Function (PUF)-based authentication process. We define achievable secret-key rate versus privacy-leakage rate pairs featuring perfect secrecy and uniform distribution of the secret-key. We derive the capacity region corresponding to this definition of achievability and thus show that it equals the known capacity region corresponding to weak secrecy. We define achievability requiring a small false acceptance probability and show that the corresponding capacity region is the same. We generalize our result for perfect secrecy to the case of a compound source. We also discuss the problem of secure data storage using data from a PUF when the statistics of the PUF are not perfectly known.\",\"PeriodicalId\":306731,\"journal\":{\"name\":\"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOMW.2017.8116437\",\"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 Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2017.8116437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Robust authentication and data storage with perfect secrecy
We consider a Physical-Unclonable-Function (PUF)-based authentication process. We define achievable secret-key rate versus privacy-leakage rate pairs featuring perfect secrecy and uniform distribution of the secret-key. We derive the capacity region corresponding to this definition of achievability and thus show that it equals the known capacity region corresponding to weak secrecy. We define achievability requiring a small false acceptance probability and show that the corresponding capacity region is the same. We generalize our result for perfect secrecy to the case of a compound source. We also discuss the problem of secure data storage using data from a PUF when the statistics of the PUF are not perfectly known.