Metadata-private Messaging without Coordination

• URL: http://arxiv.org/abs/2504.19566v1
• Date: Mon, 28 Apr 2025 08:21:16 GMT
• Title: Metadata-private Messaging without Coordination
• Authors: Peipei Jiang, Yihao Wu, Lei Xu, Wentao Dong, Peiyuan Chen, Yulong Ming, Cong Wang, Xiaohua Jia, Qian Wang,
• Abstract summary: PingPong is an end-to-end system for metadata-private messaging.<n>It replaces the rigid "dial-before-converse" paradigm with a more flexible "notify-before-retrieval" workflow.<n>Pong achieves a level of usability akin to modern instant messaging systems.
• Score: 20.481776420813915
• License: http://creativecommons.org/licenses/by/4.0/
• 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 to validate our claims.

Related papers

• Trusted Machine Learning Models Unlock Private Inference for Problems Currently Infeasible with Cryptography [30.57370996703948]
  We argue that capable machine learning models can fulfill the role of a trusted third party.<n>This approach aims to achieve a balance between privacy and computational efficiency.<n>We show that even some simple classic cryptographic problems can already be solved with TCME.
  arXiv  Detail & Related papers  (2025-01-15T17:28:53Z)
• Echomix: a Strong Anonymity System with Messaging [0.0]
  Echomix is a practical mix network framework and a suite of associated protocols.<n>It is distinguished from other anonymity systems by a resistance to traffic analysis by global adversaries.<n>It features relatively low latency and bandwidth overhead.
  arXiv  Detail & Related papers  (2025-01-06T11:18:03Z)
• Collaborative Inference over Wireless Channels with Feature Differential Privacy [57.68286389879283]
  Collaborative inference among multiple wireless edge devices has the potential to significantly enhance Artificial Intelligence (AI) applications. transmitting extracted features poses a significant privacy risk, as sensitive personal data can be exposed during the process. We propose a novel privacy-preserving collaborative inference mechanism, wherein each edge device in the network secures the privacy of extracted features before transmitting them to a central server for inference.
  arXiv  Detail & Related papers  (2024-10-25T18:11:02Z)
• PSA: Private Set Alignment for Secure and Collaborative Analytics on Large-Scale Data [17.23761289654492]
  Two companies expect to securely join their datasets with respect to their common customers to maximize data insights. We proposed a solution, dubbed PSA, for this scenario, which is effectively applicable to real-world use cases. We implemented and benchmarked the proposed protocols in different network conditions by joining two datasets, each at the scale of one million records, in 35.5 sec on a single thread with a network bandwidth of 500 Mbps.
  arXiv  Detail & Related papers  (2024-10-07T04:39:14Z)
• Communication-Efficient Federated Knowledge Graph Embedding with Entity-Wise Top-K Sparsification [49.66272783945571]
  Federated Knowledge Graphs Embedding learning (FKGE) encounters challenges in communication efficiency stemming from the considerable size of parameters and extensive communication rounds. We propose bidirectional communication-efficient FedS based on Entity-Wise Top-K Sparsification strategy.
  arXiv  Detail & Related papers  (2024-06-19T05:26:02Z)
• Communication-Efficient Personalized Federated Learning for Speech-to-Text Tasks [64.02867484165476]
  To protect privacy and meet legal regulations, federated learning (FL) has gained significant attention for training speech-to-text (S2T) systems. The commonly used FL approach (i.e., textscFedAvg) in S2T tasks typically suffers from extensive communication overhead. We propose a personalized federated S2T framework that introduces textscFedLoRA, a lightweight LoRA module for client-side tuning and interaction with the server, and textscFedMem, a global model equipped with a $k$-near
  arXiv  Detail & Related papers  (2024-01-18T15:39:38Z)
• DP-OPT: Make Large Language Model Your Privacy-Preserving Prompt Engineer [57.04801796205638]
  Large Language Models (LLMs) have emerged as dominant tools for various tasks. However, concerns surrounding data privacy present obstacles due to the tuned prompts' dependency on sensitive private information. We present Differentially-Private Offsite Prompt Tuning (DP-OPT) to address this challenge.
  arXiv  Detail & Related papers  (2023-11-27T02:01:10Z)
• Breaking the Communication-Privacy-Accuracy Tradeoff with $f$-Differential Privacy [51.11280118806893]
  We consider a federated data analytics problem in which a server coordinates the collaborative data analysis of multiple users with privacy concerns and limited communication capability. We study the local differential privacy guarantees of discrete-valued mechanisms with finite output space through the lens of $f$-differential privacy (DP) More specifically, we advance the existing literature by deriving tight $f$-DP guarantees for a variety of discrete-valued mechanisms.
  arXiv  Detail & Related papers  (2023-02-19T16:58:53Z)
• Metadata Privacy Beyond Tunneling for Instant Messaging [0.0]
  We show that deniable traffic achieves metadata privacy against strong adversaries. We show that existing state-of-the-art protocols can be extended to support metadata privacy. We implement and evaluate a proof-of-concept instant messaging system running DenIM on top of unmodified Signal.
  arXiv  Detail & Related papers  (2022-10-23T16:32:35Z)
• SPAct: Self-supervised Privacy Preservation for Action Recognition [73.79886509500409]
  Existing approaches for mitigating privacy leakage in action recognition require privacy labels along with the action labels from the video dataset. Recent developments of self-supervised learning (SSL) have unleashed the untapped potential of the unlabeled data. We present a novel training framework which removes privacy information from input video in a self-supervised manner without requiring privacy labels.
  arXiv  Detail & Related papers  (2022-03-29T02:56:40Z)
• Privacy-Aware Time-Series Data Sharing with Deep Reinforcement Learning [33.42328078385098]
  We study the privacy-utility trade-off (PUT) in time-series data sharing. Methods that preserve the privacy for the current time may leak significant amount of information at the trace level. We consider sharing the distorted version of a user's true data sequence with an untrusted third party.
  arXiv  Detail & Related papers  (2020-03-04T18:47:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.