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

Songrui Wu

dblp:242/5134 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 first-author

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.

Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%
Network and information security
1 paper
Cryptographic protocols and secure computation · 50% Cryptographic primitives and cryptanalysis · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › secure query processing › encrypted query processing
encrypted range query
0.412019
ServeDB: Secure, Verifiable, and Efficient Range Queries on Outsourced Database · ICDE 2019
Query processing and optimization › range query
multidimensional range query
0.412019
ServeDB: Secure, Verifiable, and Efficient Range Queries on Outsourced Database · ICDE 2019
Cryptographic primitives and cryptanalysis › searchable encryption
range query over encrypted data
0.412019
ServeDB: Secure, Verifiable, and Efficient Range Queries on Outsourced Database · ICDE 2019
Cryptographic protocols and secure computation
secure query processing
0.412019
ServeDB: Secure, Verifiable, and Efficient Range Queries on Outsourced Database · ICDE 2019
Cloud and datacenter computing › database-as-a-service
outsourced database
0.112019
ServeDB: Secure, Verifiable, and Efficient Range Queries on Outsourced Database · ICDE 2019

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

secure tree index · 1.1hierarchical cube encoding · 1.1
YearPublicationVenuePosition
2019 ServeDB: Secure, Verifiable, and Efficient Range Queries on Outsourced Database
abstract
Data outsourcing to cloud has been a common IT practice nowadays due to its significant benefits. Meanwhile, security and privacy concerns are critical obstacles to hinder the further adoption of cloud. Although data encryption can mitigate the problem, it reduces the functionality of query processing, e.g., disabling SQL queries. Several schemes have been proposed to enable one-dimensional query on encrypted data, but multi-dimensional range query has not been well addressed. In this paper, we propose a secure and scalable scheme that can support multi-dimensional range queries over encrypted data. The proposed scheme has three salient features: (1) Privacy: the server cannot learn the contents of queries and data records during query processing. (2) Efficiency: we utilize hierarchical cubes to encode multi-dimensional data records and construct a secure tree index on top of such encoding to achieve sublinear query time. (3) Verifiability: our scheme allows users to verify the correctness and completeness of the query results to address server's malicious behaviors. We perform formal security analysis and comprehensive experimental evaluations. The results on real datasets demonstrate that our scheme achieves practical performance while guaranteeing data privacy and result integrity.
Songrui Wu, Qi Li 0002, Guoliang Li 0001, Dong Yuan 0006, Xingliang Yuan, Cong Wang 0001
ICDE1