{"id":"https://openalex.org/W7131649391","doi":"https://doi.org/10.48550/arxiv.2602.21386","title":"Evaluating the Indistinguishability of Logic Locking using K-Cut Enumeration and Boolean Matching","display_name":"Evaluating the Indistinguishability of Logic Locking using K-Cut Enumeration and Boolean Matching","publication_year":2026,"publication_date":"2026-02-24","ids":{"openalex":"https://openalex.org/W7131649391","doi":"https://doi.org/10.48550/arxiv.2602.21386"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.21386","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126868097","display_name":"Jonathan Cruz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cruz, Jonathan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027940565","display_name":"Jason Hamlet","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hamlet, Jason","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.9229999780654907,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.9229999780654907,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.06069999933242798,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.005200000014156103,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5730999708175659},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.45010000467300415},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.43529999256134033},{"id":"https://openalex.org/keywords/bridge","display_name":"Bridge (graph theory)","score":0.4348999857902527},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.392300009727478},{"id":"https://openalex.org/keywords/confidentiality","display_name":"Confidentiality","score":0.3714999854564667}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.585099995136261},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5741000175476074},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5730999708175659},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.45010000467300415},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.43529999256134033},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.4348999857902527},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.392300009727478},{"id":"https://openalex.org/C71745522","wikidata":"https://www.wikidata.org/wiki/Q2476929","display_name":"Confidentiality","level":2,"score":0.3714999854564667},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.33820000290870667},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C10418432","wikidata":"https://www.wikidata.org/wiki/Q560370","display_name":"AND gate","level":3,"score":0.31610000133514404},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.30489999055862427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2976999878883362},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.2912999987602234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2784000039100647},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.2782999873161316}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.21386","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.21386","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.21386","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.21386","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.7336336970329285,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Logic":[0],"locking":[1,39,104,139],"as":[2,76],"a":[3,22,34,108,125],"solution":[4,24],"for":[5,50,54,61],"semiconductor":[6],"intellectual":[7],"property":[8],"(IP)":[9],"confidentiality":[10],"has":[11,18],"received":[12],"considerable":[13],"attention":[14],"in":[15,147,155],"academia,":[16],"but":[17],"yet":[19],"to":[20,25,33,66,73,85,98,122,143],"produce":[21],"viable":[23],"protect":[26],"against":[27,124],"known":[28],"threats.":[29],"In":[30,82],"part":[31],"due":[32],"lack":[35],"of":[36,70,102,111,117,127,137,158],"rigor,":[37],"logic":[38,74,103,138],"defenses":[40],"have":[41,64],"been":[42],"historically":[43],"short-lived,":[44],"which":[45,119,150],"is":[46,120],"an":[47,83],"unacceptable":[48],"risk":[49],"hardware-based":[51],"security":[52,80],"solutions":[53],"critical":[55],"systems":[56],"that":[57,94,161],"may":[58],"be":[59,96],"fielded":[60],"decades.":[62],"Researchers":[63],"worked":[65],"map":[67],"the":[68,100,156,162],"concept":[69],"cryptographic":[71],"indistinguishability":[72,77,101],"locking,":[75],"provides":[78],"strong":[79],"guarantees.":[81],"effort":[84],"bridge":[86],"theory":[87],"and":[88,106,140],"practice,":[89],"we":[90],"highlight":[91],"recent":[92],"efforts":[93],"can":[95],"used":[97],"analyze":[99],"techniques,":[105],"propose":[107],"new":[109],"method":[110],"evaluation":[112],"based":[113],"on":[114,133],"comparing":[115,123],"distributions":[116],"$k$-cuts,":[118],"akin":[121],"library":[126],"sub-functions.":[128],"We":[129],"evaluate":[130],"our":[131],"approach":[132],"several":[134],"different":[135],"classes":[136],"show":[141],"up":[142],"92%":[144],"average":[145],"accuracy":[146],"correctly":[148],"identifying":[149],"design":[151],"was":[152],"locked,":[153],"even":[154],"presence":[157],"resynthesis,":[159],"suggesting":[160],"evaluated":[163],"locks":[164],"do":[165],"not":[166],"provide":[167],"indistinguishability.":[168]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-27T00:00:00"}