Loading…
Stochastic Selection of Responses for Physically Unclonable Functions
Challenges in securing the Internet of Things (IoT) has led to the development of novel technologies such as physically unclonable functions (PUFs). Having applications in both lightweight authentication and key generation protocols for IoT devices, PUFs have received a great deal of research. Despi...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 475 |
container_issue | |
container_start_page | 471 |
container_title | |
container_volume | |
creator | Rojas, Pablo Idriss, Haytham Alahmadi, Sara Bayoumi, Magdy |
description | Challenges in securing the Internet of Things (IoT) has led to the development of novel technologies such as physically unclonable functions (PUFs). Having applications in both lightweight authentication and key generation protocols for IoT devices, PUFs have received a great deal of research. Despite their promise, delay-based PUFs such as Arbiter PUFs and 4-XOR PUFs are easily modeled with 600 and 50, 000 challenge-response pairs (CRPs), respectively. While it has been shown that delay-based PUFs can be further improved by XORing together an increasing number of PUF instances, it also tends to become area-inefficient. In this paper the authors propose a novel method that combats the effectiveness of machine learning algorithms for modeling PUF behaviors by randomly selecting responses from a pool of PUFs. Six variants to our Random Bit Selection (RBS) PUF are proposed and investigated. The yielded results show that specific variants of RBS PUF are machine learning resistant despite using a 5, 760, 000 CRP dataset for training. Furthermore, the results indicate no significant improvement in the modeling algorithm despite a 100 times increase in the number of CRPs used. Finally, the security of the proposed design is also evaluated through a brute-force analysis to show its resistance to brute-force attacks. |
doi_str_mv | 10.1109/ISCAS48785.2022.9937976 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_9937976</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9937976</ieee_id><sourcerecordid>9937976</sourcerecordid><originalsourceid>FETCH-LOGICAL-i203t-f1926dae776e41b85fd6dc232e1c909338077246c17f4db8b7578b674a7cc5283</originalsourceid><addsrcrecordid>eNotj91KwzAYQKMgOOeewAvzAq3Jl58vuRxlc4OBYt31SNOUVWIzmnrRtxd0V-fmcOAQ8sxZyTmzL_u6WtfSoFElMIDSWoEW9Q1ZWTRcayWNNErdkgVwZQquQN2Th5y_GAPGNCzIpp6SP7s89Z7WIQY_9WmgqaMfIV_SkEOmXRrp-3nOvXcxzvQ4-JgG18RAtz_Dn58fyV3nYg6rK5fkuN18Vrvi8Pa6r9aHogcmpqLjFnTrAqIOkjdGda1uPQgI3FtmhTAMEaT2HDvZNqZBhabRKB16r8CIJXn67_YhhNNl7L_dOJ-u1-IXV5hM1g</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Stochastic Selection of Responses for Physically Unclonable Functions</title><source>IEEE Xplore All Conference Series</source><creator>Rojas, Pablo ; Idriss, Haytham ; Alahmadi, Sara ; Bayoumi, Magdy</creator><creatorcontrib>Rojas, Pablo ; Idriss, Haytham ; Alahmadi, Sara ; Bayoumi, Magdy</creatorcontrib><description>Challenges in securing the Internet of Things (IoT) has led to the development of novel technologies such as physically unclonable functions (PUFs). Having applications in both lightweight authentication and key generation protocols for IoT devices, PUFs have received a great deal of research. Despite their promise, delay-based PUFs such as Arbiter PUFs and 4-XOR PUFs are easily modeled with 600 and 50, 000 challenge-response pairs (CRPs), respectively. While it has been shown that delay-based PUFs can be further improved by XORing together an increasing number of PUF instances, it also tends to become area-inefficient. In this paper the authors propose a novel method that combats the effectiveness of machine learning algorithms for modeling PUF behaviors by randomly selecting responses from a pool of PUFs. Six variants to our Random Bit Selection (RBS) PUF are proposed and investigated. The yielded results show that specific variants of RBS PUF are machine learning resistant despite using a 5, 760, 000 CRP dataset for training. Furthermore, the results indicate no significant improvement in the modeling algorithm despite a 100 times increase in the number of CRPs used. Finally, the security of the proposed design is also evaluated through a brute-force analysis to show its resistance to brute-force attacks.</description><identifier>EISSN: 2158-1525</identifier><identifier>EISBN: 9781665484855</identifier><identifier>EISBN: 1665484853</identifier><identifier>DOI: 10.1109/ISCAS48785.2022.9937976</identifier><language>eng</language><publisher>IEEE</publisher><subject>hardware security ; IoT security ; Machine learning ; Machine learning algorithms ; Physical unclonable function ; Physically unclonable function ; Protocols ; PUF ; Resistance ; Stochastic processes ; Training</subject><ispartof>2022 IEEE International Symposium on Circuits and Systems (ISCAS), 2022, p.471-475</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9937976$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9937976$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Rojas, Pablo</creatorcontrib><creatorcontrib>Idriss, Haytham</creatorcontrib><creatorcontrib>Alahmadi, Sara</creatorcontrib><creatorcontrib>Bayoumi, Magdy</creatorcontrib><title>Stochastic Selection of Responses for Physically Unclonable Functions</title><title>2022 IEEE International Symposium on Circuits and Systems (ISCAS)</title><addtitle>ISCAS</addtitle><description>Challenges in securing the Internet of Things (IoT) has led to the development of novel technologies such as physically unclonable functions (PUFs). Having applications in both lightweight authentication and key generation protocols for IoT devices, PUFs have received a great deal of research. Despite their promise, delay-based PUFs such as Arbiter PUFs and 4-XOR PUFs are easily modeled with 600 and 50, 000 challenge-response pairs (CRPs), respectively. While it has been shown that delay-based PUFs can be further improved by XORing together an increasing number of PUF instances, it also tends to become area-inefficient. In this paper the authors propose a novel method that combats the effectiveness of machine learning algorithms for modeling PUF behaviors by randomly selecting responses from a pool of PUFs. Six variants to our Random Bit Selection (RBS) PUF are proposed and investigated. The yielded results show that specific variants of RBS PUF are machine learning resistant despite using a 5, 760, 000 CRP dataset for training. Furthermore, the results indicate no significant improvement in the modeling algorithm despite a 100 times increase in the number of CRPs used. Finally, the security of the proposed design is also evaluated through a brute-force analysis to show its resistance to brute-force attacks.</description><subject>hardware security</subject><subject>IoT security</subject><subject>Machine learning</subject><subject>Machine learning algorithms</subject><subject>Physical unclonable function</subject><subject>Physically unclonable function</subject><subject>Protocols</subject><subject>PUF</subject><subject>Resistance</subject><subject>Stochastic processes</subject><subject>Training</subject><issn>2158-1525</issn><isbn>9781665484855</isbn><isbn>1665484853</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2022</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj91KwzAYQKMgOOeewAvzAq3Jl58vuRxlc4OBYt31SNOUVWIzmnrRtxd0V-fmcOAQ8sxZyTmzL_u6WtfSoFElMIDSWoEW9Q1ZWTRcayWNNErdkgVwZQquQN2Th5y_GAPGNCzIpp6SP7s89Z7WIQY_9WmgqaMfIV_SkEOmXRrp-3nOvXcxzvQ4-JgG18RAtz_Dn58fyV3nYg6rK5fkuN18Vrvi8Pa6r9aHogcmpqLjFnTrAqIOkjdGda1uPQgI3FtmhTAMEaT2HDvZNqZBhabRKB16r8CIJXn67_YhhNNl7L_dOJ-u1-IXV5hM1g</recordid><startdate>20220528</startdate><enddate>20220528</enddate><creator>Rojas, Pablo</creator><creator>Idriss, Haytham</creator><creator>Alahmadi, Sara</creator><creator>Bayoumi, Magdy</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>20220528</creationdate><title>Stochastic Selection of Responses for Physically Unclonable Functions</title><author>Rojas, Pablo ; Idriss, Haytham ; Alahmadi, Sara ; Bayoumi, Magdy</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i203t-f1926dae776e41b85fd6dc232e1c909338077246c17f4db8b7578b674a7cc5283</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2022</creationdate><topic>hardware security</topic><topic>IoT security</topic><topic>Machine learning</topic><topic>Machine learning algorithms</topic><topic>Physical unclonable function</topic><topic>Physically unclonable function</topic><topic>Protocols</topic><topic>PUF</topic><topic>Resistance</topic><topic>Stochastic processes</topic><topic>Training</topic><toplevel>online_resources</toplevel><creatorcontrib>Rojas, Pablo</creatorcontrib><creatorcontrib>Idriss, Haytham</creatorcontrib><creatorcontrib>Alahmadi, Sara</creatorcontrib><creatorcontrib>Bayoumi, Magdy</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Rojas, Pablo</au><au>Idriss, Haytham</au><au>Alahmadi, Sara</au><au>Bayoumi, Magdy</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Stochastic Selection of Responses for Physically Unclonable Functions</atitle><btitle>2022 IEEE International Symposium on Circuits and Systems (ISCAS)</btitle><stitle>ISCAS</stitle><date>2022-05-28</date><risdate>2022</risdate><spage>471</spage><epage>475</epage><pages>471-475</pages><eissn>2158-1525</eissn><eisbn>9781665484855</eisbn><eisbn>1665484853</eisbn><abstract>Challenges in securing the Internet of Things (IoT) has led to the development of novel technologies such as physically unclonable functions (PUFs). Having applications in both lightweight authentication and key generation protocols for IoT devices, PUFs have received a great deal of research. Despite their promise, delay-based PUFs such as Arbiter PUFs and 4-XOR PUFs are easily modeled with 600 and 50, 000 challenge-response pairs (CRPs), respectively. While it has been shown that delay-based PUFs can be further improved by XORing together an increasing number of PUF instances, it also tends to become area-inefficient. In this paper the authors propose a novel method that combats the effectiveness of machine learning algorithms for modeling PUF behaviors by randomly selecting responses from a pool of PUFs. Six variants to our Random Bit Selection (RBS) PUF are proposed and investigated. The yielded results show that specific variants of RBS PUF are machine learning resistant despite using a 5, 760, 000 CRP dataset for training. Furthermore, the results indicate no significant improvement in the modeling algorithm despite a 100 times increase in the number of CRPs used. Finally, the security of the proposed design is also evaluated through a brute-force analysis to show its resistance to brute-force attacks.</abstract><pub>IEEE</pub><doi>10.1109/ISCAS48785.2022.9937976</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | EISSN: 2158-1525 |
ispartof | 2022 IEEE International Symposium on Circuits and Systems (ISCAS), 2022, p.471-475 |
issn | 2158-1525 |
language | eng |
recordid | cdi_ieee_primary_9937976 |
source | IEEE Xplore All Conference Series |
subjects | hardware security IoT security Machine learning Machine learning algorithms Physical unclonable function Physically unclonable function Protocols PUF Resistance Stochastic processes Training |
title | Stochastic Selection of Responses for Physically Unclonable Functions |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T22%3A11%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Stochastic%20Selection%20of%20Responses%20for%20Physically%20Unclonable%20Functions&rft.btitle=2022%20IEEE%20International%20Symposium%20on%20Circuits%20and%20Systems%20(ISCAS)&rft.au=Rojas,%20Pablo&rft.date=2022-05-28&rft.spage=471&rft.epage=475&rft.pages=471-475&rft.eissn=2158-1525&rft_id=info:doi/10.1109/ISCAS48785.2022.9937976&rft.eisbn=9781665484855&rft.eisbn_list=1665484853&rft_dat=%3Cieee_CHZPO%3E9937976%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i203t-f1926dae776e41b85fd6dc232e1c909338077246c17f4db8b7578b674a7cc5283%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=9937976&rfr_iscdi=true |