YLYuanhong Li

Yuanhong Li

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

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


Yuanhong Li has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • FDXT: Forward and Backward Private Conjunctive Searchable Encryption to Suppress Volume Leakages Caused by Cross-Tags

    by Yuanhong Li, Peng Xu, Bochuan Zhang, Wei Wang, Yubo Zheng, Kaitai Liang

    Dynamic Searchable Symmetric Encryption (DSSE) allows clients to update data and search keywords securely over symmetrically encrypted data on an honest but curious server. Conjunctive DSSE, an attractive type of DSSE with expressive search, enables clients to find data containing multiple keywords simultaneously. However, recently proposed efficient conjunctive DSSE schemes, such as ODXT (in NDSS’21) and SDSSE-CQ (in PETS’25), all rely on cross-tag techniques and suffer from either forward privacy or volume-privacy leakages arising from conjunctive keywords, making them vulnerable to injection or leakage-abuse attacks. In this work, we analyze the aforementioned works in depth and design a new conjunctive DSSE scheme named FDXT. For any search query with multiple keywords, FDXT guarantees the forward privacy of all queried keywords. In contrast, ODXT only maintains the forward privacy of the single and first queried keyword. FDXT also avoids volume leakage compared with SDSSE-CQ. Finally, we compared FDXT with ODXT and SDSSE-CQ in terms of performance on the Crime, Wikipedia, and Enron datasets. The experimental results show that FDXT exhibits good performance, which is comparable to ODXT and significantly better than SDSSE-CQ.

  • Event-Oriented Linkable Group Signature From Lattice

    by Yongli Tang, Deng Pan, Qing Ye, Yuanhong Li, Jinxia Yu

    With the ever-increasing volume of transactions on e-commerce platforms, the protection of consumer privacy becomes a paramount concern. In this context, group signatures have proven to be an effective tool for the privacy-preserving of consumers. However, conventional group signature schemes are unable to effectively and flexibly control the number of user signatures. Moreover, with the advent of the post-quantum era, the existing cryptographic systems for electronic consumer systems, which rely on traditional number theory, will be undermined by quantum computation. This paper presents an event-oriented linkable group signature scheme from lattice that introduces a higher degree of flexibility in terms of signature control. Then, we prove its security in the random oracle model and based on the hardness of module short integer solution and module learning with errors. The security analysis shows that the scheme respectively achieves quantum security levels of 93-bit and 207-bit for two selected parameter sets. We have also evaluated the storage and time cost of the scheme, which indicates that our scheme is quite practical and could have a promising future in the consumer electronics sector.


  • Lattice-Based Group Signatures With Time-Bound Keys via Redactable Signatures

    by Yongli Tang, Yuanhong Li, Qing Ye, Debiao He

    Group signatures are active cryptographic topics where group members are granted right to sign messages anonymously on behalf of their group. However, in practical applications, such rights are not permanent in most cases and are usually limited to some time periods. This means that the signing right of each group member needs to be associated with time periods such that it can be automatically changed with the latter. Among the known approaches, verifier local revocation (VLR) seems to be the feasible one to implement the above functionality, but it will cause an inefficient verification process when the group size is large. In this paper, we describe a group signature scheme with time-bound keys, based on the hardness of lattice assumption, which implements the limitation of the signing right to any time period by constructing a lattice-based redactable signature scheme. Our scheme still adds VLR mechanism for some members who need to revoke prematurely, but the time-bound keys function ensures such members are only a small fraction that do not incur excessive cost for revocation check. We give implementation for our scheme under 93-bit and 207-bit security respectively to demonstrate the practicability – all costs are independent of the group size and achieve a relatively efficient level.


  • Open Access

    Improved Verifier-Based Three-Party Password-Authenticated Key Exchange Protocol from Ideal Lattices

    by Yongli Tang, Ying Li, Zongqu Zhao, Jing Zhang, Lina Ren, Yuanhong Li

    With the advent of large-scale social networks, two communication users need to generate session keys with the help of a remote server to communicate securely. In the existing three-party authenticated key exchange (3PAKE) protocols, users’ passwords need to be stored on the server; it cannot resist the server disclosure attack. To solve this security problem, we propose a more efficient 3PAKE protocol based on the verification element by adopting a public-key cryptosystem and approximate smooth projection hash (ASPH) function on an ideal lattice. Using the structure of separating authentication from the server, the user can negotiate the session key only after two rounds of communication. The analysis results show that it can improve the efficiency of computation and communication and resist the server disclosure attack, quantum algorithm attack, and replay attack; moreover, it has session key privacy to the server. This protocol can meet the performance requirement of the current communication network.