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

Junqing Liang

dblp:331/4188 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
0009-0006-0616-0584ORCID · reported

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

Security and privacy · 2 · 2 since 2021Systems, architecture and hardware · 1 · 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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 75% Security and privacy of machine learning · 25%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › block cipher
substitution-permutation network
1.012026
Securing Symmetric Encryption Based on Substitution-Permutation Network Against White-Box Attacks · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis
symmetric cryptography
1.012026
Securing Symmetric Encryption Based on Substitution-Permutation Network Against White-Box Attacks · IEEE Trans. Dependable Secur. Comput. 2026
Security and privacy of machine learning › adversarial attack
white-box attack
1.012026
Securing Symmetric Encryption Based on Substitution-Permutation Network Against White-Box Attacks · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis › cryptographic implementation
white-box cryptography
1.012026
Securing Symmetric Encryption Based on Substitution-Permutation Network Against White-Box Attacks · IEEE Trans. Dependable Secur. Comput. 2026

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

security analysis · 1.0experimental evaluation · 1.0
YearPublicationVenuePosition
2026 Securing Symmetric Encryption Based on Substitution-Permutation Network Against White-Box Attacks
abstract
Extensive research has been done on the security of symmetric encryption algorithms in the black-box attack contexts, where the execution platforms are supposed to be secure. Recent studies intend to secure encryption algorithms in a more challenging but widely adopted scenario, the white-attack context (WBAC), where the adversaries have full visibility of the implementations of cryptosystems and full control over execution platforms. Various of approaches for protecting symmetric encryption algorithms in the WBAC have been proposed. Unfortunately, most existing approaches have been broken. This paper proposes a novel approach for securing symmetric encryption algorithms based on substitution-permutation network (SPN). Our key idea is to incorporate additional secret components into lookup tables to expand and dramatically change the inner states of encryption. Unlike existing approaches, these components do not need to be annihilated in adjacent rounds, and the ciphertext remains essentially unchanged. To recover the plaintext, only simple operations and the standard decryption algorithm are required. Our approach can be applied to protect SPN-based symmetric encryption algorithms such as AES. Security analysis indicates that the approach is expected to be resistant to both existing and unknown attacks. Furthermore, experimental evaluation shows that our approach performs well on various platforms.
Yang Shi 0002, Tianchen Gao, Qiaoliang Ouyang, Junqing Liang, Mianhong Li, Jiayao Gao, Xiapu Luo
IEEE Trans. Dependable Secur. Comput.4
2024 SolsDB: Solve the Ethereum's bottleneck caused by storage engine
Cuihua Yang, Fangning Yang, Quanqing Xu, Junqing Liang
Future Gener. Comput. Syst.5
2022 Threshold EdDSA Signature for Blockchain-based Decentralized Finance Applications
abstract
The threshold digital signature technique is important for decentralized finance (DeFi) applications such as asset custody and cross-chain interoperations. The Edwards-curve digital signature algorithm (EdDSA) is widely used in blockchains, e.g., Libra/Diem; however, no suitable threshold solution exists. Therefore, to bridge this gap, we propose a threshold EdDSA that allows n parties to generate keys in a decentralized and distributed manner. Any t + 1-of-n parties can generate standard EdDSA signatures. This scheme supports an arbitrary threshold (t, n) and has been proven to be secure against at most t malicious adversaries. The theoretical analysis (computation complexity and communication footprints) and experimental results demonstrate that the proposed scheme performs efficiently on cloud servers and embedded devices. Furthermore, the proposed scheme is integrated with Tendermint, a blockchain framework that uses EdDSA, to generate keys and sign transactions in a decentralized manner, which indicates that this scheme is compatible with blockchains for supporting DeFi applications.
Yang Shi 0002, Junqing Liang, Mianhong Li, Tianchen Ma, Guodong Ye, Qinpei Zhao
RAID2