Supporting Socially Constrained Private Communications with SecureWhispers

• URL: http://arxiv.org/abs/2508.12870v1
• Date: Mon, 18 Aug 2025 12:09:29 GMT
• Title: Supporting Socially Constrained Private Communications with SecureWhispers
• Authors: Vinod Khandkar, Kieron Ivy Turk, Ehsan Toreini, Nishanth Sastry,
• Abstract summary: We develop a method to create a shared secret between phones by shaking them together.<n>This paper proposes three different applications of this generated shared secret: message obfuscation, trust delegation, and encrypted beacons.
• Score: 4.612893264166371
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Rapidly changing social norms and national, legal, and political conditions socially constrain people from discussing sensitive topics such as sexuality or religion. Such constrained, vulnerable minorities are often worried about inadvertent information disclosure and may be unsure about the extent to which their communications are being monitored in public or semi-public spaces like workplaces or cafes. Personal devices extend trust to the digital domain, making it desirable to have strictly private communication between trusted devices. Currently, messaging services like WhatsApp provide alternative means for exchanging sensitive private information, while personal safety apps such as Noonlight enable private signaling. However, these rely on third-party mechanisms for secure and private communication, which may not be accessible for justifiable reasons, such as insecure internet access or companion device connections. In these cases, it is challenging to achieve communication that is strictly private between two devices instead of user accounts without any dependency on third-party infrastructure. The goal of this paper is to support private communications by setting up a shared secret between two or more devices without sending any data on the network. We develop a method to create a shared secret between phones by shaking them together. Each device extracts the shared randomness from the shake, then conditions the randomness to 7.798 bits per byte of key material. This paper proposes three different applications of this generated shared secret: message obfuscation, trust delegation, and encrypted beacons. We have implemented the message obfuscation on Android as an independent app that can be used for private communication with trusted contacts. We also present research on the usability, design considerations, and further integration of these tools in mainstream services.

Related papers

• User Perceptions and Attitudes Toward Untraceability in Messaging Platforms [4.724825031148412]
  We study user perceptions of "untraceability", i.e., preventing third parties from tracing who communicates with whom.<n>We find that users associate the concept of untraceability with a wide range of privacy enhancing technologies.<n>We discuss the gap between users' perceptions of untraceability and the threat models addressed by untraceable communication protocols.
  arXiv  Detail & Related papers  (2025-06-12T18:19:50Z)
• Synopsis: Secure and private trend inference from encrypted semantic embeddings [2.7998963147546148]
  We introduce Synopsis, a secure architecture for analyzing messaging trends in consensually-donated E2EE messages using message embeddings.<n>Since the goal of this system is investigative journalism, Synopsis must facilitate both exploratory and targeted analyses.<n> Evaluations on a dataset of Hindi-language WhatsApp messages demonstrate the efficiency and accuracy of our approach.
  arXiv  Detail & Related papers  (2025-05-29T17:34:10Z)
• Token-Level Privacy in Large Language Models [7.4143291213663955]
  We introduce dchi-stencil, a novel token-level privacy-preserving mechanism that integrates contextual and semantic information.<n>By incorporating both semantic and contextual nuances, dchi-stencil achieves a robust balance between privacy and utility.<n>This work highlights the potential of dchi-stencil to set a new standard for privacy-preserving NLP in modern, high-risk applications.
  arXiv  Detail & Related papers  (2025-03-05T16:27:25Z)
• 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)
• PrivacyLens: Evaluating Privacy Norm Awareness of Language Models in Action [54.11479432110771]
  PrivacyLens is a novel framework designed to extend privacy-sensitive seeds into expressive vignettes and further into agent trajectories.<n>We instantiate PrivacyLens with a collection of privacy norms grounded in privacy literature and crowdsourced seeds.<n>State-of-the-art LMs, like GPT-4 and Llama-3-70B, leak sensitive information in 25.68% and 38.69% of cases, even when prompted with privacy-enhancing instructions.
  arXiv  Detail & Related papers  (2024-08-29T17:58:38Z)
• Pudding: Private User Discovery in Anonymity Networks [9.474649136535705]
  Pudding is a novel private user discovery protocol. It hides contact relationships between users, prevents impersonation, and conceals which usernames are registered on the network. Pudding can be deployed on Loopix and Nym without changes to the underlying anonymity network protocol.
  arXiv  Detail & Related papers  (2023-11-17T19:06:08Z)
• 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)
• On Privacy and Confidentiality of Communications in Organizational Graphs [3.5270468102327004]
  This work shows how confidentiality is distinct from privacy in an enterprise context. It aims to formulate an approach to preserving confidentiality while leveraging principles from differential privacy.
  arXiv  Detail & Related papers  (2021-05-27T19:45:56Z)
• Mind the GAP: Security & Privacy Risks of Contact Tracing Apps [75.7995398006171]
  Google and Apple have jointly provided an API for exposure notification in order to implement decentralized contract tracing apps using Bluetooth Low Energy. We demonstrate that in real-world scenarios the GAP design is vulnerable to (i) profiling and possibly de-anonymizing persons, and (ii) relay-based wormhole attacks that basically can generate fake contacts.
  arXiv  Detail & Related papers  (2020-06-10T16:05:05Z)
• Secure Byzantine-Robust Machine Learning [61.03711813598128]
  We propose a secure two-server protocol that offers both input privacy and Byzantine-robustness. In addition, this protocol is communication-efficient, fault-tolerant and enjoys local differential privacy.
  arXiv  Detail & Related papers  (2020-06-08T16:55:15Z)
• InfoScrub: Towards Attribute Privacy by Targeted Obfuscation [77.49428268918703]
  We study techniques that allow individuals to limit the private information leaked in visual data. We tackle this problem in a novel image obfuscation framework. We find our approach generates obfuscated images faithful to the original input images, and additionally increase uncertainty by 6.2$times$ (or up to 0.85 bits) over the non-obfuscated counterparts.
  arXiv  Detail & Related papers  (2020-05-20T19:48:04Z)

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.