Evaluating the Security of eFPGA-based Redaction Algorithms
Hardware IP owners must envision procedures to avoid piracy and overproduction of their designs under a fabless paradigm. A newly proposed technique to obfuscate critical components in a logic design is called eFPGA-based redaction, which replaces a sensitive sub-circuit with an embedded FPGA, and t...
Uloženo v:
| Vydáno v: | 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) s. 1 - 7 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
ACM
29.10.2022
|
| Témata: | |
| ISSN: | 1558-2434 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Hardware IP owners must envision procedures to avoid piracy and overproduction of their designs under a fabless paradigm. A newly proposed technique to obfuscate critical components in a logic design is called eFPGA-based redaction, which replaces a sensitive sub-circuit with an embedded FPGA, and the eFPGA is configured to perform the same functionality as the missing sub-circuit. In this case, the configuration bitstream acts as a hidden key only known to the hardware IP owner. In this paper, we first evaluate the security promise of the existing eFPGA-based redaction algorithms as a preliminary study. Then, we break eFPGA-based redaction schemes by an initial but not necessarily efficient attack named DIP Exclusion that excludes problematic input patterns from checking in a brute-force manner. Finally, by combining cycle breaking and unrolling, we propose a novel and powerful attack called Break & Unroll that is able to recover the bitstream of state-of-the-art eFPGA-based redaction schemes in a relatively short time even with the existence of hard cycles and large size keys. This study reveals that the common perception that eFPGA-based redaction is by default secure against oracle-guided attacks, is prejudice. It also shows that additional research on how to systematically create an exponential number of non-combinational hard cycles is required to secure eFPGA-based redaction schemes. |
|---|---|
| AbstractList | Hardware IP owners must envision procedures to avoid piracy and overproduction of their designs under a fabless paradigm. A newly proposed technique to obfuscate critical components in a logic design is called eFPGA-based redaction, which replaces a sensitive sub-circuit with an embedded FPGA, and the eFPGA is configured to perform the same functionality as the missing sub-circuit. In this case, the configuration bitstream acts as a hidden key only known to the hardware IP owner. In this paper, we first evaluate the security promise of the existing eFPGA-based redaction algorithms as a preliminary study. Then, we break eFPGA-based redaction schemes by an initial but not necessarily efficient attack named DIP Exclusion that excludes problematic input patterns from checking in a brute-force manner. Finally, by combining cycle breaking and unrolling, we propose a novel and powerful attack called Break & Unroll that is able to recover the bitstream of state-of-the-art eFPGA-based redaction schemes in a relatively short time even with the existence of hard cycles and large size keys. This study reveals that the common perception that eFPGA-based redaction is by default secure against oracle-guided attacks, is prejudice. It also shows that additional research on how to systematically create an exponential number of non-combinational hard cycles is required to secure eFPGA-based redaction schemes. |
| Author | Maynard, Jordan Rezaei, Amin Afsharmazayejani, Raheel |
| Author_xml | – sequence: 1 givenname: Amin surname: Rezaei fullname: Rezaei, Amin organization: California State University Long Beach,Long Beach,California,USA – sequence: 2 givenname: Raheel surname: Afsharmazayejani fullname: Afsharmazayejani, Raheel organization: University of Calgary,Calgary,Canada – sequence: 3 givenname: Jordan surname: Maynard fullname: Maynard, Jordan organization: California State University Long Beach,Long Beach,California,USA |
| BookMark | eNotjktLw0AURkdRsNas3biYP5A67zuDq1DaKhQUH-symdzbRtJEmlTov29AV9_iHA7fLbtquxYZu5diJqWxj9oKr62aaWuCUfaCZQH8CIQOSoK5ZBNprc-V0eaGZX3_LYRQHiSAmLCnxW9sjnGo2y0fdsg_MB0P9XDiHXFcvq2KvIw9Vvwdq5iGumt50Wy70djt-zt2TbHpMfvfKftaLj7nz_n6dfUyL9Z5VMYPeQQwCGUlTBmRQnLJEYGKCZwlU45XHToCnUjqklLwREo7Fbz0AikGPWUPf90aETc_h3ofD6eNFMIFkFqfARXQSbs |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1145/3508352.3549425 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library Online IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9781450392174 1450392172 |
| EISSN | 1558-2434 |
| EndPage | 7 |
| ExternalDocumentID | 10069713 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IH 6IL 6IN AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO FEDTE IEGSK IJVOP M43 OCL RIE RIL RIO |
| ID | FETCH-LOGICAL-a248t-a774e7bd04baef9c6c6ff72ac765f4b8146e6f73cf13bfc98ff236298180efa93 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 17 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000981574300153&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:46:16 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a248t-a774e7bd04baef9c6c6ff72ac765f4b8146e6f73cf13bfc98ff236298180efa93 |
| PageCount | 7 |
| ParticipantIDs | ieee_primary_10069713 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-Oct.-29 |
| PublicationDateYYYYMMDD | 2022-10-29 |
| PublicationDate_xml | – month: 10 year: 2022 text: 2022-Oct.-29 day: 29 |
| PublicationDecade | 2020 |
| PublicationTitle | 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) |
| PublicationTitleAbbrev | ICCAD |
| PublicationYear | 2022 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0002871770 ssj0020286 |
| Score | 2.3284137 |
| Snippet | Hardware IP owners must envision procedures to avoid piracy and overproduction of their designs under a fabless paradigm. A newly proposed technique to... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Cycle Breaking Cycle Unrolling eFPGA-based Redaction Hard Cycles Logic Locking Logic Obfuscation SAT Attack |
| Title | Evaluating the Security of eFPGA-based Redaction Algorithms |
| URI | https://ieeexplore.ieee.org/document/10069713 |
| WOSCitedRecordID | wos000981574300153&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwELWg4gAXtiJ2-cDVJY23Wpwq1MIBVRWbeqtiewaQIEFd-H5sN5ReOHCLnMiyxkneeOz3HiEX0msrlFMsRyWZMMIx661kxhWQeWnAp9LF850eDDqjkRnWZPXEhQGAdPgMWvEy7eX7ys1jqSx84ZkyOnrUrmutF2StZUElpv46vnz1ais0qFrLpy3kJZcp2WjxsCAS0Rh7xUwlYUl_-5-j2CHNX1YeHS7xZpesQblHtlYEBffJVa8W7y5faMjs6EPtTkcrpNAf3nRZRC1P78EvCA20-_5ShSdeP6ZN8tTvPV7fstoegRW56MxYETI30NZnwhaAxoWII-q8cFpJFDbW9kCh5g7b3KIzHcQ8wJWJ7G7AwvAD0iirEg4JdcLqDJ0K97wIAF6I0KdwyKXhUVH_iDRjHMafCwWM8U8Ijv9oPyGbeaQJhH98bk5JYzaZwxnZcF-zt-nkPM3bN-KCl8w |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwFLQQIAEXtiJ2fODqkjpeanGqUEsRpaqgoN4qL88FCRLUhe_HTkPphQO3yIks6znJPD97ZhC65E4aJqwg1AtOmGKWGGc4UVZD4rgCV5QuXjqy260PBqpXktULLgwAFIfPoBovi718l9tZLJWFLzwRSkaP2jXOGK3N6VqLkkpM_mV8_cr1VmgQpZpPjfGrlBfpRjUNSyIWrbGX7FQKNGlt_3McO6jyy8vDvQXi7KIVyPbQ1pKk4D66bpby3dkIh9wOP5X-dDj3GFq92waJuOXwI7g5pQE33kd5eOL1Y1JBz61m_6ZNSoMEoimrT4kOuRtI4xJmNHhlQ8y9l1RbKbhnJlb3QHiZWl9Ljbeq7j0NgKUivxu8VukBWs3yDA4RtszIxFsR7jkWIFyz0CezPuUqjZr6R6gS4zD8nGtgDH9CcPxH-wXaaPcfOsPOXff-BG3SSBoIf3yqTtHqdDyDM7Ruv6Zvk_F5MYff-6abEw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2022+IEEE%2FACM+International+Conference+On+Computer+Aided+Design+%28ICCAD%29&rft.atitle=Evaluating+the+Security+of+eFPGA-based+Redaction+Algorithms&rft.au=Rezaei%2C+Amin&rft.au=Afsharmazayejani%2C+Raheel&rft.au=Maynard%2C+Jordan&rft.date=2022-10-29&rft.pub=ACM&rft.eissn=1558-2434&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1145%2F3508352.3549425&rft.externalDocID=10069713 |