Jingqiang Lin

Jingqiang Lin

Auto-generated profile, based on publicly available information

Jingqiang Lin

University of Science and Technology of China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 March 2020 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
ZWZe Wang
Ze Wang
JLJingqiang Lin
Jingqiang Lin
QCQuanwei Cai
Quanwei Cai
QWQiongxiao Wang
Qiongxiao Wang
DZDaren Zha
Daren Zha
JJJiwu Jing
Jiwu Jing
Traditional X.509 public key infrastructures (PKIs) depend on trusted certification authorities (CAs) to sign certificates, used in SSL/TLS to authenticate web servers and establish secure channels. However, recent security incidents indicate that CAs may (be compromised to) sign fraudulent certificates. In this paper, we propose blockchain-based certificate transparency (CT) and revocation transparency (RT) to balance the absolute authority of CAs. Our scheme is compatible with X.509 PKIs but significantly reinforces the security guarantees of a certificate. The CA-signed certificates and their revocation status information of an SSL/TLS web server are published by the subject (i.e., the web server) as a transaction in the global certificate blockchain. The certificate blockchain acts as append-only public logs to monitor CAs' certificate signing and revocation operations, and an SSL/TLS web server is granted with the cooperative control on its certificates. A browser compares the certificate received in SSL/TLS negotiations with the ones in the public certificate blockchain, and accepts it only if it is published and not revoked. We implement the prototype system with Firefox and Nginx, and the experimental results show that it introduces reasonable overheads.

31 March 2019 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
YMYuan Ma
Yuan Ma
TCTianyu Chen
Tianyu Chen
JLJingqiang Lin
Jingqiang Lin
JYJing Yang
Jing Yang
JJJiwu Jing
Jiwu Jing
True random number generators (TRNGs) are widely used in cryptographic systems, and their security is the base of many cryptographic algorithms and protocols. At present, entropy estimation based on a stochastic model is a well-recommended approach to evaluate the security of a specific TRNG structure. Besides, the generation speed is also an important property for TRNGs. For this purpose, an analog-to-digital converter (ADC) can be employed to sample the noisy signal to achieve high bit rate. However, no research focuses on the entropy estimation on the basis of the stochastic model toward ADC sampling. In this paper, we propose an entropy estimation for the ADC sampling-based TRNG through extending an existing model. In particular, we present an equivalent model to estimate the entropy of any single bit in the converted sample obtained by the ADC sampling. Furthermore, we propose a method of the entropy estimation for the multi-bit ADC output, which provides the lower bound of the entropy. By conducting simulations and hardware experiments on this type of TRNG, we confirm the correctness of the proposed entropy estimation theory. The prototype chip is fabricated in the SMIC 65-nm process, and the consumed power is 34 mW. The random bit sequences compatible with the AIS 31 standard are generated at a speed of 132.3 Mb/s. The sequences are able to pass the rigorous statistical test suites, including NIST SP 800-22, Diehard, and TestU01 (containing the Big Crush test), after simple post-processing at a bit rate of around 33 Mb/s.

27 August 2015
Verified
Book Chapter
Closed access
PDF file
SJShijie Jia
Shijie Jia
LXLuning Xia
Luning Xia
ZWZhan Wang
Zhan Wang
JLJingqiang Lin
Jingqiang Lin
GZGuozhu Zhang
Guozhu Zhang
YJYafei Ji
Yafei Ji

