Advances in the development of quantum technologies force to create new methods of secure information transfer over insecure networks and channels. In this article, we analyze some important properties of secure group messaging resilient to quantum computer attacks: message authentication and asynchronous key update. We consider options for ensuring message authentication and detect the difference between the requirements for this property in group communications and point-to-point channels. We define the structure of key information and preshared key packages for the new protocol based on the classic X3DH protocol.
Advances in the development of quantum technologies force to create new methods of secure information transfer over insecure networks and channels. In this article, we analyze some important properties of secure group messaging resilient to quantum computer attacks: message authentication and asynchronous key update. We consider options for ensuring message authentication and detect the difference between the requirements for this property in group communications and point-to-point channels. We define the structure of key information and preshared key packages for the new protocol based on the classic X3DH protocol.
Due to development in quantum computing, we need to create and implement new cryptographic protocols, which are resistant to attacks using a quantum computer, in all practical cases. Last years humans became using messengers to transfer far more important information than earlier, so it is necessary to create new post-quantum secure messaging protocols for peer-to-peer and group communications. In this article, we describe needed security properties, existing ways for the creation of group chats, and our suggestions. We described ways and needed primitives for the creation of a group key establishment scheme based on isogenies of elliptic curves. We describe such protocol as an extended Double Ratchet protocol.
Quantum cryptography offers a way of key agreement, which is unbreakable by any external adversary. Authentication is of crucial importance, as perfect secrecy is worthless if the identity of the addressee cannot be ensured before sending important information. Message authentication has been studied thoroughly, but no approach seems to be able to explicitly counter meet-in-the-middle impersonation attacks. The goal of this paper is the development of an authentication scheme being resistant against active adversaries controlling the communication channel. The scheme is built on top of a key-establishment protocol and is unconditionally secure if built upon quantum cryptographic key exchange. In general, the security is the same as for the key-agreement protocol lying underneath.
Widely used communication and messaging protocols, e.g., TLS 1.3 and Signal, are insecure against an adversary with a quantum computer. We expect that post-quantum security will become mandatory for a new generation of cryptographic protocols in the nearest 10-15 years. The analysis of existing post-quantum secure cryptographic tools for key exchange, encryption and message authentication based on hard problems in codes, lattices, ring learning with errors and elliptic curve isogenies revealed their advantages and drawbacks. In particular, we conclude, that the main threat to communication and messaging protocols is only pre-quantum security of currently used Diffie-Hellman key exchange protocols. We summarize efficiency and safety results for each class of post-quantum cryptographic schemes and present an experimental implementation of isogeny-based Diffie-Hellman-like key exchange protocol as an illustration of their applicability.
The Signal Messenger recently introduced a new asynchronous key agreement protocol called PQXDH (Post-Quantum Extended Diffie-Hellman) that seeks to provide post-quantum forward secrecy, in addition to the authentication and confidentiality guaranteesalready provided by the previous X3DH (Extended Diffie-Hellman) protocol. More precisely, PQXDH seeks to protect the confidentiality of messages against harvest-now-decrypt-later attacks.In this work, we formally specify the PQXDH protocol and analyze its security using two formal verification tools, ProVerif and CryptoVerif. In particular, we ask whether PQXDH preserves the guarantees of X3DH, whether it provides post-quantum forward secrecy, and whether it can be securely deployed alongside X3DH. Our analysis identifies several flaws and potential vulnerabilities in the PQXDH specification, although these vulnerabilities are not exploitable in the Signal application, thanks to specific implementation choices which we describe in this paper. We collaborated with the protocol designers to develop an updated protocol specification based on our findings, where each change was formally verified and validated with a security proof. This work identifies some pitfalls that the community should be aware of when upgrading protocols to be post-quantum secure. It also demonstrates the utility of using formal verification hand-in-hand with protocol design.
Recent advances in quantum technology and the potential that practical quantum computers may become a reality in the future have led to renewed interest in developing cryptographic technologies that are secure against conventional and quantum attacks. Currently, virtually all asymmetric cryptographic schemes in use are threatened by the potential development of powerful quantum computers. Post-quantum cryptography is one of main the ways to combat this threat. Its security is based on the complexity of mathematical problems that are currently considered unsolvable efficiently, even with the help of quantum computers. The security of information systems is ensured through protection against various threats that use system vulnerabilities. Security protocols are the building blocks of secure communication. They implement security mechanisms to provide security services. Security protocols are considered abstract when analyzed, but may have additional vulnerabilities in implementation. This work contains a holistic study of security protocols. Basics of security protocols, taxonomy of attacks on security protocols and their implementation are considered, as well as various methods and models of protocol security analysis. In particular, the differences between information-theoretic and computational security, computational and symbolic models are specified. In addition, an overview of the computational security models for Authenticated Key Exchange (AKE) and Password Authentication Key Exchange (PAKE) protocols is provided. The most important security models for the AKE and PAKE protocols were also described. With the emergence of new technologies that may have different security requirements, as well as with increased opportunities for competition, there is always a need to develop new protocols. Thus, the purpose of this article is to review, classify, analyze, and research the vulnerabilities of information systems from classical, quantum, and special attacks, performed taking into account the forecast regarding the possibilities of attacks on post-quantum cryptographic transformations; studying security assessment models for existing cryptographic protocols, as well as reviewing and benchmarking security models and providing suggestions for protection against existing potential attacks.
As quantum computing technologies rapidly advance, distributed network communication systems are growing more susceptible to sophisticated cyber threats. This is likely to make traditional cryptographic algorithms used for authentication and secure communications vulnerable to attacks from quantum computers, requiring a new way to build quantum resilient security frameworks for distributed systems. In order to solve these security issues, this paper introduces a Quantum-Resilient Distributed Authentication Protocol (QR-DAP) to enable secure and reliable communication in distributed network systems. In the distributed environment, users or network nodes are registered with the unique identity credentials initially. The CRYSTALS-Kyber post-quantum cryptographic algorithm is then used to create secure public and private keys to protect from quantum computational attacks. After this, an HMAC-based mutual authentication mechanism is used to authenticate communicating nodes, to check the legitimacy of the messages, and to establish trusted communication among distributed entities. Successful authentication in a Quantum-Resistant Key Exchange mechanism to establish a secure session and secure sharing of shared keys, as well as confidential data transfer between network nodes. Lastly, the communication process incorporates the integration of SHA-3 hashing and HMAC verification techniques to validate the packets, verify the integrity, detect tampering, monitor the attacks and to ensure secure data authentication. Experimental validation shows that the proposed protocol can be used to increase the security level of authentication, reliability, confidentiality and integrity protection in distributed communication systems and make it more resistant to quantum attacks, while maintaining secure and efficient network communication.