Yan Zhu

Prof. Yan Zhu

school of computer and communication engineering, University of Science and Technology Beijing, Beijing, China
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
14 February 2012 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
Yan ZhuYan Zhu
Yan Zhu
HHHongxin Hu
Hongxin Hu
GAGail-Joon Ahn
Gail-Joon Ahn
MYMengyang Yu
Mengyang Yu
Provable data possession (PDP) is a technique for ensuring the integrity of data in storage outsourcing. In this paper, we address the construction of an efficient PDP scheme for distributed cloud storage to support the scalability of service and data migration, in which we consider the existence of multiple cloud service providers to cooperatively store and maintain the clients' data. We present a cooperative PDP (CPDP) scheme based on homomorphic verifiable response and hash index hierarchy. We prove the security of our scheme based on multiprover zero-knowledge proof system, which can satisfy completeness, knowledge soundness, and zero-knowledge properties. In addition, we articulate performance optimization mechanisms for our scheme, and in particular present an efficient method for selecting optimal parameter values to minimize the computation costs of clients and storage service providers. Our experiments show that our solution introduces lower computation and communication overheads in comparison with noncooperative approaches.

30 August 2011 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
Yan ZhuYan Zhu
Yan Zhu
GAGail-Joon Ahn
Gail-Joon Ahn
HHHongxin Hu
Hongxin Hu
SYStephen S. Yau
Stephen S. Yau
HAH. G. An
H. G. An
CHChang-Jun Hu
Chang-Jun Hu
In this paper, we propose a dynamic audit service for verifying the integrity of an untrusted and outsourced storage. Our audit service is constructed based on the techniques, fragment structure, random sampling, and index-hash table, supporting provable updates to outsourced data and timely anomaly detection. In addition, we propose a method based on probabilistic query and periodic verification for improving the performance of audit services. Our experimental results not only validate the effectiveness of our approaches, but also show our audit system verifies the integrity with lower computation overhead and requiring less extra storage for audit metadata.

21 March 2011
Verified
Conference Paper
Open access
Yan ZhuYan Zhu
Yan Zhu
HWHuaixi Wang
Huaixi Wang
ZHZexing Hu
Zexing Hu
GAGail-Joon Ahn
Gail-Joon Ahn
HHHongxin Hu
Hongxin Hu
SYStephen S. Yau
Stephen S. Yau

5 April 2016 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
BLBing Li
Bing Li
DHDijiang Huang
Dijiang Huang
ZWZhijie Wang
Zhijie Wang
Yan ZhuYan Zhu
Yan Zhu
Information Centric Networking (ICN) is a new network architecture that aims to overcome the weakness of existing IPbased networking architecture. Instead of establishing a connection between the communicating hosts, ICN focuses on the content, i.e., data, transmitted in network. Content copies in ICN can be cached at different locations. The content is out of its owner's control once it is published. Thus, enforcing access control policies on distributed content copies is crucial in ICN. Attribute-Based Encryption (ABE) is a feasible approach to enforce such control mechanisms in this environment. However, applying ABE in ICN faces two challenges: from management perspective, it is complicated to manage attributes in distributed manners; from privacy protection perspective, unlike in traditional networks, the enforced content access policies are public to all the ICN users. Thus, it is desirable that unauthorized content viewers are not able to retrieve the access policy. To this end, a privacy-preserving access control scheme for ICN and its corresponding attribute management solution are presented in this paper. The proposed approach is compatible with existing flat name based ICN architectures.

1 May 2012 in Journal of Systems and Software
Verified
Journal Article
Closed access
Yan ZhuYan Zhu
Yan Zhu
HHHongxin Hu
Hongxin Hu
GAGail-Joon Ahn
Gail-Joon Ahn
SYStephen S. Yau
Stephen S. Yau

1 March 2016
Verified
Conference Paper
Closed access
WTWei-Tek Tsai
Wei-Tek Tsai
RBRobert Blower
Robert Blower
Yan ZhuYan Zhu
Yan Zhu
LYLian Yu
Lian Yu
Blockchain (BC) has received significant attention recently. This paper presents system-related issues for BCs for financial applications. This paper first presents the design of a BC without consideration of any application scenarios, and issues such as performance, security, performance and scalability lead to specific BC designs. Sample BC scenarios are analyzed and these lead to additional BC designs. Specifically, two new kinds of BC emerge: for storing information at transactional level, for storing account information. By splitting traditional BCs into these two BCs allow one to optimize the system with respect to scalability and privacy.