{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KI4SLKBQ6QFJ6WFKYGY3E5H52H","short_pith_number":"pith:KI4SLKBQ","schema_version":"1.0","canonical_sha256":"523925a830f40a9f58aac1b1b274fdd1df0c209af6974414e2dfb975a7485f34","source":{"kind":"arxiv","id":"1906.07806","version":1},"attestation_state":"computed","paper":{"title":"Is Robust Design-for-Security Robust Enough? Attack on Locked Circuits with Restricted Scan Chain Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Abhrajit Sengupta, Mohammed Nabeel, Nimisha Limaye, Ozgur Sinanoglu","submitted_at":"2019-06-18T20:48:10Z","abstract_excerpt":"The security of logic locking has been called into question by various attacks, especially a Boolean satisfiability (SAT) based attack, that exploits scan access in a working chip. Among other techniques, a robust design-for-security (DFS) architecture was presented to restrict any unauthorized scan access, thereby, thwarting the SAT attack (or any other attack that relies on scan access). Nevertheless, in this work, we successfully break this technique by recovering the secret key despite the lack of scan access. Our security analysis on a few benchmark circuits protected by the robust DFS ar"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1906.07806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-06-18T20:48:10Z","cross_cats_sorted":[],"title_canon_sha256":"b5cc949994e36bc692e6eb12590c0d29b6cd7c2bc59267d6c686606716cef3a5","abstract_canon_sha256":"47f203e7808d30d5af60aff3e5bec096ab5bdbfd231e6783264791a95faa8cc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:57.697564Z","signature_b64":"2YO+GHZAQN8xNEjQjA8OfU6x+I823I7hMBIwl28CKJYtQYmd9n+V6mB3IKGoKm+ORvUHw05rp+8hXaGTpDNvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"523925a830f40a9f58aac1b1b274fdd1df0c209af6974414e2dfb975a7485f34","last_reissued_at":"2026-05-17T23:42:57.697051Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:57.697051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Is Robust Design-for-Security Robust Enough? Attack on Locked Circuits with Restricted Scan Chain Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Abhrajit Sengupta, Mohammed Nabeel, Nimisha Limaye, Ozgur Sinanoglu","submitted_at":"2019-06-18T20:48:10Z","abstract_excerpt":"The security of logic locking has been called into question by various attacks, especially a Boolean satisfiability (SAT) based attack, that exploits scan access in a working chip. Among other techniques, a robust design-for-security (DFS) architecture was presented to restrict any unauthorized scan access, thereby, thwarting the SAT attack (or any other attack that relies on scan access). Nevertheless, in this work, we successfully break this technique by recovering the secret key despite the lack of scan access. Our security analysis on a few benchmark circuits protected by the robust DFS ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07806","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.07806","created_at":"2026-05-17T23:42:57.697130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.07806v1","created_at":"2026-05-17T23:42:57.697130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07806","created_at":"2026-05-17T23:42:57.697130+00:00"},{"alias_kind":"pith_short_12","alias_value":"KI4SLKBQ6QFJ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KI4SLKBQ6QFJ6WFK","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KI4SLKBQ","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KI4SLKBQ6QFJ6WFKYGY3E5H52H","json":"https://pith.science/pith/KI4SLKBQ6QFJ6WFKYGY3E5H52H.json","graph_json":"https://pith.science/api/pith-number/KI4SLKBQ6QFJ6WFKYGY3E5H52H/graph.json","events_json":"https://pith.science/api/pith-number/KI4SLKBQ6QFJ6WFKYGY3E5H52H/events.json","paper":"https://pith.science/paper/KI4SLKBQ"},"agent_actions":{"view_html":"https://pith.science/pith/KI4SLKBQ6QFJ6WFKYGY3E5H52H","download_json":"https://pith.science/pith/KI4SLKBQ6QFJ6WFKYGY3E5H52H.json","view_paper":"https://pith.science/paper/KI4SLKBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.07806&json=true","fetch_graph":"https://pith.science/api/pith-number/KI4SLKBQ6QFJ6WFKYGY3E5H52H/graph.json","fetch_events":"https://pith.science/api/pith-number/KI4SLKBQ6QFJ6WFKYGY3E5H52H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KI4SLKBQ6QFJ6WFKYGY3E5H52H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KI4SLKBQ6QFJ6WFKYGY3E5H52H/action/storage_attestation","attest_author":"https://pith.science/pith/KI4SLKBQ6QFJ6WFKYGY3E5H52H/action/author_attestation","sign_citation":"https://pith.science/pith/KI4SLKBQ6QFJ6WFKYGY3E5H52H/action/citation_signature","submit_replication":"https://pith.science/pith/KI4SLKBQ6QFJ6WFKYGY3E5H52H/action/replication_record"}},"created_at":"2026-05-17T23:42:57.697130+00:00","updated_at":"2026-05-17T23:42:57.697130+00:00"}