为什么攻击者会赢:关于XOR仲裁者puf的易学性

{"title":"为什么攻击者会赢:关于XOR仲裁者puf的易学性","authors":"F. Ganji, Shahin Tajik, Jean-Pierre Seifert","doi":"10.1007/978-3-319-22846-4_2","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":355592,"journal":{"name":"Trust and Trustworthy Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"84","resultStr":"{\"title\":\"Why Attackers Win: On the Learnability of XOR Arbiter PUFs\",\"authors\":\"F. Ganji, Shahin Tajik, Jean-Pierre Seifert\",\"doi\":\"10.1007/978-3-319-22846-4_2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":355592,\"journal\":{\"name\":\"Trust and Trustworthy Computing\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"84\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Trust and Trustworthy Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-22846-4_2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Trust and Trustworthy Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-22846-4_2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}