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

Jingjie Wu

dblp:37/1749 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1

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
1 paper
Cryptographic primitives and cryptanalysis · 67% Hardware security and side channels · 33%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
public-key cryptography
1.012026
Locality Does Matter: An Assessment Metric Adapted for Cluster-Based Side-Channel Analysis on Public Key Cryptosystems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Cryptographic primitives and cryptanalysis › public-key cryptography
RSA
1.012026
Locality Does Matter: An Assessment Metric Adapted for Cluster-Based Side-Channel Analysis on Public Key Cryptosystems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Hardware security and side channels
side-channel attack
1.012026
Locality Does Matter: An Assessment Metric Adapted for Cluster-Based Side-Channel Analysis on Public Key Cryptosystems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026

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

silhouette coefficient · 1.0clustering · 1.0adjacent distance coefficient · 1.0
YearPublicationVenuePosition
2026 Locality Does Matter: An Assessment Metric Adapted for Cluster-Based Side-Channel Analysis on Public Key Cryptosystems
abstract
Cluster-based side-channel analysis (SCA) is a commonly used side-channel analysis method for public key cryptography systems. This paper focuses on assessment metrics to improve the efficiency and accuracy of key recovery in cluster-based SCA processes. We introduce a novel metric called adjacent distance coefficient (AD coefficient). Different from traditional metrics like silhouette coefficient, membership degree, and information entropy, the AD coefficient, by considering local density and avoiding the computation of cluster centers, is less influenced by the shape and size of data, thereby overcoming limitations of traditional metrics. Experiments on RSA, SM2, and ECC demonstrate that the AD coefficient exhibits higher accuracy compared to traditional metrics, especially under conditions with noise and random delays, where it shows significant robustness. Incorporating the AD coefficient, we propose an assessment method to detect whether cryptographic devices are resistant to cluster-based SCA attacks, offering a convenient quantitative measure for the security evaluation of cryptographic devices.
Jinghong Ding, An Wang 0001, Congming Wei, Weiping Gong, Jingjie Wu, Liehuang Zhu
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.5
2005 An approach to measure the robustness of fuzzy reasoning
abstract
Fuzzy reasoning is intensively used in intelligent systems including fuzzy control, classification, expert systems, and networks to name a few dominant categories of such architectures. As being a fundamental construct permeating so many diverse areas, fuzzy reasoning was studied with respect to its fundamental properties such as robustness. The notion of robustness or sensitivity becomes of paramount importance by leading to a more comprehensive understanding of the way in which reasoning processes are developed. In this study, we introduce and study properties of some measures of robustness (or sensitivity) of fuzzy connectives and implication operators and discuss their relationships with perturbation properties of fuzzy sets. The results produced here are compared and contrasted with the previous findings available in the literature. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 393–413, 2005.
Yongming Li 0001, Dechao Li, Witold Pedrycz, Jingjie Wu
Int. J. Intell. Syst.4