Yipu Wu

dblp:93/3091 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

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

Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Network and information security
1 paper
Cryptographic protocols and secure computation · 77% Cryptographic primitives and cryptanalysis · 23%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 77% Data mining · 23%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › verifiable storage
proof of storage
0.812024
FileDES: A Secure, Scalable and Succinct Decentralized Encrypted Storage Network · INFOCOM 2024
Storage systems › distributed storage
decentralized storage network
0.812024
FileDES: A Secure, Scalable and Succinct Decentralized Encrypted Storage Network · INFOCOM 2024
Storage systems › secure storage
encrypted storage
0.812024
FileDES: A Secure, Scalable and Succinct Decentralized Encrypted Storage Network · INFOCOM 2024
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
batch verification
0.212024
FileDES: A Secure, Scalable and Succinct Decentralized Encrypted Storage Network · INFOCOM 2024
Data integration and cleaning
data extraction
0.112008
Extracting Loosely Structured Data Records Through Mining Strict Patterns · ICDE 2008
Data mining
pattern mining
0.012008
Extracting Loosely Structured Data Records Through Mining Strict Patterns · ICDE 2008

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

succinct proofs · 1.5rollup-based verification · 1.5tag tree feature extraction · 0.1content feature extraction · 0.1
YearPublicationVenuePosition
2024 FileDES: A Secure, Scalable and Succinct Decentralized Encrypted Storage Network
abstract
Decentralized Storage Network (DSN) is an emerging technology that challenges traditional cloud-based storage systems by consolidating storage capacities from independent providers and coordinating to provide decentralized storage and retrieval services. However, current DSNs face several challenges associated with data privacy and efficiency of the proof systems. To address these issues, we propose FileDES ( Decentralized Encrypted Storage), which incorporates three essential elements: privacy preservation, scalable storage proof, and batch verification. FileDES provides encrypted data storage while maintaining data availability, with a scalable Proof of Encrypted Storage (PoES) algorithm that is resilient to Sybil and Generation attacks. Additionally, we introduce a rollup-based batch verification approach to simultaneously verify multiple files using publicly verifiable succinct proofs. We conducted a comparative evaluation on FileDES, Filecoin, Storj and Sia under various conditions, including a WAN composed of up to 120 geographically dispersed nodes. Our protocol outperforms the others in terms of proof generation/verification efficiency, storage costs, and scalability.
Minghui Xu 0001, Jiahao Zhang 0003, Hechuan Guo, Xiuzhen Cheng, Dongxiao Yu, Qin Hu 0001, Yipu Wu
INFOCOM8
2009 Algorithm for Extracting Loosely Structured Data Records Through Digging Strict Patterns
Qing Li 0001, Yipu Wu
World Wide Web3
2008 Extracting Loosely Structured Data Records Through Mining Strict Patterns
abstract
Extracting loosely structured data records (DRs) has wide applications in many domains, such as forum pattern recognition, blog data analysis, and books and news review analysis. Currently existing methods work well for strongly structured DRs only. In this paper, we address the problem of extracting loosely structured DRs through mining strict patterns. In our method, we utilize both content feature and tag tree feature to recognize the loosely structured DRs, and propose a new approach to extract the DRs automatically. Through experimental study we demonstrate that this method is both effective and robust in practice.
Yipu Wu, Qing Li 0001
ICDE1