Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yongdong Ding

dblp:371/0189 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0004-4283-0130ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Computer networks
1 paper
Edge and fog computing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
data auditing
1.012026
CL-ERDA: Certificateless Recoverable Data Auditing With Corruption Localization in Edge Computing · IEEE Trans. Dependable Secur. Comput. 2026
Storage systems
storage reliability
1.012026
CL-ERDA: Certificateless Recoverable Data Auditing With Corruption Localization in Edge Computing · IEEE Trans. Dependable Secur. Comput. 2026
Edge and fog computing › edge data management
edge storage
0.312026
CL-ERDA: Certificateless Recoverable Data Auditing With Corruption Localization in Edge Computing · IEEE Trans. Dependable Secur. Comput. 2026

Methods — techniques the papers use, named apart from their topics

homomorphic authenticator · 3.0certificateless network coding signature · 3.0
YearPublicationVenuePosition
2026 CL-ERDA: Certificateless Recoverable Data Auditing With Corruption Localization in Edge Computing
abstract
Edge computing paradigm deploys infrastructures on users' edge side, enabling data to be stored in edge storage systems. Thus edge computing finds a balance between remote cloud storage with high latency and local storage with limited resources. However, the frequent update of edge data increases the probability of data corrupting. To ensure availability and integrity of edge data without affecting future use, this paper proposes a certificateLess edge recoverable data auditing (CL-ERDA) approach with corruption localization. First, the certificateless network coding signature in CL-ERDA is utilized to generate the homomorphic authenticator, addressing public key certificate management issues while avoiding insecure key escrow problems. Then, CL-ERDA designs a two-phase auditing method, where only file-level aggregation proofs are respond in first phase of external check and the second phase of self-check is launched only when damaged data is detected, reducing communication overhead of the auditing. Moreover, CL-ERDA combines hierarchical check method with batch localization method to achieve locating efficiently all the corrupted data at one time rather than locating only one corrupted data at once. Finally, security analysis shows that the proposed scheme resists various attacks and supports the unforgeability of authenticators. Experimental results demonstrate that CL-ERDA is efficient in auditing and corruption localization.
Yongdong Ding, Dengzhi Liu, Jun Shen 0006, Haowen Tan, Q. M. Jonathan Wu
IEEE Trans. Dependable Secur. Comput.1