Search

Record linkage aims at finding the matching records from two or multiple different databases. Many approximate string matching methods in privacy-preserving record linkage have been presented. In this paper, we study the problem of secure record linkage between two data files in the two-party computation setting. We note that two records are linked when all the Hamming distances between their attributes are smaller than some fixed thresholds. We firstly construct two efficient secure protocols for computing the powers of an encrypted value and implementing zero test on an encrypted value, then present an efficient protocol within constant rounds for computing the Hamming distance based record linkage in the presence of malicious adversaries by transferring these two protocols. We also discuss the extension of our protocol for settling the Levenshtein distance based record linkage problem. [ABSTRACT FROM AUTHOR]

Highlights: [•] There is a lack of end-to-end security mechanisms tailored to IP-enabled sensors. [•] Ladon is proposed as end-to-end authentication and authorization protocol. [•] We evaluate the time and energy cost of executing Ladon on the protected sensors. [•] Ladon is proved to be a suitable security protocol for resource-deprived devices. [ABSTRACT FROM AUTHOR]

Abstract: The main goal of this paper is to analyze the security of a multiple-key agreement protocol and to show that this protocol is vulnerable to forgery attack. In order to address the security weakness, a new efficient multiple-key agreement protocol is proposed. The proposed protocol is based on bilinear pairings and utilizes a novel signature scheme without one-way hash functions. In contrast to related protocols which are based on bilinear pairings, in the proposed protocol, these pairings are not utilized for the included signature scheme, but they are only used for session keys. As a result, the computational complexity of the proposed protocol is decreased by 50% compared to that of the existing protocols. Another contribution of the proposed protocol is an increase of the number of the session keys up to (n 2(n +1)2/4), for n ⩾2 random numbers, regarding the bilinear property of the pairings. Finally, the simulation results from AVISPA tools confirm the security analysis of the proposed protocol. [Copyright &y& Elsevier]

Authenticated multiple key exchange protocols not only allow participants to agree the multiple session keys within one run of the protocol but also ensure the authenticity of the other party. In this paper, we propose an identity-based multiple key exchange protocol. The authentication part of the proposed protocol is provably secure in the random oracle model under the BDH assumptions. The proposed identity-based multiple key exchange protocol is secure in a formal security model under the random oracle model upon the CDH assumptions and the BDH assumptions. Compared with the identity-based multiple key exchange protocols in the literature, the proposed protocol is more efficient and holds stronger security. [ABSTRACT FROM AUTHOR]

Abstract: The radio-based medium of satellite communication systems is vulnerable to interference on physical channels: unintentional interferences occur frequently and jamming attacks can be achieved using low-grade technology. While application layer security protocols cannot defend against denial of service (DoS) attacks where the attacker jams continuously, effective security protocols ensure that communication can continue after such interference has stopped. This paper analyses an authentication and key agreement protocol for satellite communications. The presented analysis reveals that the protocol is susceptible to a new DoS attack, where attackers jam a single message to achieve a permanent DoS condition. A new authentication and key agreement protocol is proposed that additionally addresses the scenario where messages send over the mobile satellite channel may not reach their intended recipient due to accidental or malicious interference. Analysis of the new protocol demonstrates that it is effective in countering the disruptive effects of jamming. [Copyright &y& Elsevier]

Abstract: Group key agreement is the core of secure group communication. In wireless networks, the privacy problem becomes more crucial and urgent for mobile users due to the open nature of radio media. In this paper, we proposed a novel group key agreement protocol based on trusted third Party, applied in collaboration between mobile users for wireless Mesh network. The security verification (PCL logic) and performance analysis show that, our protocol not only provides privacy protection for group members, but also authenticates all participants by adopting certificates. More important, in the proposed protocol, the computation cost and traffics for each group member are largely reduced to improve the implementation efficiency of the protocol. Therefore, our protocol is a novel, reliable group key agreement protocol, and it is well suited for wireless mesh network. [Copyright &y& Elsevier]

Abstract: In 2008, Lee et al. proposed two multiple-key agreement protocols, first one based on elliptic curve cryptography (ECC) and the other one, based on bilinear pairings. Shortly after publication, Vo et al. showed that the Lee–Wu–Wang’s pairing-based protocol is vulnerable to impersonation attack then for removing the problem, they proposed an improved protocol. In this paper, first We show that the Lee–Wu–Wang’s ECC-based protocol is insecure against forgery attack and also, if long-term private keys of two entities and one key of the session keys are revealed, the other session keys are exposed too. Then, we demonstrate that the Vo–Lee–Yeun–Kim’s protocol is vulnerable to another kind of forgery attacks and a reflection attack. [Copyright &y& Elsevier]

