Sectric: Towards Accurate, Privacy-preserving and Efficient Triangle Counting
Summary: Sectric is a server-aided, crypto-assisted LDP protocol for local triangle counting, matching central-DP accuracy without a trusted server. Its set-based neighbor representation improves efficiency over prior cryptographic graph-analysis methods. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Minze Xu (Nanjing University)
- 2. Zhentai Xie (Nanjing University)
- 3. Zhibin Wang (Nanjing University)
- 4. Guangzhan Wang (Nanjing University)
- 5. Longbin Lai (Alibaba)
- 6. Yuan Zhang (Nanjing University)
- 7. Chen Tian (Nanjing University)
- 8. Sheng Zhong (Nanjing University)
BibTeX Citation
@article{xu_vldb25,
title = {{Sectric: Towards Accurate, Privacy-preserving and Efficient Triangle Counting}},
author = {Xu, Minze and Xie, Zhentai and Wang, Zhibin and Wang, Guangzhan and Lai, Longbin and Zhang, Yuan and Tian, Chen and Zhong, Sheng},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {10},
pages = {3382--3395},
doi = {10.14778/3748191.3748202},
url = {https://doi.org/10.14778/3748191.3748202},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 100 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.0003396253 |
| 609 | Private Analysis of Graph Structure | 2011 | VLDB | 0.0001558459 |
| 5,428 | GraphOS: Towards Oblivious Graph Processing | 2023 | VLDB | 6.1329964e-05 |
| 5,560 | I/O-Efficient Butterfly Counting at Scale | 2023 | SIGMOD | 6.0822136e-05 |
| 6,129 | Cryptographically Secure Private Record Linkage Using Locality-Sensitive Hashing | 2024 | VLDB | 5.8756147e-05 |
| 6,911 | FedSQ: A Secure System for Federated Vector Similarity Queries | 2024 | VLDB | 5.6463599e-05 |
| 7,001 | RAGraph: A Region-Aware Framework for Geo-Distributed Graph Processing | 2024 | VLDB | 5.622486e-05 |
| 7,519 | SPG: Structure-Private Graph Database via SqueezePIR | 2023 | VLDB | 5.5023404e-05 |
| 11,400 | GraphAr: An Efficient Storage Scheme for Graph Data in Data Lakes | 2025 | VLDB | 4.9769913e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 854 | Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins | 2013 | SIGMOD |
| 2 | 8,652 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD |
| 3 | 264 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB |
| 4 | 2,012 | Private Release of Graph Statistics using Ladder Functions | 2015 | SIGMOD |
| 5 | 609 | Private Analysis of Graph Structure | 2011 | VLDB |
| 6 | 6,213 | Global and Local Differentially Private Release of Count-Weighted Graphs | 2023 | SIGMOD |
| 7 | 10,416 | Acyclic Graph Pattern Counting under Local Differential Privacy | 2026 | SIGMOD |
| 8 | 10,645 | Efficient and Effective Biclique Counting with Local Differential Privacy | 2026 | SIGMOD |
| 9 | 6,497 | Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy | 2025 | SIGMOD |
| 10 | 9,734 | Practical and Accurate Local Edge Differentially Private Graph Algorithms | 2025 | VLDB |