With the growing use of underwater acoustic communications (UWAC) for both industrial and military operations, there is a need to ensure communication security. A particular challenge is represented by underwater acoustic networks (UWANs), which are often left unattended over long periods of time. Currently, due to the physical and performance limitations, the UWAC packets rarely include encryption, leaving the UWAN exposed to external attacks faking legitimate messages. In this paper, we propose a new algorithm for message authentication in a UWAN setting. We begin by observing that, due to the strong spatial dependency of the underwater acoustic channel, an attacker can attempt to mimic the channel associated with the legitimate transmitter only for a small set of receivers, typically just for a single one. Taking this into account, our scheme relies on trusted nodes that independently help a sink node in the authentication process. For each incoming packet, the sink fuses beliefs evaluated by the trusted nodes to reach an authentication decision. These beliefs are based on the estimated statistics of the channel parameters, which are chosen to be the most sensitive to the transmitter-receiver displacement. Our simulation results show accurate identification of an attacker’s packet. We also report results from a sea experiment demonstrating the effectiveness of our approach.
Comprehensive reviews of security approaches for underwater networks are provided in @cite_1 @cite_39 , which discuss approaches for anti-jamming, privacy securing, and covertness. As this paper focuses on authentication, in this section we consider only authentication approaches. @cite_25 , an end-to-end authentication scheme has been proposed using the elliptic curve digital signature algorithm (ECDSA). Secret keys can also be used for authentication, and in this respect a robust secret key generation scheme is proposed in @cite_30 . The survey in @cite_28 covers several forms of cooperation and their application to underwater networks. Game theory is advocated as a means to foster cooperation among the nodes. In a security context, this concept is applied to motivate nodes to behave cooperatively, and to improve the effectiveness of end-to-end authentication schemes, which are seen as an important aspect of future underwater network developments @cite_32 .
@cite_30 @cite_28 @cite_1 @cite_32 @cite_39 @cite_25
1992226551 2124650121 2171595831 1966132871
Lattice-based signature schemes following the Goldreich–Goldwasser–Halevi (GGH) design have the unusual property that each signature leaks information on the signer’s secret key, but this does not necessarily imply that such schemes are insecure. At Eurocrypt ’03, Szydlo proposed a potential attack by showing that the leakage reduces the key-recovery problem to that of distinguishing integral quadratic forms. He proposed a heuristic method to solve the latter problem, but it was unclear whether his method could attack real-life parameters of GGH and NTRUSign. Here, we propose an alternative method to attack signature schemes a la GGH by studying the following learning problem: given many random points uniformly distributed over an unknown n-dimensional parallelepiped, recover the parallelepiped or an approximation thereof. We transform this problem into a multivariate optimization problem that can provably be solved by a gradient descent. Our approach is very effective in practice: we present the first successful key-recovery experiments on NTRUSign-251 without perturbation, as proposed in half of the parameter choices in NTRU standards under consideration by IEEE P1363.1. Experimentally, 400 signatures are sufficient to recover the NTRUSign-251 secret key, thanks to symmetries in NTRU lattices. We are also able to recover the secret key in the signature analogue of all the GGH encryption challenges. Underwater acoustic communications have found applications in many fields with great developments. Thus, the demand for security of such communications is rapidly growing. Two parties in the communication, after authentication, generally use a secure symmetric key to encrypt all the data they transmit. Thus, an efficient key generation algorithm is in urgent need to guarding the privacy of the communication data. This paper presents a novel key generation system which is easy to be implemented, efficient in computation and communication, and robust to the spatio-temporal variable ocean environments. Unlike those conventional solutions, by exploiting reciprocity, deep fades, randomness extractor and robust secure fuzzy information reconciliators, which is first introduced by us in this paper, channel characteristics are used to generate the key in our solution. New approaches that generate secret keys from radio channel characteristics have been recently proposed. The security of these schemes usually relies on the reciprocity principle which states that the channel fluctuations can be a source of common randomness for two communicating peers and these fluctuations can't be measured by any eavesdropper. A validation of these properties for indoor environments is presented in this work. The shared keys are created by measuring the reciprocal channel features and converting this information to binary vectors using a quantization algorithm. This paper addresses the problem of quantization. It identifies an important weakness of existing key generation algorithms and it shows that the secret bits extraction has a significant impact on the robustness and security of these algorithms. A new adaptive quantization algorithm for secret key generation is presented. This method has the advantages to create sufficient long secret keys with a high key agreement ratio between authorized users without revealing information to the attacker. The new scheme is experimentally validated using Ultra Wide Band technology. Recently, remote user authentication schemes are implemented on elliptic curve cryptosystem (ECC) to reduce the computation loads for mobile devices. However, most remote user authentication schemes on ECC are based on public-key cryptosystem, in which the public key in the system requires the associated certificate to prove its validity. Thus, the user needs to perform additional computations to verify the certificate in these schemes. In addition, we find these schemes do not provide mutual authentication or a session key agreement between the user and the remote server. Therefore, we propose an ID-based remote mutual authentication with key agreement scheme on ECC in this paper. Based upon the ID-based concept, the proposed scheme does not require public keys for users such that the additional computations for certificates can be reduced. Moreover, the proposed scheme not only provides mutual authentication but also supports a session key agreement between the user and the server. Compared with the related works, the proposed scheme is more efficient and practical for mobile devices.