Evaluating the Indistinguishability of Logic Locking using K-Cut Enumeration and Boolean Matching

• URL: http://arxiv.org/abs/2602.21386v1
• Date: Tue, 24 Feb 2026 21:28:37 GMT
• Title: Evaluating the Indistinguishability of Logic Locking using K-Cut Enumeration and Boolean Matching
• Authors: Jonathan Cruz, Jason Hamlet,
• Abstract summary: In part due to a lack of rigor, logic locking defenses have been historically short-lived.<n>We propose a new method of evaluation based on comparing distributions of $k$-cuts.<n>We show up to 92% average accuracy in correctly identifying which design was locked, even in the presence of resynthesis.
• Score: 0.823605099365301
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Logic locking as a solution for semiconductor intellectual property (IP) confidentiality has received considerable attention in academia, but has yet to produce a viable solution to protect against known threats. In part due to a lack of rigor, logic locking defenses have been historically short-lived, which is an unacceptable risk for hardware-based security solutions for critical systems that may be fielded for decades. Researchers have worked to map the concept of cryptographic indistinguishability to logic locking, as indistinguishability provides strong security guarantees. In an effort to bridge theory and practice, we highlight recent efforts that can be used to analyze the indistinguishability of logic locking techniques, and propose a new method of evaluation based on comparing distributions of $k$-cuts, which is akin to comparing against a library of sub-functions. We evaluate our approach on several different classes of logic locking and show up to 92% average accuracy in correctly identifying which design was locked, even in the presence of resynthesis, suggesting that the evaluated locks do not provide indistinguishability.

Related papers

• Constraint-Rectified Training for Efficient Chain-of-Thought [60.52883907721588]
  Chain-of-Thought (CoT) has significantly enhanced the reasoning capabilities of Large Language Models (LLMs)<n>While longer reasoning traces can improve answer quality and unlock abilities such as self-correction, they also incur high inference costs and often introduce redundant steps, known as overthinking.<n>Recent research seeks to develop efficient reasoning strategies that balance reasoning length and accuracy.
  arXiv  Detail & Related papers  (2026-02-13T02:13:45Z)
• Advancing Neural Network Verification through Hierarchical Safety Abstract Interpretation [52.626086874715284]
  We introduce a novel problem formulation called Abstract DNN-Verification, which verifies a hierarchical structure of unsafe outputs.<n>By leveraging abstract interpretation and reasoning about output reachable sets, our approach enables assessing multiple safety levels during the formal verification process.<n>Our contributions include a theoretical exploration of the relationship between our novel abstract safety formulation and existing approaches.
  arXiv  Detail & Related papers  (2025-05-08T13:29:46Z)
• The Impact of Logic Locking on Confidentiality: An Automated Evaluation [10.116593996661756]
  We show that a single malicious logic locking key can expose over 70% of an encryption key.<n>This research uncovers a significant security vulnerability in logic locking.
  arXiv  Detail & Related papers  (2025-02-03T11:01:11Z)
• Cute-Lock: Behavioral and Structural Multi-Key Logic Locking Using Time Base Keys [1.104960878651584]
  We propose, implement and evaluate a family of secure multi-key logic locking algorithms called Cute-Lock.<n>Our experimental results under a diverse range of attacks confirm that, compared to vulnerable state-of-the-art methods, employing the Cute-Lock family drives attacking attempts to a dead end without additional overhead.
  arXiv  Detail & Related papers  (2025-01-29T03:44:55Z)
• SubLock: Sub-Circuit Replacement based Input Dependent Key-based Logic Locking for Robust IP Protection [1.804933160047171]
  Existing logic locking techniques are vulnerable to SAT-based attacks. Several SAT-resistant logic locking methods are reported; they require significant overhead. This paper proposes a novel input dependent key-based logic locking (IDKLL) that effectively prevents SAT-based attacks with low overhead.
  arXiv  Detail & Related papers  (2024-06-27T11:17:06Z)
• DECOR: Enhancing Logic Locking Against Machine Learning-Based Attacks [0.6131022957085439]
  Logic locking (LL) has gained attention as a promising intellectual property protection measure for integrated circuits. Recent attacks, facilitated by machine learning (ML), have shown the potential to predict the correct key in multiple LL schemes. This paper presents a generic LL enhancement method based on a randomized algorithm that can significantly decrease the correlation between locked circuit netlist and correct key values in an LL scheme.
  arXiv  Detail & Related papers  (2024-03-04T07:31:23Z)
• Log Barriers for Safe Black-box Optimization with Application to Safe Reinforcement Learning [72.97229770329214]
  We introduce a general approach for seeking high dimensional non-linear optimization problems in which maintaining safety during learning is crucial. Our approach called LBSGD is based on applying a logarithmic barrier approximation with a carefully chosen step size. We demonstrate the effectiveness of our approach on minimizing violation in policy tasks in safe reinforcement learning.
  arXiv  Detail & Related papers  (2022-07-21T11:14:47Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Logical Credal Networks [87.25387518070411]
  This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
  arXiv  Detail & Related papers  (2021-09-25T00:00:47Z)
• Challenging the Security of Logic Locking Schemes in the Era of Deep Learning: A Neuroevolutionary Approach [0.2982610402087727]
  Deep learning is being introduced in the domain of logic locking. We present SnapShot: a novel attack on logic locking that is the first of its kind to utilize artificial neural networks. We show that SnapShot achieves an average key prediction accuracy of 82.60% for the selected attack scenario.
  arXiv  Detail & Related papers  (2020-11-20T13:03:19Z)
• Cautious Reinforcement Learning with Logical Constraints [78.96597639789279]
  An adaptive safe padding forces Reinforcement Learning (RL) to synthesise optimal control policies while ensuring safety during the learning process. Theoretical guarantees are available on the optimality of the synthesised policies and on the convergence of the learning algorithm.
  arXiv  Detail & Related papers  (2020-02-26T00:01:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.