Summary The mobile satellite communication (MSC) system represents a crucial means of communication, facilitating connections between mobile users and network control centres through satellites. Given the wireless nature of satellite communication, ensuring communication security is paramount for maintaining accountability. Key exchange and authentication (KEA) mechanisms are commonly employed to secure data transmitted over insecure or open channels. Developing a lattice‐based KEA protocol for MSC systems is imperative to achieve both quantum security and efficient communication. In this direction, Yadav et al. devised ring learning with an error‐based KEA technique to ensure a quantum‐safe environment. Their scheme is quantum‐safe and satisfies desirable security attributes but has low efficiency in computation. Moreover, we have identified that their scheme is susceptible to denial of service attack and session key established at user and NCC ends is different. To overcome the flaws of Yadav et al., we propose a lattice‐based KEA protocol for the MSC system to improve computation efficiency, and get resistance against key mismatch attack. The security analysis of the proposed scheme is presented in the random oracle model. Comparative study is also presented to observe advantages in computation efficiency.
Summary The mobile satellite communication (MSC) system represents a crucial means of communication, facilitating connections between mobile users and network control centres through satellites. Given the wireless nature of satellite communication, ensuring communication security is paramount for maintaining accountability. Key exchange and authentication (KEA) mechanisms are commonly employed to secure data transmitted over insecure or open channels. Developing a lattice‐based KEA protocol for MSC systems is imperative to achieve both quantum security and efficient communication. In this direction, Yadav et al. devised ring learning with an error‐based KEA technique to ensure a quantum‐safe environment. Their scheme is quantum‐safe and satisfies desirable security attributes but has low efficiency in computation. Moreover, we have identified that their scheme is susceptible to denial of service attack and session key established at user and NCC ends is different. To overcome the flaws of Yadav et al., we propose a lattice‐based KEA protocol for the MSC system to improve computation efficiency, and get resistance against key mismatch attack. The security analysis of the proposed scheme is presented in the random oracle model. Comparative study is also presented to observe advantages in computation efficiency.
Summary The mobile satellite communication (MSC) system is a vital communication method in which mobile users and network control centers connect via satellites. Since the satellite's communication is wireless, communication security is a critical factor to ensure accountable communication. Key exchange and authentication (KEA) mechanism is widely used to achieve data security for data transmitted in an insecure or open channel. Different authentication systems are suggested in the last many years to establish safe communication, whereas most existing security protocols are based on factorization or discrete logarithm. However, these systems are no longer reliable by Shor's algorithm as any discrete logarithm and factorization can be resolved in polynomial time on quantum computers. Thus, developing a quantum secure KEA protocol for MSC systems is necessary. In this direction, recently a ring learning with an error‐based KEA technique is proposed to ensure a quantum‐safe environment. This scheme is quantum‐safe and satisfies desirable security attributes but has low efficiency in computation and communication. Moreover, establishing a secure session requires six communications among involved entities. As a result, replay attack detection at an early stage is not possible for the central authority (server), which could delay the server response, and the adversary gets the advantage of drawing a denial of service scenario for authorized entities. We propose a lattice‐based KEA protocol for the MSC system to improve computation, communication efficiency, and early‐stage replay attack detection. The security analysis of the proposed scheme is presented in the random oracle model. Calculation of performance is also presented to observe advantages in computation and communication overhead.
Abstract Due to the rapid development of mobile communication and hardware technologies, several mobile‐based web applications have gained popularity among mobile users. Mobile users can utilize these devices to access numerous services over the Internet. To ensure secure communication, different key exchange and authentication (KEA) protocols are proposed and frequently used. However, due to the advent of quantum computers, numerous quantum‐safe KEA protocols are also developed using various complex mathematical problems in ideal lattices. As it is an emerging and developing area, we analyze the security of recently suggested ring learning with error based KEA protocols. The goal of this study is to gain a comprehensive understanding of quantum‐safe KEA mechanisms. For our study, we have considered Dharminder's LWE‐based KEA mechanism and Dharminder and Chandran's LWE‐based KEA mechanism. These protocols enable effective communication and provide a better means for safely transmitting messages between user and server. However, we have discovered that a fundamental security weakness in these methods makes them vulnerable to signal leakage attacks (SLA). Based on our analysis, we demonstrated security weakness against SLA and provide the road‐map for secure construction.
ABSTRACT A three‐party post‐quantum key agreement protocol involves server with two communicating parties securely agreeing on a shared secret key in a way that is resistant to quantum attacks. Once the shared secret key is shared using authenticated key agreement protocol, then user (A), and user (B) can use it for securing communication channel using symmetric‐key encryption AES‐256 algorithm. Although there are few third‐party post‐quantum authenticated and key agreement schemes exist, but the recent studies in this paper illustrates that they are not satisfying properties like unlinkability, anonymity, perfect forward secrecy, and signal leakage attacks. Therefore, the proposed protocol ensures anonymity, unlinkablity, perfect forward secrecy, and resistant against signal leakage attacks. The proposed protocol uses different random numbers for each of sessions and ensures freshness of the session key to maintain forward secrecy. In this protocol, the user (A) only communicates with server, and establish an authenticated session key with user (B) which avoids server overheads. The use of ring learning with errors (RLWE) instead of the simpler learning with errors (LWE) is primarily motivated by the need for efficiency, compactness, and scalability in cryptographic applications. A comparative study, including both performance and security assessments, demonstrates that the proposed design is more secure and efficient.
An authenticated mobile key exchange is necessary for post quantum secure communication over a public channel. It allows two entities to create a secure and unique session key for every communication session. We feel a need to design two party efficient and secure authenticated key agreement. We have also observed all the protocols given above are based on learning with error assumption over a finite ring. The ”Module Learning with Errors” assumption is the more appropriate choice among ”Learning with Errors” and ”Ring Learning with Errors” for designing practical password-authenticated key exchange protocols. With the help of ”Module Learning with Errors” assumption, and by lowering the number of ring polynomials, several implementations of the protocols can be realized. Therefore, this paper contains quantum safe, efficient, and practical ”Module Learning with Errors” assumption based authenticated key agreement protocol. The protocol’s security analysis is presented within the framework of the random oracle model.
ABSTRACT Quantum computing poses a mounting and concrete threat to the cryptographi protocols underpinning mobile communication systems, where both security and computational efficiency are critical constraints. Existing three‐party authenticated key agreement (3PAKA) schemes either rely on classically hard problems broken by Shor's algorithm or, among postquantum proposals, fail to simultaneously achieve user anonymity, unlinkability, and perfect forward secrecy at acceptable cost for resource‐constrained mobile devices. We first conduct a rigorous cryptanalysis of the recent lattice‐based scheme of Singh et al. and uncover four concrete vulnerabilities: an identity recovery vulnerability and scalability failure arising from XOR masking with a static server key, which forces an exhaustive identity search and opens a denial‐of‐service vector; blind acceptance by the responder , as User forwards the initiator's message without verifying the sender's identity; authentication blindness at the initiator , since the response received by User carries no cryptographic proof of User 's identity; and server‐side incomplete verification caused by a missing session parameter , which the server requires but never receives. To remedy these deficiencies, we propose a Three‐Party Post‐Quantum Mutual Authentication and Key Agreement (MAKA) scheme for mobile devices, built on the Ideal‐Lattice Ring Learning With Errors (Ring‐LWE) assumption with parameters and Gaussian width . The proposed four‐message protocol employs biometric‐bound fuzzy extractors, dynamic masked identities , and fresh per‐session Ring‐LWE samples to achieve mutual authentication, user anonymity, unlinkability, and perfect forward secrecy. Security is formally analyzed in the Bellare–Rogaway (BR) model under the Random Oracle Model (ROM), yielding a tight reduction to the Decision‐RLWE assumption. Our message structure yields a total communication cost of bits, representing approximately improvement over Singh et al. It also demonstrates a favourable communicationcost relative to those of Islam and Basu, Rewal et al., Kumar et al., Dabra et al., and Park et al. across both metrics.
In order to solve the session key agreement problem between a mobile user and a network control center, an authenticated key exchange protocol for mobile satellite communication systems which was proved universally composable secure at present was carefully analyzed. It was found that there was some mistake in the proof and the protocol was easy to suffer the data synchronization attack and the key compromise impersonation attack. Furthermore,improvements to overcome the security vulnerabilities of the protocol were proposed. The improved protocol was universally composable secure.