Mingzuo Xu

dblp:377/8217 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0002-5735-2379ORCID · reported

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

Databases, data management, data science and information retrieval · 1 · 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
Blockchain and cryptocurrency security · 100%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
range query
0.812024
MPV: Enabling Fine-Grained Query Authentication in Hybrid-Storage Blockchain · IEEE Trans. Knowl. Data Eng. 2024
Blockchain and cryptocurrency security › blockchain data management
blockchain database
0.812024
MPV: Enabling Fine-Grained Query Authentication in Hybrid-Storage Blockchain · IEEE Trans. Knowl. Data Eng. 2024
Blockchain and cryptocurrency security
verifiable query processing
0.812024
MPV: Enabling Fine-Grained Query Authentication in Hybrid-Storage Blockchain · IEEE Trans. Knowl. Data Eng. 2024

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

multi-dimensional parity-based verification · 1.5accumulator-based authenticated data structure · 1.5
YearPublicationVenuePosition
2024 MPV: Enabling Fine-Grained Query Authentication in Hybrid-Storage Blockchain
abstract
Due to the large-scale data streams produced by distributed terminals, hybrid-storage blockchain (HSB) that combines on-chain and off-chain storages has emerged as a promising solution for secure data storage in decentralized applications. Because all the raw data is outsourced to an untrusted service provider (SP), existing solutions suggest to utilize an on-chain authenticated data structure (ADS) to verify query results retrieved off-chain. However, existing solutions support onlycoarse-grained authenticationmaking a user abandon all the query results once the validation fails. In this paper, we focus on realizingfine-grained authenticationfor range queries, enabling a user to distinguish authentic data from falsified results. Considering the heavy gas consumption of on-chain storage, we propose two multi-dimensional parity-based verification (MPV) schemes with a trade-off between off-chain and on-chain efficiencies. Our main idea is to design an accumulator-based ADS to summarize well-designed verifiable hypercubes, so that fake results can be quickly located by combining multi-dimensional faces failed validation. Compared with previous solutions, our MPV schemes allow a user to make efficient use of query results by filtering out errors, and thus have higher data utility. The detailed security analysis and extensive experiments demonstrate the security and effectiveness of our MPV schemes, respectively.
Qin Liu 0001, Yu Peng 0003, Mingzuo Xu, Hongbo Jiang 0001, Jie Wu 0001, Tian Wang 0001, Tao Peng 0011, Guojun Wang 0001
IEEE Trans. Knowl. Data Eng.3