Yicheng Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yicheng Yu has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Baiho Sunagawa
School of Computing and Mathematics, Keele University, Newcastle ST5 5BG, UK
1 shared publication - Kai Zhang
Department of Computer Science and Engineering, National Chung Hsing University, Taichung 402, Taiwan
1 shared publication - Oliver Taylor
School of Engineering and Computer Science, University of Hull, Hull HU6 7RX, UK
1 shared publication - Rui Li
Department of Electrical and Computer Engineering, University of Texas at Dallas, Richardson, TX 75080, USA
1 shared publication
Latest Publications
- Open Access
- 7 April 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (8) , 798
An Extended Chaotic Map-Based Authentication and Key Agreement Scheme for Multi-Server Environment
With the increasing number of users and the emergence of different types of network services, a multi-server architecture has emerged in recent years. In order to ensure the secure communication of Internet participants in an open network environment, the authentication and key agreement protocol for multi-server architectures were proposed in the past. In 2018, Chatterjee et al. put forward a lightweight three-factor authentication and key agreement protocol for a multi-server environment, and they claimed that all known security features with satisfactory performance could be realized in their protocol. However, it is found that their scheme is vulnerable to user impersonation attacks and cannot achieve user un-traceability and three-factor security through our cryptanalysis. In order to solve these shortcomings, we propose a new lightweight and anonymous three-factor authentication scheme for the multi-server environment in this article. Furthermore, the proposed protocol is proved to be AKE secure theoretically, and we use BAN-logic to prove that our protocol realizes mutual authentication between communication participants. Finally, we show that our proposed scheme is practical and efficient through the comparison of security features and performance.
- 7 April 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (8) , 798
Open AccessAn Extended Chaotic Map-Based Authentication and Key Agreement Scheme for Multi-Server Environment
With the increasing number of users and the emergence of different types of network services, a multi-server architecture has emerged in recent years. In order to ensure the secure communication of Internet participants in an open network environment, the authentication and key agreement protocol for multi-server architectures were proposed in the past. In 2018, Chatterjee et al. put forward a lightweight three-factor authentication and key agreement protocol for a multi-server environment, and they claimed that all known security features with satisfactory performance could be realized in their protocol. However, it is found that their scheme is vulnerable to user impersonation attacks and cannot achieve user un-traceability and three-factor security through our cryptanalysis. In order to solve these shortcomings, we propose a new lightweight and anonymous three-factor authentication scheme for the multi-server environment in this article. Furthermore, the proposed protocol is proved to be AKE secure theoretically, and we use BAN-logic to prove that our protocol realizes mutual authentication between communication participants. Finally, we show that our proposed scheme is practical and efficient through the comparison of security features and performance.
- Open Access
- 7 March 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (5) , 569
An Enhancing Differential Evolution Algorithm with a Rank-Up Selection: RUSDE
Recently, the differential evolution (DE) algorithm has been widely used to solve many practical problems. However, DE may suffer from stagnation problems in the iteration process. Thus, we propose an enhancing differential evolution with a rank-up selection, named RUSDE. First, the rank-up individuals in the current population are selected and stored into a new archive; second, a debating mutation strategy is adopted in terms of the updating status of the current population to decide the parent’s selection. Both of the two methods can improve the performance of DE. We conducted numerical experiments based on various functions from CEC 2014, where the results demonstrated excellent performance of this algorithm. Furthermore, this algorithm is applied to the real-world optimization problem of the four-bar linkages, where the results show that the performance of RUSDE is better than other algorithms.
- 7 March 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (5) , 569
Open AccessAn Enhancing Differential Evolution Algorithm with a Rank-Up Selection: RUSDE
Recently, the differential evolution (DE) algorithm has been widely used to solve many practical problems. However, DE may suffer from stagnation problems in the iteration process. Thus, we propose an enhancing differential evolution with a rank-up selection, named RUSDE. First, the rank-up individuals in the current population are selected and stored into a new archive; second, a debating mutation strategy is adopted in terms of the updating status of the current population to decide the parent’s selection. Both of the two methods can improve the performance of DE. We conducted numerical experiments based on various functions from CEC 2014, where the results demonstrated excellent performance of this algorithm. Furthermore, this algorithm is applied to the real-world optimization problem of the four-bar linkages, where the results show that the performance of RUSDE is better than other algorithms.