Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wei-Che Wang

dblp:92/10591 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 2020
0000-0003-4036-7053ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 4 first-authorSecurity and privacy · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
3 papers
Hardware security and side channels · 65% Authentication and access control · 35%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Electronic design automation · 74% Integrated circuit design · 26%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware security and side channels › hardware security primitives
physical unclonable function
0.822020
SLATE: A Secure Lightweight Entity Authentication Hardware Primitive · IEEE Trans. Inf. Forensics Secur. 2020
Design and Analysis of Stability-Guaranteed PUFs · IEEE Trans. Inf. Forensics Secur. 2018
Electronic design automation › physical design
layout synthesis
0.622018
Assessing Layout Density Benefits of Vertical Channel Devices · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2018
Efficient Layout Generation and Design Evaluation of Vertical Channel Devices · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2016
Electronic design automation
physical design
0.622018
Assessing Layout Density Benefits of Vertical Channel Devices · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2018
Efficient Layout Generation and Design Evaluation of Vertical Channel Devices · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2016
Hardware security and side channels › hardware reverse engineering
integrated circuit reverse engineering
0.412020
Reverse Engineering for 2.5-D Split Manufactured ICs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020
Authentication and access control › user authentication
lightweight authentication
0.412020
SLATE: A Secure Lightweight Entity Authentication Hardware Primitive · IEEE Trans. Inf. Forensics Secur. 2020
Hardware security and side channels › hardware security primitives › physical unclonable function
strong PUF
0.412020
SLATE: A Secure Lightweight Entity Authentication Hardware Primitive · IEEE Trans. Inf. Forensics Secur. 2020
Authentication and access control
user authentication
0.412020
SLATE: A Secure Lightweight Entity Authentication Hardware Primitive · IEEE Trans. Inf. Forensics Secur. 2020
Electronic design automation
hardware verification and test
0.412020
Reverse Engineering for 2.5-D Split Manufactured ICs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020
Integrated circuit design
digital circuit design
0.312018
Assessing Layout Density Benefits of Vertical Channel Devices · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2018
Electronic design automation › physical design › routing
congestion prediction
0.112016
Efficient Layout Generation and Design Evaluation of Vertical Channel Devices · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2016

Methods — techniques the papers use, named apart from their topics

