Summary Satellite's communication system is used to communicate under significant distance and circumstances where the other communication systems are not comfortable. Since all the data are exchanged over a public channel, so the security of the data is an essential component for the communicating parties. Both key exchange and authentication are two cryptographic tools to establish a secure communication between two parties. Currently, various kinds of authentication protocols are available to establish a secure network, but all of them depend on number–theoretical (discrete logarithm problem/factorization assumption) hard assumptions. Due to Shor's and Grover's computing algorithm number theoretic assumptions are breakable by quantum computers. Although Kumar and Garg have proposed a quantum attack‐resistant protocol for satellite communication, it cannot resist stolen smart card attack. We have analyzed that how Kumar and Garg is vulnerable to the stolen smart card attack using differential power analysis attack described in He et al and Chen and Chen. We have also analyzed the modified version of signal leakage attack and sometimes called improved signal leakage attack on Kumar and Garg's protocol. We have tried to construct a secure and efficient authentication protocol for satellites communication that is secure against quantum computing. This is more efficient as it requires only three messages of exchange. This paper includes security proof and performance of the proposed authentication and key agreement protocol.
Summary Satellite's communication system is used to communicate under significant distance and circumstances where the other communication systems are not comfortable. Since all the data are exchanged over a public channel, so the security of the data is an essential component for the communicating parties. Both key exchange and authentication are two cryptographic tools to establish a secure communication between two parties. Currently, various kinds of authentication protocols are available to establish a secure network, but all of them depend on number–theoretical (discrete logarithm problem/factorization assumption) hard assumptions. Due to Shor's and Grover's computing algorithm number theoretic assumptions are breakable by quantum computers. Although Kumar and Garg have proposed a quantum attack‐resistant protocol for satellite communication, it cannot resist stolen smart card attack. We have analyzed that how Kumar and Garg is vulnerable to the stolen smart card attack using differential power analysis attack described in He et al and Chen and Chen. We have also analyzed the modified version of signal leakage attack and sometimes called improved signal leakage attack on Kumar and Garg's protocol. We have tried to construct a secure and efficient authentication protocol for satellites communication that is secure against quantum computing. This is more efficient as it requires only three messages of exchange. This paper includes security proof and performance of the proposed authentication and key agreement protocol.
Summary Satellite communication is becoming an increasingly important component of the communication process, as all forms of communication are sent over open networks. As a result, there is an increase in the number of security concerns, and several protocols have been established with this consideration in mind. Recently, Dharminder et al. proposed a post‐quantum secure authentication protocol for satellite communication. The protocol is an improved version of Kumar and Garg's protocol. The authors claimed that the protocol resists the vulnerability of Kumar and Garg's protocol and provides post‐quantum security for satellite communication. Despite their claims, we have found that the protocol is vulnerable to a key mismatch attack and an offline dictionary attack. Further, we have improved Dharminder et al.'s proposed protocol that resists the key mismatch attack and offline dictionary attack and have provided the condition for the correctness of the improved protocol. Our formal security proof and implementation results demonstrate that the improved protocol is secure against quantum attacks.
Summary Satellite communication is one of the essential communication mechanisms that can be used for significant distance and under circumstances where the other communication mechanisms cannot work. Therefore, the security of this communication method is highly needed. Because in this era where information plays an important role, information security becomes the first priority for everyone. When we talk about information security, the key exchange and authentication are two key factors of information security. Whitfield Diffie and Martin Hellman1 proposed the first key exchange protocol. In the last two or three decades, various authentication schemes have been proposed to create a secure network that mainly depends on classical number–theoretical hard assumptions (factorization or discrete logarithm), but due to the Shor's2 algorithm, above‐mentioned scheme is no longer secure because any discrete logarithm or factorization problems can be solved by Shor's algorithm in polynomial time if the quantum computer becomes the reality soon. As far as our knowledge goes, there is no authentication protocol for satellite communication, which is secure against quantum computer attacks. Therefore, in this paper, we first proposed authentication protocol for satellite communication based on ring learning with error which is secure against quantum attacks.
Abstract Mobile communication is very important for an individual users, enterprisers, industries, businesses, and organizations. Since the nodes communicate through a public channel, security, and privacy become essential component for mobile communication. Both key exchange and authentication are two important security attributes to establish secure communication between two parties. In the past few years, various post‐quantum secure authentication protocols have been designed, but we have found that either some of the protocols are vulnerable to stolen smart card attack, invalid login, or signal leakage attack. In this article, we have discussed how the protocol Dharminder et al (Dharminder D, Chandran KP. J Ambient Intell Humaniz Comput. 2020; 11:4089‐4100.) is vulnerable to modified version of signal leakage attack, and sometimes called improved signal leakage attack. We have also suggested a remedy over the current existing protocol suffering from signal leakage attacks. The proposed protocol is secure against quantum attacks. We have proved the security of the proposed protocol under ring learning with errors assumption. The proposed authentication and key agreement needs only two messages exchange. We have also found the proposed is efficient in terms of computation with respect to relevant protocols.
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 In this article, we have discussed various authentication and key agreement protocols for satellite communication system and their flaws off‐line passwords guess, stolen smart card attack, insider attack and replay attack and so forth. We have analyzed the security of a recently published Uddeshaya et al's protocol for satellite communication, and discussed how it suffers from design flaws and insider attack. This protocol cannot stop the Bergamo attack, but the proposed protocol is applicable in specific environment against Bergamo attack. We have compared and illustrated the performance and security analysis of several existing protocols for satellite communication. The proposed authenticated key agreement protocol possesses both low computation and low communication cost. This protocol establishes a verified session key with only two messages of exchange. We have discussed the security of proposed framework in the random oracle model.
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.