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

Huiyu Tan

dblp:351/0539 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

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

Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%
Network and information security
1 paper
Hardware security and side channels · 100%

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

TopicWeightPapersLastEvidence papers
Hardware security and side channels › fault attacks
fault injection attack
0.812024
Compositional Verification of Cryptographic Circuits Against Fault Injection Attacks · FM (2) 2024
Electronic design automation › hardware verification and test › formal verification
compositional verification
0.812024
Compositional Verification of Cryptographic Circuits Against Fault Injection Attacks · FM (2) 2024
Electronic design automation › hardware verification and test
hardware verification
0.812024
Compositional Verification of Cryptographic Circuits Against Fault Injection Attacks · FM (2) 2024

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

SMT · 1.5SAT · 1.5BDD · 1.5
YearPublicationVenuePosition
2024 Compositional Verification of Cryptographic Circuits Against Fault Injection Attacks
abstract
Abstract Fault injection attack is a class of active, physical attacks against cryptographic circuits. The design and implementation of countermeasures against such attacks are intricate, error-prone and laborious, necessitating formal verification to guarantee their correctness. In this paper, we propose the first compositional verification approach for round-based hardware implementations of cryptographic algorithms. Our approach decomposes a circuit into a set of single-round sub-circuits which are verified individually by either SAT/SMT- or BDD-based tools. Our approach is implemented as an open-source tool , which is evaluated extensively on realistic cryptographic circuit benchmarks. The experimental results show that our approach is significantly more effective and efficient than the state-of-the-art.
Huiyu Tan, Fu Song, Taolue Chen 0001, Zhilin Wu
FM (2)1