Security analysis and improvements for the IETF MLS standard for group messaging
From MaRDI portal
Publication:2096486
Recommendations
Cites work
- A formal security analysis of the Signal messaging protocol
- A quasipolynomial reduction for generalized selective decryption on trees
- Adaptive Security of Constrained PRFs
- Adaptive security of Yao's garbled circuits
- Be adaptive, avoid overcommitting
- Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity
- Efficient ratcheting: almost-optimal guarantees for secure messaging
- scientific article; zbMATH DE number 1024079 (Why is no real title available?)
- Optimal channel security against fine-grained state compromise: the safety of messaging
- Public key broadcast encryption for stateless receivers
- Ratcheted encryption and key exchange: the security of messaging
- Tackling Adaptive Corruptions in Multicast Encryption Protocols
- The double ratchet: security notions, proofs, and modularization for the signal protocol
- Towards bidirectional ratcheted key exchange
Cited in
(38)- Multicast key agreement, revisited
- Multi-designated receiver signed public key encryption
- CoCoA: concurrent continuous group key agreement
- The cost of adaptivity in security games on graphs
- Grafting key trees: efficient key management for overlapping groups
- Updatable public key encryption in the standard model
- Asymmetric group message franking: definitions and constructions
- Unidirectional updatable encryption and proxy re-encryption from DDH
- A more complete analysis of the signal double ratchet algorithm
- On the insider security of MLS
- Forward-secure encryption with fast forwarding
- On the worst-case inefficiency of CGKA
- On secure ratcheting with immediate decryption
- Strongly anonymous ratcheted key exchange
- On active attack detection in messaging with immediate decryption
- Fork-resilient continuous group key agreement
- Anonymous End to End Encryption Group Messaging Protocol Based on Asynchronous Ratchet Tree
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
- Towards secure asynchronous messaging with forward secrecy and mutual authentication
- On the cost of post-compromise security in concurrent continuous group-key agreement
- WhatsUpp with sender keys? Analysis, improvements and security proofs
- Efficient updatable public-key encryption from lattices
- Updatable public-key encryption, revisited
- Compact key storage. A modern approach to key backup and delegation
- Time-based attribute-based proxy re-encryption with decryption key update
- DeCAF: Decentralizable CGKA with fast healing
- Policy compliant secure messaging
- Continuous group-key agreement: concurrent updates without pruning
- GURKE: group unidirectional ratcheted key exchange
- Succinct PPRFs via memory-tight reductions
- Hollow LWE: a new spin. Unbounded updatable encryption from LWE and PCE
- Analyzing group chat encryption in MLS, Session, Signal, and Matrix
- Updatable public key encryption with strong CCA security: security analysis and efficient generic construction
- Towards leakage-resilient ratcheted key exchange
- Tightly-secure group key exchange with perfect forward secrecy
- Interval key-encapsulation mechanism
- ETK: external-operations TreeKEM and the security of MLS in RFC 9420
- Group key progression: strong security for shared persistent data
This page was built for publication: Security analysis and improvements for the IETF MLS standard for group messaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096486)
