Demo Data from VLDB 2026 / reviewers in the wild / expert
Ranyang Liu
dblp:369/1160
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0002-4101-0793ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
3 papers |
Cryptographic protocols and secure computation · 67% Privacy and data protection · 33% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 100% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
private set intersection |
2.0 | 2 | 2026 | A Unified Framework of Private Set Operations With Stronger Security · IEEE Trans. Inf. Forensics Secur. 2026 Efficient Circuit-PSI and Extensions via Distributed Key-Value Store · IEEE Trans. Dependable Secur. Comput. 2026 |
Cryptographic protocols and secure computation › private set intersection
circuit-PSI |
1.0 | 1 | 2026 | Efficient Circuit-PSI and Extensions via Distributed Key-Value Store · IEEE Trans. Dependable Secur. Comput. 2026 |
Privacy and data protection
privacy-preserving data analysis |
1.0 | 1 | 2026 | SIsomap: Secure Collaborative Manifold Learning with Reducing Communication Costs · WWW 2026 |
Cryptographic protocols and secure computation › secure multiparty computation
private set operations |
1.0 | 1 | 2026 | A Unified Framework of Private Set Operations With Stronger Security · IEEE Trans. Inf. Forensics Secur. 2026 |
Privacy and data protection › privacy-preserving machine learning › collaborative learning
secure collaborative learning |
1.0 | 1 | 2026 | SIsomap: Secure Collaborative Manifold Learning with Reducing Communication Costs · WWW 2026 |
Privacy and data protection
privacy-preserving computation |
0.3 | 1 | 2026 | A Unified Framework of Private Set Operations With Stronger Security · IEEE Trans. Inf. Forensics Secur. 2026 |
Cryptographic protocols and secure computation
secret sharing |
0.3 | 1 | 2026 | SIsomap: Secure Collaborative Manifold Learning with Reducing Communication Costs · WWW 2026 |
Cryptographic protocols and secure computation
secure multiparty computation |
0.3 | 1 | 2026 | SIsomap: Secure Collaborative Manifold Learning with Reducing Communication Costs · WWW 2026 |
Storage systems › key-value storage
distributed key-value store |
0.3 | 1 | 2026 | Efficient Circuit-PSI and Extensions via Distributed Key-Value Store · IEEE Trans. Dependable Secur. Comput. 2026 |
Storage systems
key-value storage |
0.3 | 1 | 2026 | Efficient Circuit-PSI and Extensions via Distributed Key-Value Store · IEEE Trans. Dependable Secur. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
distributed key-value store · 2.0secure computation · 1.0secret sharing · 1.0isometric mapping · 1.0all-pairs shortest paths · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | SIsomap: Secure Collaborative Manifold Learning with Reducing Communication CostsabstractSecure manifold learning on datasets distributed among multiple data owners can benefit or even spawn many applications. For example, multiple service providers can jointly fit low-dimensional embeddings of their users' network behavior data to improve the accuracy of anomaly detection while addressing their privacy concerns about the datasets. In this paper, we focus on a classic manifold learning technique, known as isometric mapping (Isomap), and propose SIsomap, the first secure, distributed manifold learning system. We construct SIsomap based on secret sharing techniques and introduce careful optimizations. In particular, we propose two communication-efficient secure building blocks that focus on top-k and all-pairs shortest paths computation, respectively, and reduce secure operations by leveraging the characteristics of Isomap. Experimental results on both synthetic and real-world datasets demonstrate that our secure top-k and all-pairs shortest paths protocols are respectively up to 13.6× and 1818.5× faster than the state-of-the-art methods, and SIsomap as a whole is 11.1× to 28.8× faster than the baseline solution. Peizhao Zhou, Xiaojie Guo 0004, Pinzhi Chen, Ranyang Liu, Lihai Nie, Tong Li 0011, Zheli Liu |
WWW | 4 |
| 2026 | Efficient Circuit-PSI and Extensions via Distributed Key-Value Store
Ranyang Liu, Xiaojie Guo 0004, Tong Li 0011, Xiaofeng Chen 0001, Zheli Liu |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2026 | A Unified Framework of Private Set Operations With Stronger Security
Ranyang Liu, Xiaojie Guo 0004, Tong Li 0011, Zheli Liu |
IEEE Trans. Inf. Forensics Secur. | 1 |