{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:L5NIG27IKIGY6CCNFT7LUKATWW","short_pith_number":"pith:L5NIG27I","schema_version":"1.0","canonical_sha256":"5f5a836be8520d8f084d2cfeba2813b5b66e6b660ba4b736e17dd95b8f21b603","source":{"kind":"arxiv","id":"2401.07142","version":1},"attestation_state":"computed","paper":{"title":"CAC 2.0: A Corrupt and Correct Logic Locking Technique Resilient to Structural Analysis Attacks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Levent Aksoy, Muhammad Yasin, Samuel Pagliarini","submitted_at":"2024-01-13T19:09:22Z","abstract_excerpt":"Logic locking proposed to protect integrated circuits from serious hardware threats has been studied extensively over a decade. In these years, many efficient logic locking techniques have been proven to be broken. The state-of-the-art logic locking techniques, including the prominent corrupt and correct (CAC) technique, are resilient to satisfiability (SAT)-based and removal attacks, but vulnerable to structural analysis attacks. To overcome this drawback, this paper introduces an improved version of CAC, called CAC 2.0, which increases the search space of structural analysis attacks using ob"},"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":"2401.07142","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-01-13T19:09:22Z","cross_cats_sorted":[],"title_canon_sha256":"237053832885f614d06d550a00098ea6c88bcc12b22a41585830a459c408391d","abstract_canon_sha256":"7fc4f9b19a475f62669407501e585eb8c5f65b84c52c244ea11ad855ca9a19a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:33:32.536162Z","signature_b64":"lqALAuxom6X0ls6S4Zgi4rsDMG+CxfDnc/HdLZPwEp1AvAzlvObyhRWN4hXX59OO5/J7GFuy9qUhTRuoR0X4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f5a836be8520d8f084d2cfeba2813b5b66e6b660ba4b736e17dd95b8f21b603","last_reissued_at":"2026-07-05T07:33:32.535775Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:33:32.535775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CAC 2.0: A Corrupt and Correct Logic Locking Technique Resilient to Structural Analysis Attacks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Levent Aksoy, Muhammad Yasin, Samuel Pagliarini","submitted_at":"2024-01-13T19:09:22Z","abstract_excerpt":"Logic locking proposed to protect integrated circuits from serious hardware threats has been studied extensively over a decade. In these years, many efficient logic locking techniques have been proven to be broken. The state-of-the-art logic locking techniques, including the prominent corrupt and correct (CAC) technique, are resilient to satisfiability (SAT)-based and removal attacks, but vulnerable to structural analysis attacks. To overcome this drawback, this paper introduces an improved version of CAC, called CAC 2.0, which increases the search space of structural analysis attacks using ob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07142","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.07142/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.07142","created_at":"2026-07-05T07:33:32.535831+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.07142v1","created_at":"2026-07-05T07:33:32.535831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07142","created_at":"2026-07-05T07:33:32.535831+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5NIG27IKIGY","created_at":"2026-07-05T07:33:32.535831+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5NIG27IKIGY6CCN","created_at":"2026-07-05T07:33:32.535831+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5NIG27I","created_at":"2026-07-05T07:33:32.535831+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/L5NIG27IKIGY6CCNFT7LUKATWW","json":"https://pith.science/pith/L5NIG27IKIGY6CCNFT7LUKATWW.json","graph_json":"https://pith.science/api/pith-number/L5NIG27IKIGY6CCNFT7LUKATWW/graph.json","events_json":"https://pith.science/api/pith-number/L5NIG27IKIGY6CCNFT7LUKATWW/events.json","paper":"https://pith.science/paper/L5NIG27I"},"agent_actions":{"view_html":"https://pith.science/pith/L5NIG27IKIGY6CCNFT7LUKATWW","download_json":"https://pith.science/pith/L5NIG27IKIGY6CCNFT7LUKATWW.json","view_paper":"https://pith.science/paper/L5NIG27I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.07142&json=true","fetch_graph":"https://pith.science/api/pith-number/L5NIG27IKIGY6CCNFT7LUKATWW/graph.json","fetch_events":"https://pith.science/api/pith-number/L5NIG27IKIGY6CCNFT7LUKATWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5NIG27IKIGY6CCNFT7LUKATWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5NIG27IKIGY6CCNFT7LUKATWW/action/storage_attestation","attest_author":"https://pith.science/pith/L5NIG27IKIGY6CCNFT7LUKATWW/action/author_attestation","sign_citation":"https://pith.science/pith/L5NIG27IKIGY6CCNFT7LUKATWW/action/citation_signature","submit_replication":"https://pith.science/pith/L5NIG27IKIGY6CCNFT7LUKATWW/action/replication_record"}},"created_at":"2026-07-05T07:33:32.535831+00:00","updated_at":"2026-07-05T07:33:32.535831+00:00"}