FYFeng Yuan

Feng Yuan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Feng Yuan has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    PriTKT: A Blockchain-Enhanced Privacy-Preserving Electronic Ticket System for IoT Devices

    by Yonghua Zhan, Feng Yuan, Rui Shi, Guozhen Shi, Chen Dong

    Electronic tickets (e-tickets) are gradually being adopted as a substitute for paper-based tickets to bring convenience to customers, corporations, and governments. However, their adoption faces a number of practical challenges, such as flexibility, privacy, secure storage, and inability to deploy on IoT devices such as smartphones. These concerns motivate the current research on e-ticket systems, which seeks to ensure the unforgeability and authenticity of e-tickets while simultaneously protecting user privacy. Many existing schemes cannot fully satisfy all these requirements. To improve on the current state-of-the-art solutions, this paper constructs a blockchain-enhanced privacy-preserving e-ticket system for IoT devices, dubbed PriTKT, which is based on blockchain, structure-preserving signatures (SPS), unlinkable redactable signatures (URS), and zero-knowledge proofs (ZKP). It supports flexible policy-based ticket purchasing and ensures user unlinkability. According to the data minimization and revealing principle of GDPR, PriTKT empowers users to selectively disclose subsets of (necessary) attributes to sellers as long as the disclosed attributes satisfy ticket purchasing policies. In addition, benefiting from the decentralization and immutability of blockchain, effective detection and efficient tracing of double spending of e-tickets are supported in PriTKT. Considering the impracticality of existing e-tickets schemes with burdensome ZKPs, we replace them with URS/SPS or efficient ZKP to significantly improve the efficiency of ticket issuing and make it suitable for use on smartphones.


  • Verifiable Privacy-Preserving Federated Learning Under Multiple Encrypted Keys

    by Xiaoying Shen, Xue Luo, Feng Yuan, Baocang Wang, Yange Chen, Dianhua Tang, Le Gao

    Federated learning is a distributed learning helpful approach for resolving data privacy concerns and eliminating data silos. Homomorphic encryption is a vital technology for preserving user privacy in federated learning, and current studies are mainly concentrated on a single-key environment. However, if one user key is exposed in a single-key environment, it implies that the whole system key has been revealed. To strengthen security, we should allow different participants of federated learning to choose different keys to encrypt their local models. The cloud server should finish model aggregation calculation on ciphertexts under different public keys. Besides, research in this area is insufficient to guarantee mobile users’ data integrity verification and authentication in open channels. Therefore, this article proposes a privacy protection federated learning scheme VPFL based on the BCP cryptosystem, which can verify user identity and data integrity in a multikey environment. First, this scheme employs the BCP cryptosystem with double trapdoors for data encryption and transmission, enhancing the user’s privacy security. Second, a method for verifying user data integrity and identity was created utilizing bilinear aggregate signatures and verifiable secret sharing. It can effectively eliminate some incorrect data of some users. Third, VPFL tolerates users dropping out during training while still guaranteeing high accuracy. Finally, theoretical analysis and experimental evaluation indicate that the proposed scheme is efficient and secure.


  • Threshold Attribute-Based Credentials With Redactable Signature

    by Rui Shi, Huamin Feng, Yang Yang, Feng Yuan, Yingjiu Li, Hwee Hwa Pang, Robert H. Deng

    Threshold attribute-based credentials are suitable for decentralized systems such as blockchains as such systems generally assume that authenticity, confidentiality, and availability can still be guaranteed in the presence of a threshold number of dishonest or faulty nodes. Coconut (NDSS'19) was the first selective disclosure attribute-based credentials scheme supporting threshold issuance. However, it does not support threshold tracing of user identities and threshold revocation of user credentials, which is desired for internal governance such as identity management, data auditing, and accountability. The communication and computation complexities of Coconut for verifying credentials are linear in the number of each user's attributes and thus costly. Addressing these issues, we propose a novel efficient threshold attribute-based anonymous credential scheme. While retaining all the features of Coconut, our scheme supports threshold tracing of user identities and threshold revocation of user credentials, and it significantly reduces the computational and communication complexities of credential verification. In addition, we prove that our scheme enjoys strong security features, including anonymity, blindness, traceability, and non-frameability.