Jingyu NIng

Dr. Jingyu NIng

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
25 October 2022 in Journal of the Brazilian Society of Mechanical Sciences and Engineering
Verified
Journal Article
Closed access
PDF file
ZTZhenhua Tan
Zhenhua Tan
JNJingyu NIng
Jingyu NIng
KPKai Peng
Kai Peng
ZXZhenche Xia
Zhenche Xia
DWDanke Wu
Danke Wu

1 January 2024 in IET Information Security
Verified
Journal Article
Open access
PDF file
JNJingyu NIng
Jingyu NIng
ZTZhenhua Tan
Zhenhua Tan
KZKaibing Zhang
Kaibing Zhang
WYWeizhong Ye
Weizhong Ye
Two‐party private set intersection (PSI) plays a pivotal role in secure two‐party computation protocols. The communication cost in a PSI protocol is normally influenced by the sizes of the participating parties. However, for parties with unbalanced sets, the communication costs of existing protocols mainly depend on the size of the larger set, leading to high communication cost. In this paper, we propose a low communication‐cost PSI protocol designed specifically for unbalanced two‐party private sets, aiming to enhance the efficiency of communication. For each item in the smaller set, the receiver queries whether it belongs to the larger set, such that the communication cost depends solely on the smaller set. The queries are implemented by private information retrieval which is constructed with trapdoor hash function. Our investigation indicates that in each instance of invoking the trapdoor hash function, the receiver is required to transmit both a hash key and an encoding key to the sender, thus incurring significant communication cost. In order to address this concern, we propose the utilization of a seed hash key, a seed encoding key, and a Latin square. By employing these components, the sender can autonomously generate all the necessary hash keys and encoding keys, obviating the multiple transmissions of such keys. The proposed protocol is provably secure against a semihonest adversary under the Decisional Diffie–Hellman assumption. Through implementation demonstration, we showcase that when the sizes of the two sets are 2 8 and 2 14 , the communication cost of our protocol is only 3.3% of the state‐of‐the‐art protocol and under 100 Kbps bandwidth, we achieve 1.46x speedup compared to the state‐of‐the‐art protocol. Our source code is available on GitHub: https://github.com/TAN-OpenLab/Unbanlanced-PSI .

1 January 2022
Verified
Book Chapter
Closed access
PDF file
WLWencheng Li
Wencheng Li
ZTZhenhua Tan
Zhenhua Tan
ZXZhenche Xia
Zhenche Xia
DWDanke Wu
Danke Wu
JNJingyu NIng
Jingyu NIng


18 June 2022 in arXiv
Verified
Preprint
Open access
PDF file
WLWencheng Li
Wencheng Li
ZTZhenhua Tan
Zhenhua Tan
JNJingyu NIng
Jingyu NIng
ZXZhenche Xia
Zhenche Xia
DWDanke Wu
Danke Wu
Speaker recognition using i-vector has been replaced by speaker recognition using deep learning. Speaker recognition based on Convolutional Neural Networks (CNNs) has been widely used in recent years, which learn low-level speech representations from raw waveforms. On this basis, a CNN architecture called SincNet proposes a kind of unique convolutional layer, which has achieved band-pass filters. Compared with standard CNNs, SincNet learns the low and high cut-off frequencies of each filter. This paper proposes an improved CNNs architecture called PF-Net, which encourages the first convolutional layer to implement more personalized filters than SincNet. PF-Net parameterizes the frequency domain shape and can realize band-pass filters by learning some deformation points in frequency domain. Compared with standard CNN, PF-Net can learn the characteristics of each filter. Compared with SincNet, PF-Net can learn more characteristic parameters, instead of only low and high cut-off frequencies. This provides a personalized filter bank for different tasks. As a result, our experiments show that the PF-Net converges faster than standard CNN and performs better than SincNet. Our code is available at github.com/TAN-OpenLab/PF-NET.