Yilin Yuan

Yilin Yuan

Auto-generated profile, based on publicly available information

Yilin Yuan

Faculty of Information Technology, Beijing University of Technology, Beijing, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
4 October 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZZZhaoqian Zhang
Zhaoqian Zhang
JZJianbiao Zhang
Jianbiao Zhang
YYYilin Yuan
Yilin Yuan
ZLZheng Li
Zheng Li
As the public cloud becomes one of the leading ways in data-sharing nowadays, data confidentiality and user privacy are increasingly critical. Partially policy-hidden ciphertext policy attribute-based encryption (CP-ABE) can effectively protect data confidentiality while reducing privacy leakage by hiding part of the access structure. However, it cannot satisfy the need of data sharing in the public cloud with complex users and large amounts of data, both in terms of less expressive access structures and limited granularity of policy hiding. Moreover, the verification of access right to shared data and correctness of decryption are ignored or conducted by an untrusted third party, and the prime-order groups are seldom considered in the expressive policy-hidden schemes. This article proposes a fully policy-hidden CP-ABE scheme constructed on linear secret sharing scheme (LSSS) access structure and prime-order groups for public cloud data sharing. To help users decrypt, hidden vector encryption (HVE) with a “convert step” is applied, which is more compatible with CP-ABE. Meanwhile, decentralized credible verification of access right to shared data and correctness of decryption based on blockchain are also provided. We prove the security of our scheme rigorously and compare the scheme with others comprehensively. The results show that our scheme performs better.

10 January 2022 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
YYYilin Yuan
Yilin Yuan
JZJianbiao Zhang
Jianbiao Zhang
WXWanshan Xu
Wanshan Xu
ZLZheng Li
Zheng Li

1 July 2020 in IEEE Access
Verified
Journal Article
Open access
YYYilin Yuan
Yilin Yuan
JZJianbiao Zhang
Jianbiao Zhang
WXWanshan Xu
Wanshan Xu
In cloud storage scenarios, data security has received considerably more attention than before. To ensure the reliability and availability of outsourced data and improve disaster resilience and data recovery ability, important data files possessed by users must be stored on multiple cloud service providers (CSPs). However, we know that CSP is invariably not reliable. In this situation, to verify the integrity of replica files stored by users on multiple CSPs simultaneously, a new dynamic multiple-replica provable data possession (DMR-PDP) scheme is proposed. In addition, due to the importance of the tag set, we utilize vector dot products instead of using the modular power calculation in the traditional PDP scheme, which greatly reduces the calculation time and storage space usage. Moreover, a novel dynamic data structure, the divided addressversion mapping table (DAVMT), is presented and used to solve the problem of data dynamic operation. A practical experiment validates the effectiveness of our proposed scheme in the end.

1 March 2023 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
WXWanshan Xu
Wanshan Xu
JZJianbiao Zhang
Jianbiao Zhang
YYYilin Yuan
Yilin Yuan
XWXiao Wang
Xiao Wang

30 July 2020 in IEEE Access
Verified
Journal Article
Open access
XWXu Wanshan
Xu Wanshan
JZJianbiao Zhang
Jianbiao Zhang
YYYilin Yuan
Yilin Yuan
Under the cloud computing environment, Searchable Symmetric Encryption (SSE) is an effective method to solve the problem of encrypted data retrieval, and helps to protect the users’ privacy. Recent researches show that some attacks may bring great security threats to SSE, and forward privacy can effectively prevent these attacks, so forward privacy is very necessary for SSE scheme. Most of the existing forward privacy SSE schemes fall into two types: ORAM-based and Bost-based. The former is simple, but it has large communication overhead and low dynamic update efficiency. The latter is better than the former, but it is based on asymmetric encryption primitives. Based on symmetric encryption primitives, we propose a dynamic efficient forward privacy scheme DESSE in this paper. DESSE uses pseudo-random permutation to realize forward privacy, and uses delete list to identify the final state of the same file added and deleted repeatedly, so as to realize the dynamic update of data. The method proposed in this paper is simple and flexible in structure, takes up less additional space, and can significantly improve the efficiency of updating. At the same time, it can achieve real-time updating of data. The correctness of our proposed scheme is tested using the Enron email data set in the end.

9 December 2021 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
YYYilin Yuan
Yilin Yuan
JZJianbiao Zhang
Jianbiao Zhang
WXWanshan Xu
Wanshan Xu
ZLZheng Li
Zheng Li