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

Dingquan Huang

dblp:304/3537 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2021
—ORCID · none

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

Computer networks · 2 · 1 first-author · 2 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
Cryptographic protocols and secure computation · 100%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 77% Information retrieval · 23%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › secure query processing
verifiable query processing
0.512021
Verifiable Query Processing Over Outsourced Social Graph · IEEE/ACM Trans. Netw. 2021
Cryptographic protocols and secure computation › verifiable computation
query result verification
0.512021
Verifiable Query Processing Over Outsourced Social Graph · IEEE/ACM Trans. Netw. 2021
Cryptographic protocols and secure computation
verifiable computation
0.512021
Verifiable Query Processing Over Outsourced Social Graph · IEEE/ACM Trans. Netw. 2021
Information retrieval › web search › social search
social network search
0.112021
Verifiable Query Processing Over Outsourced Social Graph · IEEE/ACM Trans. Netw. 2021

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

cryptographic auxiliary information · 1.0
YearPublicationVenuePosition
2021 Private Distributed K-Means Clustering on Interval Data
abstract
K-means clustering has been heavily employed to mine valuable insights from interval data. Nevertheless, serious privacy leakage concerns are stumbling blocks impeding its widespread application. To quantify the privacy of small and large-scale interval data, we introduce two notions of α-Condensed Local Differential Privacy and ϵ-Local Differential Privacy, and propose two distance-aware perturbation mechanisms of α-exponential and square wave mechanisms. Rigorous theoretical analysis proves that our proposed mechanisms satisfy these two privacy notions. The experimental results built on multiple synthesized and real datasets show that our proposed mechanisms can provide more accurate clustering results than prior work, such as Randomized Response, Generalized Randomized Response, and Optimized Local Hash.
Dingquan Huang, Xin Yao 0002, Senquan An, Shengbing Ren
IPCCC1
2021 Verifiable Query Processing Over Outsourced Social Graph
abstract
Social data outsourcing is an emerging paradigm for effective and efficient access to the social data. In such a system, a third-party Social Data Provider (SDP) purchases social network datasets from Online Social Network (OSN) operators and then resells them to data consumers who can be any individuals or entities desiring social data through query interfaces. The SDP cannot be fully trusted and may return forged or incomplete query results to data consumers for various reasons, e.g., in favor of the businesses willing to pay. In this paper, we initiate the study on verifiable query processing over outsourced social graph whereby a data consumer can verify both the integrity and completeness of any query result returned by an untrusted SDP. We propose three schemes for single-attribute queries and another scheme for multi-attribute queries over outsourced social data. The four schemes all require the OSN provider to generate some cryptographic auxiliary information, based on which the SDP can construct a verification object to allow the data consumer to verify the integrity and completeness of the query result. They, however, differ in how the auxiliary information is generated and how the verification object is constructed and verified. Detailed analysis and extensive experiments using a real Twitter dataset confirm the efficacy and efficiency of the proposed schemes.
Xin Yao 0002, Rui Zhang 0007, Dingquan Huang
IEEE/ACM Trans. Netw.3