3 April 2023 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
RLRuixuan Li
Ruixuan Li
XJXiaofeng Jia
Xiaofeng Jia
ZZZhenyong Zhang
Zhenyong Zhang
JSJun Shao
Jun Shao
RLRongxing Lu
Rongxing Lu
GWGuiyi Wei
Guiyi Wei
The DNS privacy protection mechanisms, DNS over TLS (DoT) and DNS over HTTPS (DoH), only work correctly if both the server and client support the Strict Privacy profile and no vulnerability exists in the implemented TLS/HTTPS. A natural question then arises: what is the landscape of DNS Strict Privacy? To this end, we provide the first longitudinal and comprehensive measurement of DoT/DoH deployments in recursive resolvers, authoritative servers, and browsers. With the collected data, we find the number of DoT/DoH servers increased substantially during our ten-month-long scan. However, around 60% of DoT and 44% of DoH recursive resolver certificates are invalid. Worryingly, our measurements confirm the centralization problem of DoT/DoH. Furthermore, we classify DNS Strict Privacy servers into four levels according to daily scanning results on TLS/HTTPS-related security features. Unfortunately, around 25% of DoH Strict Privacy recursive resolvers fail to meet the minimum level requirements. To help the Internet community better perceive the landscape of DNS Strict Privacy, we implement a DoT/DoH server search engine and recommender system. Additionally, we investigate five popular browsers across four operating systems and find some inconsistent behavior with their DNS privacy implementations. For example, Firefox in Windows, Linux, and Android allows DoH communication with the server without the SAN certificate. At last, we advocate that all participants head together for a bright DNS Strict Privacy landscape by discussing current hindrances and controversies in DNS privacy.

5 December 2022
Verified
Conference Paper
Open access
WLWenqing Li
Wenqing Li
SJShijie Jia
Shijie Jia
LLLimin Liu
Limin Liu
FZFangyu Zheng
Fangyu Zheng
YMYuan Ma
Yuan Ma
JLJingqiang Lin
Jingqiang Lin
Cryptographic algorithms act as essential ingredients of all secure systems. However, the expected security guarantee from cryptographic algorithms often falls short in practice due to various cryptographic application programming interfaces (API) misuses. While many research studies target cryptographic API misuses in the cases of Java, C/C++ and Python, similar issues within the Go domain are still uncovered. In this work, we design and implement CryptoGo, a static analysis detector leveraging taint analysis technique to automatically identify cryptographic misuse of large-scale Go cryptographic projects. We derive 12 cryptographic rules coupled with Go cryptographic APIs and propose the idea of integrating cryptographic algorithm classification into cryptographic misuse detection for the first time, thus achieving precise detection of Go cryptographic API misuse and practical guidance of selecting appropriate cryptographic algorithms. We conduct five kinds of specific taint analyzers to perform backward or forward taint tracking on the APIs and arguments in the intermediate representation of the Go source code. Running on 120 open source Go cryptographic projects from GitHub, CryptoGo discovered that 83.33% of the Go cryptographic projects have at least one cryptographic misuse. It takes only 86.27 milliseconds per thousand lines of code on average for detection. We also disclose the discovered issues to the developers and collect their feedback. Our findings highlight the poor implementation and weak protection in the current Go cryptographic projects.

3 March 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
YFYu Fu
Yu Fu
YTYu Tong
Yu Tong
YNYijing Ning
Yijing Ning
TXTianshi Xu
Tianshi Xu
MLMeng Li
Meng Li
DFDengguo Feng
Dengguo Feng
With the widespread use of machine learning (ML), privacy concerns during neural network inference are attracting growing attention. Secure two-party neural network (2PC-NN) inference is the privacy-preserving inference method, which allows client to obtain the inference result without disclosing client’s input to the server. The server’s model parameters are also confidential to the client. However, current 2PC-NN inference schemes still have large overhead, especially for non-linear functions. In this paper, we present Swift, a fast secure 2PC-NN inference scheme based on fully homomorphic encryption (FHE) and secret sharing (SS). FHE protects the input and model parameters in linear functions, while SS is integrated to protect the non-linear functions. Concretely, Swift integrates FHE and SS to design secure and efficient non-linear protocols used for ReLU and max pooling. To further optimize performance, Swift employs FHE with computation-friendly coefficient encoding for fast execution of linear functions, and SIMD encoding for non-linear functions. Swift constructs efficient encoding conversion protocol between the coefficient-encoded ciphertext and the SIMD-encoded ciphertext. Finally, Swift achieves secure neural network inference framework for MNIST dataset. Compared with Cheetah (USENIX 2022), the execution time of ReLU, max pooling, secure inference under a WAN setting improves 7.4×, 13.3×, 1.9×, respectively.