The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Provably-Secure Logic Locking: From Theory To Practice
Abstract
Logic locking has been conceived as a promising proactive defense strategy against intellectual property (IP) piracy, counterfeiting, hardware Trojans, reverse engineering, and overbuilding attacks. Yet, various attacks that use a working chip as an oracle have been launched on logic locking to successfully retrieve its secret key, undermining the defense of all existing locking techniques. In this paper, we propose stripped-functionality logic locking (SFLL), which strips some of the functionality of the design and hides it in the form of a secret key(s), thereby rendering on-chip implementation functionally different from the original one. When loaded onto an on-chip memory, the secret keys restore the original functionality of the design. Through security-aware synthesis that creates a controllable mismatch between the reverse-engineered netlist and original design, SFLL provides a quantifiable and provable resilience trade-off between all known and anticipated attacks. We demonstrate the application of SFLL to large designs (>100K gates) using a computer-aided design (CAD) framework that ensures attaining the desired security level at minimal implementation cost, 8%, 5%, and 0.5% for area, power, and delay, respectively. In addition to theoretical proofs and simulation confirmation of SFLL's security, we also report results from the silicon implementation of SFLL on an ARM Cortex-M0 microprocessor in 65nm technology.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Combinational profiles of sequential benchmark circuits
Brglez, F., Bryan, D., & Kozminski, K. (2003) · IEEE International Symposium on Circuits and Systems · doi:10.1109/iscas.1989.100747 · Cited by 2,095
Minimization of Boolean Functions*
McCluskey, E. J. (1956) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1956.tb03835.x · Cited by 1,230
A Primer on Hardware Security: Models, Methods, and Metrics
Rostami, M., Koushanfar, F., & Karri, R. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2335155 · Cited by 658
Trustworthy Hardware: Identifying and Classifying Hardware Trojans
Karri, R., Rajendran, J., Rosenfeld, K., & Tehranipoor, M. (2010) · Computer · doi:10.1109/mc.2010.299 · Cited by 532
Self-citationAlgorithms to accelerate multiple regular expressions matching for deep packet inspection
Kumar, S., Dharmapurikar, S., Yu, F., Crowley, P., & Turner, J. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159952 · Cited by 509
Read-Proof Hardware from Protective Coatings
Tuyls, P., Schrijen, G.-J., Škorić, B., van Geloven, J., Verhaegh, N., & Wolters, R. (2006) · Lecture Notes in Computer Science · doi:10.1007/11894063_29 · Cited by 421
Active hardware metering for intellectual property protection and security
Alkabani, Y., & Koushanfar, F. (2007) · USENIX Security Symposium · Cited by 302
Imeson, F., Emtenan, A., Garg, S., & Tripunitara, M. (2013) · USENIX Security Symposium · Cited by 165
Provably Secure Active IC Metering Techniques for Piracy Avoidance and Digital Rights Management
Koushanfar, F. (2012) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2011.2163307 · Cited by 161
Robust IP watermarking methodologies for physical design
Kahng, A. B., Mantik, S., Markov, I. L., Potkonjak, M., Tucker, P., Wang, H., & Wolfe, G. (1998) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/277044.277241 · Cited by 115
Metadata
- Authors
- Yasin, M., Sengupta, A., Nabeel, M. T., Ashraf, M., Rajendran, J. (., & Sinanoglu, O.
- Venue
- Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2017-10-30
- Pages
- 1601-1618
- OpenAlex
- W2766393343
- Cited by
- 336
- References
- 12
- FWCI
- 23.81
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Provably-Secure Logic Locking: From Theory To Practice. https://app.cochat.ai/papers/10.1145/3133956.3133985
- The paper
- Yasin, M., Sengupta, A., Nabeel, M. T., Ashraf, M., Rajendran, J. (., & Sinanoglu, O. (2017). Provably-Secure Logic Locking: From Theory To Practice. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. https://doi.org/10.1145/3133956.3133985
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.