Transcript Franking for Encrypted Messaging

• URL: http://arxiv.org/abs/2507.19391v1
• Date: Fri, 25 Jul 2025 15:50:42 GMT
• Title: Transcript Franking for Encrypted Messaging
• Authors: Armin Namavari, Thomas Ristenpart,
• Abstract summary: We introduce transcript franking, a new type of protocol that allows reporting subsets of conversations.<n>We define syntax, semantics, and security for transcript franking in two-party and group messaging.
• Score: 14.460663943390266
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Message franking is an indispensable abuse mitigation tool for end-to-end encrypted (E2EE) messaging platforms. With it, users who receive harmful content can securely report that content to platform moderators. However, while real-world deployments of reporting require the disclosure of multiple messages, existing treatments of message franking only consider the report of a single message. As a result, there is a gap between the security goals achieved by constructions and those needed in practice. Our work introduces transcript franking, a new type of protocol that allows reporting subsets of conversations such that moderators can cryptographically verify message causality and contents. We define syntax, semantics, and security for transcript franking in two-party and group messaging. We then present efficient constructions for transcript franking and prove their security. Looking toward deployment considerations, we provide detailed discussion of how real-world messaging systems can incorporate our protocols.

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)
• Accountable, Scalable and DoS-resilient Secure Vehicular Communication [0.27624021966289597]
  broadcasted Cooperative Awareness Messages (CAMs) and Decentralized Environmental Notification Messages (DENMs) are pseudonymous authenticated for security and privacy protection.<n>This creates an asymmetry that can be easily exploited by external adversaries to launch a clogging Denial of Service (DoS) attack.<n>We propose efficient cryptographic constructs, which we term message verification facilitators, to prioritize processing resources for verification of potentially valid messages.
  arXiv  Detail & Related papers  (2025-05-28T09:25:34Z)
• Enforcing MAVLink Safety & Security Properties Via Refined Multiparty Session Types [0.11545092788508222]
  A compromised system component can issue message sequences that are legal while also leading the overall system into unsafe states.<n>We present initial results from ongoing work applying refined multiparty session types as a mechanism for expressing and enforcing proper message usage.<n>We illustrate our approach by using refined multiparty session types to mitigate safety and security issues in the MAVLink protocol commonly used in UAVs.
  arXiv  Detail & Related papers  (2025-01-31T03:56:35Z)
• Secure Semantic Communication With Homomorphic Encryption [52.5344514499035]
  This paper explores the feasibility of applying homomorphic encryption to SemCom.<n>We propose a task-oriented SemCom scheme secured through homomorphic encryption.
  arXiv  Detail & Related papers  (2025-01-17T13:26:14Z)
• Bytes to Schlep? Use a FEP: Hiding Protocol Metadata with Fully Encrypted Protocols [2.225268436173329]
  Fully Encrypted Protocols (FEPs) produce messages that appear completely random. FEPs have relevance well beyond censorship circumvention, as protecting protocol metadata has security and privacy benefits. We provide novel security definitions that capture the metadata-protection goals of FEPs.
  arXiv  Detail & Related papers  (2024-05-22T03:05:33Z)
• Silent Guardian: Protecting Text from Malicious Exploitation by Large Language Models [63.91178922306669]
  We introduce Silent Guardian, a text protection mechanism against large language models (LLMs) By carefully modifying the text to be protected, TPE can induce LLMs to first sample the end token, thus directly terminating the interaction. We show that SG can effectively protect the target text under various configurations and achieve almost 100% protection success rate in some cases.
  arXiv  Detail & Related papers  (2023-12-15T10:30:36Z)
• Reasoning over the Air: A Reasoning-based Implicit Semantic-Aware Communication Framework [124.6509194665514]
  A novel implicit semantic-aware communication (iSAC) architecture is proposed for representing, communicating, and interpreting the implicit semantic meaning between source and destination users. A projection-based semantic encoder is proposed to convert the high-dimensional graphical representation of explicit semantics into a low-dimensional semantic constellation space for efficient physical channel transmission. A generative adversarial imitation learning-based solution, called G-RML, is proposed to enable the destination user to learn and imitate the implicit semantic reasoning process of source user.
  arXiv  Detail & Related papers  (2023-06-20T01:32:27Z)
• One Protocol to Rule Them All? On Securing Interoperable Messaging [3.2213245974344673]
  European lawmakers have ruled that users should be able to exchange messages with each other. messaging interoperability opens up a Pandora's box of security and privacy challenges.
  arXiv  Detail & Related papers  (2023-03-24T17:40:52Z)
• Adversarial Learning for Implicit Semantic-Aware Communications [104.08383219177557]
  We develop a novel adversarial learning-based implicit semantic-aware communication architecture (iSAC) We prove that by applying iSAC, the destination user can always learn an inference rule that matches the true inference rule of the source messages. Experimental results show that the proposed iSAC can offer up to a 19.69 dB improvement over existing non-inferential communication solutions.
  arXiv  Detail & Related papers  (2023-01-27T08:28:12Z)
• Certifiably Robust Policy Learning against Adversarial Communication in Multi-agent Systems [51.6210785955659]
  Communication is important in many multi-agent reinforcement learning (MARL) problems for agents to share information and make good decisions. However, when deploying trained communicative agents in a real-world application where noise and potential attackers exist, the safety of communication-based policies becomes a severe issue that is underexplored. In this work, we consider an environment with $N$ agents, where the attacker may arbitrarily change the communication from any $CfracN-12$ agents to a victim agent.
  arXiv  Detail & Related papers  (2022-06-21T07:32:18Z)
• Robust and Verifiable Information Embedding Attacks to Deep Neural Networks via Error-Correcting Codes [81.85509264573948]
  In the era of deep learning, a user often leverages a third-party machine learning tool to train a deep neural network (DNN) classifier. In an information embedding attack, an attacker is the provider of a malicious third-party machine learning tool. In this work, we aim to design information embedding attacks that are verifiable and robust against popular post-processing methods.
  arXiv  Detail & Related papers  (2020-10-26T17:42:42Z)

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.