Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IET Information Security

Group-oriented cryptographic protocols

David Pointcheval

Published Aug 30, 2008• 0 citations
Publisher
DOI
10.1049/iet-ifs:20089019

Related papers

Cryptographic key distribution and authentication protocols for secure group communication

Andrew C. M. Hutchison, Kurt Bauknecht

IFIP advances in information and communication technology•Jan 1, 1996•1 citation

Device-Oriented Group Messaging: A Formal Cryptographic Analysis of Matrix’ Core

Martin R. Albrecht, Benjamin Dowling, Daniel Lee Jones

Focusing on its cryptographic core, we provide the first formal description of the Matrix secure group messaging protocol. Observing that no existing secure messaging model in the literature captures the relationships (and shared state) between users, their devices and the groups they are a part of, we introduce the Device-Oriented Group Messaging model to capture these key characteristics of the Matrix protocol. Utilising our new formalism, we determine that Matrix achieves the basic security notions of confidentiality and authentication, provided it introduces authenticated group membership. On the other hand, while the state sharing functionality in Matrix conflicts with advanced security notions in the literature – forward and post-compromise security – it enables features such as history sharing and account recovery, provoking broader questions about how such security notions should be conceptualised.

IEEE Symposium on Security and Privacy (S&P)•May 19, 2024•14 citations

Secure Composition of Cryptographic Protocols

Vipul Goyal

Lecture notes in computer science•Jan 1, 2011•0 citations

Secure Composition of Cryptographic Protocols

Vipul Goyal

Lecture notes in computer science•Jan 1, 2011•0 citations

Non-Interactive Secure Multiparty Key Establishment

Sigurd Eskeland

Abstract Cryptographic schemes that provide establishment of secret keys among a number of participants are generally known as conference key establishment schemes and key broadcasting schemes. In any case, such protocols provide secure establishment of group-oriented cryptographic keys, but with the costs of multiple transmissions of key establishment messages and in some cases multiple secret user keys. In this paper, we present a simple and straightforward efficient non-interactive group-oriented key establishment scheme that provides off-line computation of secret group keys, without computations and transmissions of key establishment messages

Tatra Mountains Mathematical Publications•Sep 1, 2014•2 citations

Cryptographic Protocols

Adam J. Elbirt

Auerbach Publications eBooks•Apr 9, 2009•0 citations
Focusing on its cryptographic core, we provide the first formal description of the Matrix secure group messaging protocol. Observing that no existing secure messaging model in the literature captures the relationships (and shared state) between users, their devices and the groups they are a part of, we introduce the Device-Oriented Group Messaging model to capture these key characteristics of the Matrix protocol. Utilising our new formalism, we determine that Matrix achieves the basic security notions of confidentiality and authentication, provided it introduces authenticated group membership. On the other hand, while the state sharing functionality in Matrix conflicts with advanced security notions in the literature – forward and post-compromise security – it enables features such as history sharing and account recovery, provoking broader questions about how such security notions should be conceptualised.
Abstract Cryptographic schemes that provide establishment of secret keys among a number of participants are generally known as conference key establishment schemes and key broadcasting schemes. In any case, such protocols provide secure establishment of group-oriented cryptographic keys, but with the costs of multiple transmissions of key establishment messages and in some cases multiple secret user keys. In this paper, we present a simple and straightforward efficient non-interactive group-oriented key establishment scheme that provides off-line computation of secret group keys, without computations and transmissions of key establishment messages