Ke Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ke Wang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Junjian Chen
Digital Grid Research Institute, China Southern Power Grid, Guangzhou 510670, China
1 shared publication Kai Huang
School of Micro-Nano Electronics, Zhejiang University
1 shared publication- Kai Huang
Zhejiang University
1 shared publication Ning Zhang
School of Micro-Nano Electronics, Zhejiang University
1 shared publication- Qingtang Deng
Digital Grid Research Institute, CSG, Guangzhou 510670, China
1 shared publication - Wenyuan Xu
Zhejiang University, Hangzhou, China
1 shared publication
Latest Publications
- Open Access
- 10 February 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Electronics Express
- Vol. 21 (3) , 20230555
SFLL-AD: a self-adaptive and secure logic locking
Logic locking is an efficient defense against attacks to the intellectual property of integrated circuits. However, in recent years, boolean satisfaction based attack (SAT attack) and a structural based attack named Valkyrie were proposed. As far as we know, most of the locking methods failed to achieve security for both of them and keep an acceptable overhead. In this paper, we present a self-adaptive striped-function logic locking method named SFLL-AD, based on repeatedly modifying the structure of the encryption block to a form that: (1) permits splitting and dispersing the encryption block across the netlist to have resilience to Valkryie (2) and guarantees not losing SAT resilience. Experimental results of our mehtod confirm the security to both attacks and show a small overhead (about 10% on average).
- 10 February 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Electronics Express
- Vol. 21 (3) , 20230555
Open AccessSFLL-AD: a self-adaptive and secure logic locking
Logic locking is an efficient defense against attacks to the intellectual property of integrated circuits. However, in recent years, boolean satisfaction based attack (SAT attack) and a structural based attack named Valkyrie were proposed. As far as we know, most of the locking methods failed to achieve security for both of them and keep an acceptable overhead. In this paper, we present a self-adaptive striped-function logic locking method named SFLL-AD, based on repeatedly modifying the structure of the encryption block to a form that: (1) permits splitting and dispersing the encryption block across the netlist to have resilience to Valkryie (2) and guarantees not losing SAT resilience. Experimental results of our mehtod confirm the security to both attacks and show a small overhead (about 10% on average).
- Open Access
- 8 January 2021
- Published by MDPI AG in Electronics
- Vol. 10 (2) , 125
Reliability-Aware Multipath Routing of Time-Triggered Traffic in Time-Sensitive Networks
With the development of industrial networks, the demands for strict timing requirements and high reliability in transmission become more essential, which promote the establishment of a Time-Sensitive Network (TSN). TSN is a set of standards with the intention of extending Ethernet for safety-critical and real-time applications. In general, frame replication is used to achieve fault-tolerance, while the increased load has a negative effect on the schedule synthesis phase. It is necessary to consider schedulability and reliability jointly. In this paper, a heuristic-based routing method is proposed to achieve fault tolerance by spatial redundancy for TSNs containing unreliable links. A cost function is presented to evaluate each routing set, and a heuristic algorithm is applied to find the solution with higher schedulability. Compared to the shortest path routing, our method can improve the reliability and the success rate of no-wait scheduling by 5–15% depending on the scale of topology.
- 8 January 2021
- Published by MDPI AG in Electronics
- Vol. 10 (2) , 125
Open AccessReliability-Aware Multipath Routing of Time-Triggered Traffic in Time-Sensitive Networks
With the development of industrial networks, the demands for strict timing requirements and high reliability in transmission become more essential, which promote the establishment of a Time-Sensitive Network (TSN). TSN is a set of standards with the intention of extending Ethernet for safety-critical and real-time applications. In general, frame replication is used to achieve fault-tolerance, while the increased load has a negative effect on the schedule synthesis phase. It is necessary to consider schedulability and reliability jointly. In this paper, a heuristic-based routing method is proposed to achieve fault tolerance by spatial redundancy for TSNs containing unreliable links. A cost function is presented to evaluate each routing set, and a heuristic algorithm is applied to find the solution with higher schedulability. Compared to the shortest path routing, our method can improve the reliability and the success rate of no-wait scheduling by 5–15% depending on the scale of topology.