Pith. sign in

REVIEW 2 cited by

Analysis and Improvements of the Sender Keys Protocol for Group Messaging

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2301.07045 v2 pith:XYS25GV6 submitted 2023-01-17 cs.CR

classification cs.CR
keywords groupprotocolkeysmessagingsenderanalysiscryptographicimprovements
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Messaging between two parties and in the group setting has enjoyed widespread attention both in practice, and, more recently, from the cryptographic community. One of the main challenges in the area is constructing secure (end-to-end encrypted) and efficient messaging protocols for group conversations. The popular messaging applications WhatsApp and Signal utilise a protocol in which, instead of sharing a single group key, members have individual \textit{sender keys}, which are shared with all other group members. The Sender Keys protocol is claimed to offer forward security guarantees. However, despite its broad adoption in practice, it has never been studied formally in the cryptographic literature. In this paper we present the first analysis of the Sender Keys protocol along with some prospective improvements. To this end, we introduce a new cryptographic primitive, develop a game-based security model, present a security analysis in the passive and active settings, and propose several improvements to the protocol.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 3 citations worldwide. Full citation record

  1. Send and Pretend: Exploiting Transcript Consistency Issues in End-to-End Encrypted Group Chats

    cs.CR 2026-07 accept novelty 6.0 of 10

    All four major E2EE messengers fail to provide transcript consistency in group chats: a malicious member can silently equivocate, drop, or reorder messages and rig polls without triggering warnings.

  2. KoopAGRU: A Koopman-based Anomaly Detection in Time-Series using Gated Recurrent Units

    cs.LG 2025-01 conditional novelty 5.0 of 10

    KoopAGRU, a GRU-based Koopman model with FFT time-variant/invariant decomposition, reports an average F1 of 90.88% on five anomaly detection benchmarks, exceeding cited baselines.

Pith tools