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

Information Sciences

Towards secure asynchronous messaging with forward secrecy and mutual authentication

Jianghong Wei, Xiaofeng Chen, Jianfeng Wang, Willy Susilo, Ilsun You

Published Jan 13, 2023• 18 citations
Publisher
DOI
10.1016/j.ins.2023.01.052

Related papers

SAID: Reshaping Signal into an Identity-Based Asynchronous Messaging Protocol with Authenticated Ratcheting

Olivier Blazy, Angèle Bossuat, Xavier Bultel +3 more

As messaging applications are becoming increasingly popular, it is of utmost importance to analyze their security and mitigate existing weaknesses. This paper focuses on one of the most acclaimed messaging applications: Signal. Signal is a protocol that provides end-to-end channel security, forward secrecy, and post-compromise security. These features are achieved thanks to a key-ratcheting mechanism that updates the key material at every message. Due to its high security impact, Signal's key-ratcheting has recently been formalized, along with an analysis of its security. In this paper, we revisit Signal, describing some attacks against the original design and proposing SAID: Signal Authenticated and IDentity-based. As the name indicates, our protocol relies on an identity-based setup, which allows us to dispense with Signal's centralized server. We use the identity-based long-term secrets to obtain persistent and explicit authentication, such that SAID achieves higher security guarantees than Signal. We prove the security of SAID not only in the Authenticated Key Exchange (AKE) model (as done by previous work), but also in the Authenticated and Confidential Channel Establishment (ACCE) model, which we adapted and redefined for SAID and asynchronous messaging protocols in general into a model we call identity-based Multistage Asynchronous Messaging (iMAM). We believe our model to be more faithful in particular to the true security of Signal, whose use of the message keys prevents them from achieving the composable guarantee claimed by previous analysis.

IEEE European Symposium on Security and Privacy•Jun 1, 2019•12 citations

Secure message transmission in asynchronous networks

Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar +2 more

Journal of Parallel and Distributed Computing•Apr 30, 2011•6 citations

Improved Strongly Deniable Authenticated Key Exchanges for Secure Messaging

Nik Unger, Ian Goldberg

Abstract A deniable authenticated key exchange (DAKE) protocol establishes a secure channel without producing cryptographic evidence of communication. A DAKE offersstrong deniabilityif transcripts provide no evidence even if long-term key material is compromised (offline deniability) and no outsider can obtain evidence even when interactively colluding with an insider (online deniability). Unfortunately, existing strongly deniable DAKEs have not been adopted by secure messaging tools due to security and deployability weaknesses. In this work, we propose three new strongly deniable key exchange protocols—DAKEZ, ZDH, and XZDH—that are designed to be used in modern secure messaging applications while eliminating the weaknesses of previous approaches. DAKEZ offers strong deniability in synchronous network environments, while ZDH and XZDH can be used to construct asynchronous secure messaging systems with offline and partial online deniability. DAKEZ and XZDH provide forward secrecy against active adversaries, and all three protocols can provide forward secrecy against future quantum adversaries while remaining classically secure if attacks against quantum-resistant cryptosystems are found. We seek to reduce barriers to adoption by describing our protocols from a practitioner’s perspective, including complete algebraic specifications, cryptographic primitive recommendations, and prototype implementations. We evaluate concrete instantiations of our DAKEs and show that they are the most efficient strongly deniable schemes; with all of our classical security guarantees, our exchanges require only 1 ms of CPU time on a typical desktop computer and at most 464 bytes of data transmission. Our constructions are nearly as efficient as key exchanges with weaker deniability, such as the ones used by the popular OTR and Signal protocols.

Proceedings on Privacy Enhancing Technologies•Jan 1, 2018•38 citations

Asynchronous Secure Communication Tolerating Mixed Adversaries

Kannan Srinathan, Mrinal Kumar, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2002•14 citations

Secure message transmission on directed networks

Jérôme Renault, Ludovic Renou, Tristan Tomala

Games and Economic Behavior•Feb 2, 2014•12 citations

Secure Quantum Relay Networks Using Distributed Entanglement without Classical Authentication

Asgar Hosseinnezhad, H. Sabri

