MLS Group Messaging: How Zero-Knowledge Can Secure Updates

被引:4
|
作者
Devigne, Julien [1 ,2 ]
Duguey, Celine [1 ,2 ]
Fouque, Pierre-Alain [2 ,3 ]
机构
[1] DGA Maitrise Informat, Bruz, France
[2] Irisa, Rennes, France
[3] Univ Rennes1, CNRS, Rennes, France
来源
关键词
Cryptographic protocols; Messaging Layer Security - MLS; Secure messaging; Zero-knowledge;
D O I
10.1007/978-3-030-88428-4_29
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The Messaging Layer Security (MLS) protocol currently developed by the Internet Engineering Task Force (IETF) aims at providing a secure group messaging solution. MLS aims for end-to-end security, including Forward Secrecy and Post Compromise Secrecy, properties well studied for one-to-one protocols. It proposes a tree-based regular asynchronous update of the group secrets, where a single user can alone perform a complete update. A main drawback is that a malicious user can create a denial of service attack by sending invalid update information. In this work, we propose a solution to prevent this kind of attacks, giving a checkpoint role to the server that transmits the messages. In our solution, the user sends to the server a proof that the update has been computed correctly, without revealing any information about this update. We use a Zero-Knowledge (ZK) protocol together with verifiable encryption as building blocks. As a main contribution, we provide two different ZK protocols to prove knowledge of the input of a pseudo random function implemented as a circuit, given an algebraic commitment of the output and the input.
引用
收藏
页码:587 / 607
页数:21
相关论文
共 50 条
  • [1] Zero-knowledge proofs for finite field arithmetic, or:: Can zero-knowledge be for free?
    Cramer, R
    Damgård, I
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO'98, 1998, 1462 : 424 - 441
  • [2] Modular Design of Secure Group Messaging Protocols and the Security of MLS
    Alwen, Joel
    Coretti, Sandro
    Dodis, Yevgeniy
    Tselekounis, Yiannis
    [J]. CCS '21: PROCEEDINGS OF THE 2021 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2021, : 1463 - 1483
  • [3] Zero-knowledge proofs of knowledge for group homomorphisms
    Maurer, Ueli
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2015, 77 (2-3) : 663 - 676
  • [4] Zero-knowledge proofs of knowledge for group homomorphisms
    Ueli Maurer
    [J]. Designs, Codes and Cryptography, 2015, 77 : 663 - 676
  • [5] Zero-Knowledge from Secure Multiparty Computation
    Ishai, Yuval
    Kushilevitz, Eyal
    Ostrovsky, Rafail
    Sahai, Amit
    [J]. STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 21 - 30
  • [6] ZERO-KNOWLEDGE PROOFS FROM SECURE MULTIPARTY COMPUTATION
    Ishai, Yuval
    Kushilevitz, Eyal
    Ostrovsky, Rafail
    Sahai, Amit
    [J]. SIAM JOURNAL ON COMPUTING, 2009, 39 (03) : 1121 - 1152
  • [7] HOW TO UTILIZE THE RANDOMNESS OF ZERO-KNOWLEDGE PROOFS
    OKAMOTO, T
    OHTA, K
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 537 : 456 - 475
  • [8] Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
    Lindell, Yehuda
    Zarosim, Hila
    [J]. JOURNAL OF CRYPTOLOGY, 2011, 24 (04) : 761 - 799
  • [9] Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
    Lindell, Yehuda
    Zarosim, Hila
    [J]. THEORY OF CRYPTOGRAPHY, 6TH THEORY OF CRYPTOGRAPHY CONFERENCE, TCC 2009, 2009, 5444 : 183 - 201
  • [10] Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits
    Ganesh, Chaya
    Kondi, Yashvanth
    Patra, Arpita
    Sarkar, Pratik
    [J]. PUBLIC-KEY CRYPTOGRAPHY - PKC 2018, PT II, 2018, 10770 : 499 - 529