2012 IEEE International Workshop on Information Forensics and Security (WIFS)最新文献_第5页

Weighted stego-image steganalysis for naive content-adaptive embedding 朴素内容自适应嵌入的加权隐写-图像隐写分析

2012 IEEE International Workshop on Information Forensics and Security (WIFS) Pub Date : 2012-12-01 DOI: 10.1109/WIFS.2012.6412648

Pascal Schöttle, Stefan Korff, Rainer Böhme

引用次数: 21

Dynamic traitor tracing for arbitrary alphabets: Divide and conquer 任意字母的动态叛逆者跟踪:分而治之

2012 IEEE International Workshop on Information Forensics and Security (WIFS) Pub Date : 2012-06-28 DOI: 10.1109/WIFS.2012.6412656

Thijs Laarhoven, Jan-Jaap Oosterwijk, J. Doumen

引用次数: 18

Machine learning attacks on 65nm Arbiter PUFs: Accurate modeling poses strict bounds on usability 对65nm Arbiter puf的机器学习攻击:准确的建模对可用性提出了严格的限制

2012 IEEE International Workshop on Information Forensics and Security (WIFS) Pub Date : 1900-01-01 DOI: 10.1109/WIFS.2012.6412622

Gabriel Hospodar, Roel Maes, I. Verbauwhede

{"title":"Machine learning attacks on 65nm Arbiter PUFs: Accurate modeling poses strict bounds on usability","authors":"Gabriel Hospodar, Roel Maes, I. Verbauwhede","doi":"10.1109/WIFS.2012.6412622","DOIUrl":"https://doi.org/10.1109/WIFS.2012.6412622","url":null,"abstract":"Arbiter Physically Unclonable Functions (PUFs) have been proposed as efficient hardware security primitives for generating device-unique authentication responses and cryptographic keys. However, the assumed possibility of modeling their underlying challenge-response behavior causes uncertainty about their actual applicability. In this work, we apply well-known machine learning techniques on challenge-response pairs (CRPs) from 64-stage Arbiter PUFs realized in 65nm CMOS, in order to evaluate the effectiveness of such modeling attacks on a modern silicon implementation. We show that a 90%-accurate model can be built from a training set of merely 500 CRPs, and that 5000 CRPs are sufficient to perfectly model the PUFs. To study the implications of these attacks, there is need for a new methodology to assess the security of PUFs suffering from modeling. We propose such a methodology and apply it to our machine learning results, yielding strict bounds on the usability of Arbiter PUFs. We conclude that plain 64-stage Arbiter PUFs are not secure for challenge-response authentication, and the number of extractable secret key bits is limited to at most 600.","PeriodicalId":396789,"journal":{"name":"2012 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124445914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 150

A Least Squares approach to user profiling in pool mix-based anonymous communication systems 基于池混合的匿名通信系统中用户分析的最小二乘方法

2012 IEEE International Workshop on Information Forensics and Security (WIFS) Pub Date : 1900-01-01 DOI: 10.1109/WIFS.2012.6412635

F. Pérez-González, C. Troncoso

引用次数: 5

Improving the DGK comparison protocol 改进DGK比较协议

2012 IEEE International Workshop on Information Forensics and Security (WIFS) Pub Date : 1900-01-01 DOI: 10.1109/WIFS.2012.6412624

T. Veugen

引用次数: 51

Destination assisted cooperative jamming for wireless physical layer security 无线物理层安全的目标辅助协同干扰

2012 IEEE International Workshop on Information Forensics and Security (WIFS) Pub Date : 1900-01-01 DOI: 10.1109/WIFS.2012.6412663

Yupeng Liu, A. Petropulu

引用次数: 150