Yanbin Zheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yanbin Zheng has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Yuyin Yu
School of Mathematics and Information Science Guangzhou University 510006 Guangzhou China
2 shared publications Aqing Yang
School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou, China
1 shared publication- Chunming Tang
School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China
1 shared publication - Dingyi Pei
School of Mathematics and Information Science Guangzhou University 510006 Guangzhou China
1 shared publication Fu Wang
Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology, Guilin 541004, China; (F.W.); (W.L.).
1 shared publication- Lei Zhang
School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou, China
1 shared publication
Latest Publications
- 25 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (7) , 7749-7762
EACAS: An Efficient Anonymous Cross-Domain Authentication Scheme in Internet of Vehicles
With continuous development of the Internet of Vehicles (IoV), intelligence is gradually becoming the mainstream trend of future transportation. However, the increasing number of vehicles and their high mobility also bring greater challenges to privacy and security. Most of the current authentication schemes in IoV focus on a single domain, ignoring the cross-domain requirements brought by high mobility. To address these issues better, we propose an efficient anonymous cross-domain authentication scheme EACAS based on elliptic curve cryptography within the certificate-less cryptography. We incorporate the secret sharing with digital signature to provide the trustworthy authentication for cross-domain vehicles, and the batch verification improves the efficiency of authentication. Besides, we also propose a hierarchical pseudonym method for multidomain scenarios, allowing vehicles to update pseudonyms at arbitrary locations and can be revealed. The formal security proof and analysis demonstrate the security characteristics, and the comprehensive performance evaluation shows the efficiency.
- 25 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (7) , 7749-7762
EACAS: An Efficient Anonymous Cross-Domain Authentication Scheme in Internet of Vehicles
With continuous development of the Internet of Vehicles (IoV), intelligence is gradually becoming the mainstream trend of future transportation. However, the increasing number of vehicles and their high mobility also bring greater challenges to privacy and security. Most of the current authentication schemes in IoV focus on a single domain, ignoring the cross-domain requirements brought by high mobility. To address these issues better, we propose an efficient anonymous cross-domain authentication scheme EACAS based on elliptic curve cryptography within the certificate-less cryptography. We incorporate the secret sharing with digital signature to provide the trustworthy authentication for cross-domain vehicles, and the batch verification improves the efficiency of authentication. Besides, we also propose a hierarchical pseudonym method for multidomain scenarios, allowing vehicles to update pseudonyms at arbitrary locations and can be revealed. The formal security proof and analysis demonstrate the security characteristics, and the comprehensive performance evaluation shows the efficiency.
- 1 April 2024
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 36 (5) , 1015-1031
Several new infinite classes of 0-APN power functions over $\mathbb {F}_{2^n}$- 1 April 2024
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 36 (5) , 1015-1031
Several new infinite classes of 0-APN power functions over $\mathbb {F}_{2^n}$- Open Access
- 15 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 168210-168218
Harden Deep Convolutional Classifiers via K-Means Reconstruction
Adversarial examples are carefully perturbed input examples that aim to mislead the deep neural network models into producing unexpected outputs. In this paper, we employ a K-means clustering algorithm as a pre-processing method to defend against adversarial examples. Specifically, we reconstruct adversarial examples according to their cluster assignments in pixel level to reduce the impact of the injected perturbation. Our approach does not rely on any neural network architectures and can also work with existing pre-processing defenses to provide better protection for modern classifiers. Comprehensive comparison and evaluation have been conducted to investigate our proposal, where the models protected by the proposed defense show substantial robustness to strong adversarial attacks. As a by-product of our exploration of ensemble defense, we identify that the order of defense methods has a crucial impact on the final performance. Additionally, the limitation of K-means reconstruction and the impact of the number of clusters have also been studied to provide an in-deep understanding of pre-processing defenses.
- 15 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 168210-168218
Open AccessHarden Deep Convolutional Classifiers via K-Means Reconstruction
Adversarial examples are carefully perturbed input examples that aim to mislead the deep neural network models into producing unexpected outputs. In this paper, we employ a K-means clustering algorithm as a pre-processing method to defend against adversarial examples. Specifically, we reconstruct adversarial examples according to their cluster assignments in pixel level to reduce the impact of the injected perturbation. Our approach does not rely on any neural network architectures and can also work with existing pre-processing defenses to provide better protection for modern classifiers. Comprehensive comparison and evaluation have been conducted to investigate our proposal, where the models protected by the proposed defense show substantial robustness to strong adversarial attacks. As a by-product of our exploration of ensemble defense, we identify that the order of defense methods has a crucial impact on the final performance. Additionally, the limitation of K-means reconstruction and the impact of the number of clusters have also been studied to provide an in-deep understanding of pre-processing defenses.
- 1 April 2019
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E102.A (4) , 680-684
A Note on Two Constructions of Zero-Difference Balanced Functions
Notes on two constructions of zero-difference balanced (ZDB) functions are made in this letter. Then ZDB functions over ℤe×∏ki=0 Fqi are obtained. And it shows that all the known ZDB functions using cyclotomic cosets over ℤn are special cases of a generic construction. Moreover, applications of these ZDB functions are presented.
- 1 April 2019
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E102.A (4) , 680-684
A Note on Two Constructions of Zero-Difference Balanced Functions
Notes on two constructions of zero-difference balanced (ZDB) functions are made in this letter. Then ZDB functions over ℤe×∏ki=0 Fqi are obtained. And it shows that all the known ZDB functions using cyclotomic cosets over ℤn are special cases of a generic construction. Moreover, applications of these ZDB functions are presented.
- Open Access
Piecewise constructions of inverses of cyclotomic mapping permutation polynomials
Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite fields.
Open AccessPiecewise constructions of inverses of cyclotomic mapping permutation polynomials
Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite fields.