Abstract: In 2010, Vo et al. (2010) proposed an enhancement of authenticated multiple key exchange protocol based on Lee et al.’s protocol. In this paper, we will show that Vo et al.’s multiple key exchange protocol cannot resist reflection attack. It means that their protocol fails to provide mutual authentication. Furthermore, we propose an improvement of Vo et al.’s protocol. Our proposed protocol with reflection attack resilience can really provide mutual authentication. [Copyright &y& Elsevier]

Abstract: In this paper, we present a strongly secure identity-based (ID-based) two-party authenticated key agreement (AKA) protocol, which captures all basic desirable security properties including master key forward secrecy, ephemeral secrets reveal resistance and so on, and is provably secure in the extended Canetti–Krawczyk (eCK) model. The security of the protocol can be reduced to the standard Computational Bilinear Diffie–Hellman assumption in the random oracle model. Our scheme is secure as long as each party has at least one uncompromised secret. Also, we give a strongly secure variant of the protocol. The variant has a much lower computational overhead than the original scheme, while its security relies on the Gap Bilinear Diffie–Hellman assumption. Currently, there are few ID-based AKA protocols that are provably secure in the strong eCK model. Compared with previous ID-based AKA schemes, our protocols have advantages over them in security or efficiency. [Copyright &y& Elsevier]

Abstract: Increasing use of networks and their complexity make the task of security analysis more and more complicated. Accordingly, automatic verification approaches have received more attention recently. In this paper, we investigate applying of an actor-based language based on reactive objects for analyzing a network environment communicating via Transport Protocol Layer (TCP). The formal foundation of the language and available tools for model checking provide us with formal verification support. Having the model of a typical network including client and server, we show how an attacker may combine simple attacks to construct a complex multiphase attack. We use Rebeca language to model the network of hosts and its model checker to find counter-examples as violations of security of the system. Some simple attacks have been modeled in previous works in this area, here we detect these simple attacks in our model and then verify the model to find more complex attacks which may include simpler attacks as their steps. We choose Rebeca because of its powerful yet simple actor-based paradigm in modeling concurrent and distributed systems. As the real network environment is asynchronous and event-based, Rebeca can be utilized to specify and verify the asynchronous systems, including network protocols. [ABSTRACT FROM AUTHOR]

Abstract: In 2008, Juang and Wu proposed two authenticated key exchange protocols by improving Park and Park’s two-factor authenticated key exchange protocol in public wireless LANs. They pointed out that Park’s protocol was vulnerable to the dictionary attack on the identity protection. The improved protocols requires fewer exchanged messages and provided more secure protection for the client’s identity. In this paper, we propose two protocols require less exchanged messages than Juang’s protocols. In addition to this advantage, we point out that the identity protection of Juang’s protocol is computationally inefficient for the server and efficient identity protection is proposed in the second proposed protocol. [Copyright &y& Elsevier]

Abstract: Lee et al. proposed two new authenticated multiple key exchange protocols based on Elliptic Curve Cryptography (ECC) and bilinear pairings. In this paper, we show an impersonation attack on their pairing-based authenticated key exchange protocol. We demonstrate that any attacker can impersonate an entity to share multiple session keys with another entity of his/her choice by using only the public key of the victim. Moreover, their protocol fails to provide perfect forward secrecy, despite of their claim to the contrary. Thus, we propose a simple modification to the original protocol which avoids our attack. [Copyright &y& Elsevier]

Menezes et al. developed an MQV key exchange protocol that does not use a one-way hash function in 1995. Harn–Lin and Hwang–Shiau–Lai later respectively proposed efficient authenticated key exchange protocols. Lee and Wu recently proposed an enhanced authentication key exchange protocol to solve the drawbacks of the Hwang–Shiau–Lai protocol. Based on the Lee–Wu protocol, this work presents two new authenticated multiple key exchange protocols based on ECC and bilinear pairing. The proposed ECC-based protocol is more efficient than the Harn–Lin, Hwang–Shiau–Lai, and Lee–Wu protocols. Moreover, the proposed pairing-based protocol is better than other protocols in terms of the number of available shared session keys because all agreed session keys can be adopted by the communicating parties in the protocol. [Copyright &y& Elsevier]