Current quantum communication protocols rely heavily on classical authentication for message origin verification, leaving them vulnerable to evolving attacks that exploit classical trust assumptions. In this work, we propose a novel framework for secure quantum relay networks that completely avoids classical authentication. Instead, we leverage pre-distributed entanglement graphs and non-classical correlation-assisted decoding to enable exclusive message retrieval by designated nodes without broadcasting any key or handshake. The system routes messages across multiple relay nodes, yet ensures that no intermediate node can access the message unless it possesses the entangled state partner. We demonstrate that even in multi-path scenarios with asynchronous entanglement distribution, the protocol guarantees quantum-forward secrecy and end-to-end origin integrity without trusted intermediaries. Simulation results confirm both functionality and robustness under entanglement loss and imperfect detection. This architecture paves the way for scalable quantum communication systems where physical quantum states replace classical authentication mechanisms entirely.

arXiv:2507.05460•Jul 7, 2025•0 citations
As messaging applications are becoming increasingly popular, it is of utmost importance to analyze their security and mitigate existing weaknesses. This paper focuses on one of the most acclaimed messaging applications: Signal. Signal is a protocol that provides end-to-end channel security, forward secrecy, and post-compromise security. These features are achieved thanks to a key-ratcheting mechanism that updates the key material at every message. Due to its high security impact, Signal's key-ratcheting has recently been formalized, along with an analysis of its security. In this paper, we revisit Signal, describing some attacks against the original design and proposing SAID: Signal Authenticated and IDentity-based. As the name indicates, our protocol relies on an identity-based setup, which allows us to dispense with Signal's centralized server. We use the identity-based long-term secrets to obtain persistent and explicit authentication, such that SAID achieves higher security guarantees than Signal. We prove the security of SAID not only in the Authenticated Key Exchange (AKE) model (as done by previous work), but also in the Authenticated and Confidential Channel Establishment (ACCE) model, which we adapted and redefined for SAID and asynchronous messaging protocols in general into a model we call identity-based Multistage Asynchronous Messaging (iMAM). We believe our model to be more faithful in particular to the true security of Signal, whose use of the message keys prevents them from achieving the composable guarantee claimed by previous analysis.
Abstract A deniable authenticated key exchange (DAKE) protocol establishes a secure channel without producing cryptographic evidence of communication. A DAKE offersstrong deniabilityif transcripts provide no evidence even if long-term key material is compromised (offline deniability) and no outsider can obtain evidence even when interactively colluding with an insider (online deniability). Unfortunately, existing strongly deniable DAKEs have not been adopted by secure messaging tools due to security and deployability weaknesses. In this work, we propose three new strongly deniable key exchange protocols—DAKEZ, ZDH, and XZDH—that are designed to be used in modern secure messaging applications while eliminating the weaknesses of previous approaches. DAKEZ offers strong deniability in synchronous network environments, while ZDH and XZDH can be used to construct asynchronous secure messaging systems with offline and partial online deniability. DAKEZ and XZDH provide forward secrecy against active adversaries, and all three protocols can provide forward secrecy against future quantum adversaries while remaining classically secure if attacks against quantum-resistant cryptosystems are found. We seek to reduce barriers to adoption by describing our protocols from a practitioner’s perspective, including complete algebraic specifications, cryptographic primitive recommendations, and prototype implementations. We evaluate concrete instantiations of our DAKEs and show that they are the most efficient strongly deniable schemes; with all of our classical security guarantees, our exchanges require only 1 ms of CPU time on a typical desktop computer and at most 464 bytes of data transmission. Our constructions are nearly as efficient as key exchanges with weaker deniability, such as the ones used by the popular OTR and Signal protocols.
Current quantum communication protocols rely heavily on classical authentication for message origin verification, leaving them vulnerable to evolving attacks that exploit classical trust assumptions. In this work, we propose a novel framework for secure quantum relay networks that completely avoids classical authentication. Instead, we leverage pre-distributed entanglement graphs and non-classical correlation-assisted decoding to enable exclusive message retrieval by designated nodes without broadcasting any key or handshake. The system routes messages across multiple relay nodes, yet ensures that no intermediate node can access the message unless it possesses the entangled state partner. We demonstrate that even in multi-path scenarios with asynchronous entanglement distribution, the protocol guarantees quantum-forward secrecy and end-to-end origin integrity without trusted intermediaries. Simulation results confirm both functionality and robustness under entanglement loss and imperfect detection. This architecture paves the way for scalable quantum communication systems where physical quantum states replace classical authentication mechanisms entirely.