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

Peiyuan Chen

dblp:139/4500 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none

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

Computer networks · 1 · 1 since 2021Databases, 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
Network security · 56% Cryptographic protocols and secure computation · 28% Hardware security and side channels · 17%

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

TopicWeightPapersLastEvidence papers
Network security › anonymity networks › anonymous communication
anonymous messaging
1.012026
Anonymous Messaging Made More Flexible With PingPong · IEEE Trans. Netw. 2026
Network security › anonymity networks
metadata-private messaging
1.012026
Anonymous Messaging Made More Flexible With PingPong · IEEE Trans. Netw. 2026
Cryptographic protocols and secure computation › secure multiparty computation › oblivious computation
oblivious algorithms
1.012026
Anonymous Messaging Made More Flexible With PingPong · IEEE Trans. Netw. 2026
Hardware security and side channels › trusted execution environments
secure enclaves
0.312026
Anonymous Messaging Made More Flexible With PingPong · IEEE Trans. Netw. 2026
Hardware security and side channels
trusted execution environments
0.312026
Anonymous Messaging Made More Flexible With PingPong · IEEE Trans. Netw. 2026

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

secure enclaves · 1.0oblivious algorithms · 1.0
YearPublicationVenuePosition
2026 Anonymous Messaging Made More Flexible With PingPong
abstract
For those seeking end-to-end private communication free from pervasive metadata tracking and censorship, the Tor network has been the de-facto choice in practice, despite its susceptibility to traffic analysis attacks. Recently, numerous metadata-private messaging proposals have emerged with the aim to surpass Tor in the messaging context by obscuring the relationships between any two messaging buddies, even against global and active attackers. However, most of these systems face an undesirable usability constraint: they require a metadata-private “dialing” phase to establish mutual agreement and timing or round coordination before initiating any regular chats among users. This phase is not only resource-intensive but also inflexible, limiting users’ ability to manage multiple concurrent conversations seamlessly. For stringent privacy requirement, the often-enforced traffic uniformity further exacerbated the limitations of this roadblock. In this paper, we introduce PingPong, a new end-to-end system for metadata-private messaging designed to overcome these limitations. Under the same traffic uniformity requirement, PingPong replaces the rigid “dial-before-converse” paradigm with a more flexible “notify-before-retrieval” workflow. This workflow incorporates a metadata-private notification subsystem, PING, and a metadata-private message store, PONG. Both PING and PONG leverage hardware-assisted secure enclaves for performance and operates through a series of customized oblivious algorithms, while meeting the uniformity requirements for metadata protection. By allowing users to switch between conversations on demand, PingPong achieves a level of usability akin to modern instant messaging systems, while also offering improved performance and bandwidth utilization for goodput We have built a prototype of PingPong with 32 8-core servers equipped with enclaves and conducted a case study on a real-world messaging metadata dataset to validate our claims.
Peipei Jiang 0002, Lei Xu 0019, Peiyuan Chen, Yulong Ming, Cong Wang 0001, Xiaohua Jia, Qian Wang 0002
IEEE Trans. Netw.5
2025 Clustering-Guided Dynamic Social Network Graph Partitioning
Peiyuan Chen, Zhizhan Shen, Jianhua Cheng
DASFAA (4)2