Demo Data from EDBT 2026 / reviewers in the wild / expert
Jianming Lin
dblp:269/8803
· DBLP profile ↗
5ranked-venue papers
3as first author
5since 2021 · last 2026
0009-0007-9144-1432ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › post-quantum cryptography
isogeny-based cryptography |
0.7 | 1 | 2023 | Faster Public-Key Compression of SIDH With Less Memory · IEEE Trans. Computers 2023 |
Cryptographic primitives and cryptanalysis
post-quantum cryptography |
0.7 | 1 | 2023 | Faster Public-Key Compression of SIDH With Less Memory · IEEE Trans. Computers 2023 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography › isogeny-based cryptography
supersingular isogeny diffie-hellman |
0.7 | 1 | 2023 | Faster Public-Key Compression of SIDH With Less Memory · IEEE Trans. Computers 2023 |
Cryptographic primitives and cryptanalysis › pairing-based cryptography
pairing computation |
0.2 | 1 | 2023 | Faster Public-Key Compression of SIDH With Less Memory · IEEE Trans. Computers 2023 |
Methods — techniques the papers use, named apart from their topics
pairing computation · 0.7discrete logarithm · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Biextensions in pairing-based cryptography
Jianming Lin, Damien Robert 0001, Changan Zhao |
Des. Codes Cryptogr. | 1 |
| 2025 | A Trustworthy and Traceable Identity Authentication Framework Leveraging Zero-Knowledge Proofs
Jianming Lin, Hui Li 0022, Niansheng Tang, Wenhui Hu, Runhuai Huang, Shengyao Wu |
IEEE Big Data | 1 |
| 2025 | Efficient Implementations of Square-root Vélu's Formulas
Jianming Lin, Weize Wang, Changan Zhao |
Inf. Process. Lett. | 1 |
| 2024 | Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees
Kaizhan Lin, Jianming Lin, Shiping Cai, Weize Wang, Changan Zhao |
Des. Codes Cryptogr. | 2 |
| 2023 | Faster Public-Key Compression of SIDH With Less MemoryabstractIn recent years, the isogeny-based protocol, namely supersingular isogeny Diffie-Hellman (SIDH) has become highly attractive for its small public key size. In addition, one can utilize several techniques to further compress the public key. However, compared to other post-quantum protocols, the computational cost of SIDH is relatively high, and so is that of its public-key compression. On the other hand, the storage for pairing computation and discrete logarithms to speed up the current implementation of the key compression is somewhat large. In this paper, we mainly improve the performance of public-key compression of SIDH, especially the efficiency and the storage of pairing computation involved. Our experimental results show that the memory requirement for pairing computation is reduced by a factor of about 1.5. Meanwhile, the instantiation of public-key compression of SIDH is$6.95\%--10.44\%$faster than the current state-of-the-art. Although SIKE is broken now, the techniques in this paper may benefit other isogeny-based cryptosystems which are still secure. Kaizhan Lin, Jianming Lin, Weize Wang, Changan Zhao |
IEEE Trans. Computers | 2 |