satisfiability modulo theories · 0.9grouping algorithm · 0.9boolean satisfiability · 0.9challenge-response pair verification · 0.4vertical layout generation · 0.3keyed-hash message authentication code · 0.3information theoretic guesswork · 0.3folding strategies · 0.3directed self-assembly · 0.3layout generation heuristics · 0.2
YearPublicationVenuePosition
2020 Reverse Engineering for 2.5-D Split Manufactured ICs
abstract
Integrated circuit (IC) split manufacturing has been shown to be one of the most effective protection schemes to prevent reverse engineering from malicious foundries. Among the existing split manufacturing approaches, the 2.5-D split manufacturing using silicon interposer has much less fabrication and testing costs compared to layer splitting approaches. In this article, we propose a Boolean satisfiability (SAT)-based attack to reconstruct the wire connections of the 2.5-D split manufacturing netlists. Our SAT-based attack can fully reconstruct the missing wires between modules with 100% correctness and therefore the functionality of the chip can be completely reverse engineered. In addition, we show that the runtime of attack is significantly reduced compared to existing 2.5-D split manufacturing SAT attacks by applying grouping hints obtained from a satisfiability modulo theories (SMTs)-based grouping algorithm, which is purely depending on the circuit functionality, so no physical defensive mechanisms can prevent such attack. In our experiments, we show that our grouping algorithm can speed up the existing SAT attack runtime by more than 1000× and can successfully reverse engineer reasonable size benchmarks even when the split nets contains more than one fanouts and the total cut size is close to 1000.
Wei-Che Wang, Yizhang Wu, Puneet Gupta 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2020 SLATE: A Secure Lightweight Entity Authentication Hardware Primitive
abstract
Lightweight cryptography has become more and more important in recent years because of the rise of the Internet of Things (IoT) and usage of smart mobile devices. In this paper, we propose a novel secure lightweight entity authentication hardware primitive called SLATE, where its area is about 50% to more than 3X smaller than existing lightweight ciphers and strong physical unclonable functions (PUFs), respectively. Even though the authentication of SLATE is done through challenge response pair (CRP) verification similar to strong PUFs, the source of the key for SLATE must be coming from any existing secret key storage used for any ciphers. A main advantage of SLATE over most existing strong PUFs being an entity authentication primitive is that SLATE is resistant to known attacks to strong PUFs or logic obfuscations, such as model building attacks and Boolean satisfiability (SAT) attacks. Furthermore, we show that the implementation cost of SLATE with a 176-bit key and 244 CRPs is only 663 gate equivalents (GEs). Compared with lightweight ciphers and existing secure strong PUFs, we show that SLATE is a practical security primitive for resource constrained systems for its extremely small footprint and security. Finally, we show that SLATE is information theoretically secure when valid CRPs are communicated through insecure channels.
Wei-Che Wang, Yair Yona, Yizhang Wu, Suhas N. Diggavi, Puneet Gupta 0001
IEEE Trans. Inf. Forensics Secur.1
2018 Assessing Layout Density Benefits of Vertical Channel Devices
abstract
Vertical channel devices have been considered as promising candidates for sub-5 nm regime for the reduced area and large driving current. Several styles of layout designs and fabrication details of vertical channel devices have been proposed. However, due to the fast-changing manufacturing constraints for the advanced devices, the most efficient layout structures are still yet to be explored. In this paper, we study the efficiency in terms of cell area of in-bound power vertical channel device layout, which is potentially the most compact vertical layout style. We develop and implement an efficient vertical layout generation framework for in-bound power layout to provide a quick evaluation of cell area given design rules and choices of folding strategies. The results are compared to vertically stacked lateral channel devices and out-bound power vertical channel devices. Both cell-level and chip-level comparisons show that in-bound power layout is more area-efficient than lateral devices and vertical out-bound power layouts.
Wei-Che Wang, Charles Zhao, Puneet Gupta 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2018 Design and Analysis of Stability-Guaranteed PUFs
abstract
The lack of stability is one of the limitations that constrain physical unclonable function (PUF) from being put in widespread practical use. In this paper, we propose a weak PUF and a strong PUF that are both completely stable. These PUFs are called locally enhanced defectivity physical unclonable function (LEDPUF). An LEDPUF is a pure functional PUF that does not require any kinds of correction schemes as conventional parametric PUFs do. The source of randomness of an LEDPUF is extracted from locally enhance defectivity without affecting other parts of the chip. In this paper, we construct a weak LEDPUF by forming arrays of directed self-assembly random connections, and the strong LEDPUF is implemented by using the weak LEDPUF as the key of a keyed-hash message authentication code. Our simulation and statistical results show that the entropy of the weak LEDPUF bits is close to ideal, and the inter-chip Hamming distances of both weak and strong LEDPUFs are about 50%, which means that these LEDPUFs are not only stable but also unique. We develop a new unified framework for evaluating the security of PUFs, based on password security, by using information theoretic tools of guesswork. The guesswork model allows us to quantitatively compare, with a single unified metric, PUFs with varying levels of stability, bias, and available side information. In addition, it generalizes other measures to evaluate the security level, such as min-entropy and mutual information. We evaluate the guesswork-based security of some measured static random access memory and ring oscillator PUFs as an example and compare them with an LEDPUF to show that the stability has a more severe impact on the PUF security than biased responses. Furthermore, we find the guesswork of two new problems: guesswork under the probability of attack failure and the guesswork of strong PUFs that are used for authentication.
Wei-Che Wang, Yair Yona, Suhas N. Diggavi, Puneet Gupta 0001
IEEE Trans. Inf. Forensics Secur.1
2016 Efficient Layout Generation and Design Evaluation of Vertical Channel Devices
abstract
Vertical gate-all-around (VGAA) structure has been shown to be one of the most promising devices for the scaling beyond 10 nm for its reduced area, large driving current, and good gate control. Moreover, emerging devices such as heterojunction tunneling FETs are more amenable to vertical fabrication. However, past studies of vertical channel devices focused more on regular memory architectures and simple standard cells like inverters. Since naïve migration of regular FinFET layouts to vertical FETs yields little benefits, we identify several vertical efficient layout structures and propose novel layout generation heuristics for vertical channel devices. We also compare VGAA with symmetric and asymmetric source/drain architectures and different contact placement strategies. The layout efficiencies of several VGAA structures, vertical double-gate, lateral gate-all-around (LGAA), and FinFET are presented in our experiments. Routing congestion estimation on both cell-level and chip-level after placement and routing are also presented. We observe that even though most vertical channel standard cells have more diffusion gaps than lateral cells do, they still benefit from vertical architectures in area because of the vertically aligned top contacts. For asymmetric architectures, the area is larger than symmetric architectures because of the extra diffusion gaps needed, but our experiments indicate that for both symmetric and asymmetric architectures, vertical channel devices are likely to have a density advantage over lateral channel devices.
Wei-Che Wang, Puneet Gupta 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2014 Efficient layout generation and evaluation of vertical channel devices
abstract
Vertical gate-all-around (VGAA) has been shown to be one of the most promising devices for the scaling beyond 10nm for its reduced delay, large driving current, and good gate control. Moreover, emerging devices such as heterojunction tunneling FETs are more amenable to vertical fabrication. However, past studies of vertical channel devices focused more on regular memory architectures and simple standard cells like inverter. Since naive migration of regular FinFET layouts to vertical FETs yields little benefits, we identify several vertical efficient layout structures and propose novel layout generation heuristics for vertical channel devices. We also compare VGAA with symmetric and asymmetric source/drain architectures. The layout efficiencies of several VGAA structures, vertical double gate (VDG), lateral gate-all-around (LGAA), and FinFET are presented in our experiments. We observe that even though most vertical channel standard cells have more diffusion gaps than lateral cells do, they still benefit from vertical architectures in area because of the elimination of diffusion contacts. For asymmetric architectures, the area is larger than symmetric architectures because of the extra diffusion gaps needed, but our experiments indicate that for both symmetric and asymmetric architectures, vertical channel devices are likely to have a density advantage over lateral channel devices assuming that current drive strengths of both are similar.
Wei-Che Wang, Puneet Gupta 0001
ICCAD1