首页> 外文会议>Annual International Cryptology Conference >Security Analysis and Improvements for the IETF MLS Standard for Group Messaging
【24h】

Security Analysis and Improvements for the IETF MLS Standard for Group Messaging

机译:用于群发消息的IETF MLS标准的安全性分析和改进

获取原文

摘要

Secure messaging (SM) protocols allow users to communicate securely over untrusted infrastructure. In contrast to most other secure communication protocols (such as TLS, SSH, or Wireguard), SM sessions may be long-lived (e.g., years) and highly asynchronous. In order to deal with likely state compromises of users during the lifetime of a session, SM protocols do not only protect authenticity and privacy, but they also guarantee forward secrecy (FS) and post-compromise security (PCS). The former ensures that messages sent and received before a state compromise remain secure, while the latter ensures that users can recover from state compromise as a consequence of normal protocol usage. SM has received considerable attention in the two-party case, where prior work has studied the well-known double-ratchet paradigm, in particular, and SM as a cryptographic primitive, in general. Unfortunately, this paradigm does not scale well to the problem of secure group messaging (SGM). In order to address the lack of satisfactory SGM protocols, the IETF has launched the message-layer security (MLS) working group, which aims to standardize an eponymous SGM protocol. In this work we analyze the TreeKEM protocol, which is at the core of the SGM protocol proposed by the MLS working group. On a positive note, we show that TreeKEM achieves PCS in isolation (and slightly more). However, we observe that the current version of TreeKEM does not provide an adequate form of FS. More precisely, our work proceeds by formally capturing the exact security of TreeKEM as a so-called continuous group key agreement (CGKA) protocol, which we believe to be a primitive of independent interest. To address the insecurity of TreeKEM, we propose a simple modification to TreeKEM inspired by recent work of Jost et al. (EUROCRYPT '19) and an idea due to Kohbrok (MLS Mailing List). We then show that the modified version of TreeKEM comes with almost no efficiency degradation but achieves optimal (according to MLS specification) CGKA security, including FS and PCS. Our work also lays out how a CGKA protocol can be used to design a full SGM protocol.
机译:安全消息传递(SM)协议允许用户在不受信任的基础结构上安全地进行通信。与大多数其他安全通信协议(例如TLS,SSH或Wireguard)相比,SM会话可能存在时间长(例如,几年)且高度异步。为了在会话的生存期内处理用户可能遭受的状态破坏,SM协议不仅保护真实性和私密性,而且还保证前向保密性(FS)和妥协后安全性(PCS)。前者确保状态妥协之前发送和接收的消息保持安全,而后者则确保用户可以由于正常协议使用而从状态妥协中恢复。在两方案例中,SM受到了相当大的关注,在先前的工作中,SM特别研究了著名的双棘轮范式,而SM通常作为一种加密原语。不幸的是,这种范例无法很好地解决安全组消息传递(SGM)问题。为了解决缺少令人满意的SGM协议的问题,IETF启动了消息层安全性(MLS)工作组,该工作组旨在标准化同名的SGM协议。在这项工作中,我们分析了TreeKEM协议,它是MLS工作组提出的SGM协议的核心。从积极的方面来看,我们证明了TreeKEM孤立地实现了PCS(还有更多)。但是,我们发现TreeKEM的当前版本没有提供适当形式的FS。更准确地说,我们的工作是通过正式捕获TreeKEM作为所谓的连续组密钥协议(CGKA)协议的确切安全性来进行的,我们认为这是具有独立利益的原始内容。为了解决TreeKEM的不安全性,我们根据Jost等人的最新工作提出了对TreeKEM的简单修改。 (EUROCRYPT '19)和Kohbrok提出的想法(MLS邮件列表)。然后,我们证明TreeKEM的修改版本几乎没有效率下降,但是达到了最佳的(根据MLS规范)CGKA安全性,包括FS和PCS。我们的工作还列出了如何使用CGKA协议来设计完整的SGM协议。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号