Yuefeng Du

Yuefeng Du

Auto-generated profile, based on publicly available information

Yuefeng Du

Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
19 May 2021 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
YDYuefeng Du
Yuefeng Du
HDHuayi Duan
Huayi Duan
AZAnxin Zhou
Anxin Zhou
CWCong Wang
Cong Wang
MAMan Ho Au
Man Ho Au
QWQian Wang
Qian Wang
As a promising alternative solution to cloud storage, decentralized storage networks (DSN) are widely anticipated to develop continuously and reshape the storage market share in the foreseeable future. In particular, one of the most important research problems is how to enforce the quality of service (QoS) in the context of storage solutions. Despite plenty of auditing-related works in the context of cloud storage, none of them can be directly applied to the decentralized storage paradigm. The challenges of designing a feasible storage auditing framework emanate from two aspects: 1) security problems unique to the decentralized settings and 2) performance overhead due to on-chain operations. In this article, we first put forward a basic storage auditing framework that satisfies the security and efficiency requirements, and outperforms the existing approaches. We also identify a critical and overlooked security problem that would compromise the integrity of storage auditing solutions in the blockchain paradigm. With our refined storage auditing design based on customized zero knowledge protocols, we propose a convenient mitigation solution in our revised security model. The evaluation results confirm that our solution would only incur a 10–15 percent increase in the overall auditing costs for common usage scenarios, compared to the basic design.

29 January 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
JWJian Weng
Jian Weng
SYShenglong Yao
Shenglong Yao
YDYuefeng Du
Yuefeng Du
JHJunjie Huang
Junjie Huang
JWJian Weng
Jian Weng
CWCong Wang
Cong Wang
The “Right to be Forgotten” rule in machine learning (ML) practice enables some individual data to be deleted from a trained model, as pursued by recently developed machine unlearning techniques. To truly comply with the rule, a natural and necessary step is to verify if the individual data are indeed deleted after unlearning. Yet, previous parameter-space verification metrics may be easily evaded by a distrustful model trainer. Thus, Thudi et al . recently present a call to action on algorithm-level verification in USENIX Security’22. We respond to the call, by reconsidering the unlearning problem in the scenario of machine learning as a service (MLaaS), and proposing a new definition framework for Proof of Unlearning (PoUL) on algorithm level. Specifically, our PoUL definitions ( i ) enforce correctness properties on both the pre and post phases of unlearning, so as to prevent the state-of-the-art forging attacks; ( ii ) highlight proper practicality requirements of both the prover and verifier sides with minimal invasiveness to the off-the-shelf service pipeline and computational workloads. Under the definition framework, we subsequently present a trusted hardware-empowered instantiation using SGX enclave, by logically incorporating an authentication layer for tracing the data lineage with a proving layer for supporting the audit of learning. We customize authenticated data structures to support large out-of-enclave storage with simple operation logic, and meanwhile, enable proving complex unlearning logic with affordable memory footprints in the enclave. We finally validate the feasibility of the proposed instantiation with a proof-of-concept implementation and multi-dimensional performance evaluation.

16 September 2019 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
CCChengjun Cai
Chengjun Cai
YZYifeng Zheng
Yifeng Zheng
YDYuefeng Du
Yuefeng Du
ZQZhan Qin
Zhan Qin
CWCong Wang
Cong Wang
Public blockchains have emerged as a promising direction in revolutionizing existing data-driven systems relying on centralized service providers. Among others, one kind of such systems is the popular crowdsensing systems which promise convenient data collection and aggregation. Although promising, leveraging public blockchains to build crowdsensing systems is non-trivial and has to overcome several barriers. Firstly, public blockchains are transparent and lack support for data privacy. Secondly, participants from the open blockchain environment may misbehave in serving crowdsensing applications, like providing invalid data or doing aggregation incorrectly. Further, on-chain processing incurs monetary cost, so simply putting all workload on-chain is highly uneconomical and a delicate joint on-chain and off-chain design is required. In this paper, we take the first research attempt and explore a new design point to bridge public blockchains with crowdsensing systems. We propose a framework for building private, robust, and verifiable blockchain-empowered crowdsensing systems. It features an open service paradigm where blockchain nodes can rent out their computing resources to serve crowdsensing applications, with custom and full-fledged mechanisms to foster a healthy and economical ecosystem and to simultaneously tackle the challenges of data privacy, robustness against misbehaving participants, and service correctness assurance. Extensive experiments demonstrate our design's practicality.

1 March 2019
Verified
Conference Paper
Closed access
HDHuayi Duan
Huayi Duan
YZYifeng Zheng
Yifeng Zheng
YDYuefeng Du
Yuefeng Du
AZAnxin Zhou
Anxin Zhou
CWCong Wang
Cong Wang
MAMan Ho Au
Man Ho Au
Crowdsensing, driven by the proliferation of sensor-rich mobile devices, has emerged as a promising data sensing and aggregation paradigm. Despite useful, traditional crowdsensing systems typically rely on a centralized third-party platform for data collection and processing, which leads to concerns like single point of failure and lack of operation transparency. Such centralization hinders the wide adoption of crowdsensing by wary participants. We therefore explore an alternative design space of building crowdsensing systems atop the emerging decentralized blockchain technology. While enjoying the benefits brought by the public blockchain, we endeavor to achieve a consolidated set of desirable security properties with a proper choreography of latest techniques and our customized designs. We allow data providers to safely contribute data to the transparent blockchain with the confidentiality guarantee on individual data and differential privacy on the aggregation result. Meanwhile, we ensure the service correctness of data aggregation and sanitization by delicately employing hardware-assisted transparent enclave. Furthermore, we maintain the robustness of our system against faulty data providers that submit invalid data, with a customized zero-knowledge range proof scheme. The experiment results demonstrate the high efficiency of our designs on both mobile client and SGX-enabled server, as well as reasonable on-chain monetary cost of running our task contract on Ethereum.

13 January 2022 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
HDHuayi Duan
Huayi Duan
YDYuefeng Du
Yuefeng Du
LZLeqian Zheng
Leqian Zheng
CWCong Wang
Cong Wang
MAMan Ho Au
Man Ho Au
QWQian Wang
Qian Wang
Decentralized storage (DS) projects such as Filecoin are gaining traction. Their openness mandates effective auditing mechanisms to assure users that their data remains intact. A blockchain is typically employed here as an unbiased public auditor. While the case for static data is relatively easy to handle, on-chain auditing of dynamic data with practical performance guarantees is still an open problem. Dynamic Proof-of-Storage (PoS) schemes developed for conventional cloud storage are not applicable to DS, since they require large storage proofs and/or large auditor states that are unmanageable by resource-constrained blockchains. To fill the gap, we propose a family of dynamic on-chain auditing protocols that can produce concretely small auditor states while retaining the compact proofs promised by static PoS schemes. Our design revolves around a set of succinct data structures and optimization techniques for index information management. With proper instantiation and realistic parameters, our protocols can achieve 0.25MB on-chain state and 1.2KB storage proof for the auditing of 1TB data, outperforming previous dynamic PoS schemes that are adaptable for DS by orders of magnitude. As another practical contribution, we introduce a data abstraction layer that allows one to deploy the auditing protocols on arbitrary storage systems hosting dynamic data.

27 August 2019 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
HCHelei Cui
Helei Cui
YZYajin Zhou
Yajin Zhou
CWCong Wang
Cong Wang
XWXinyu Wang
Xinyu Wang
YDYuefeng Du
Yuefeng Du
QWQian Wang
Qian Wang