scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Nframe: A privacy-preserving with non-frameability handover authentication protocol based on (t, n) secret sharing for LTE/LTE-A networks

01 Oct 2017-Wireless Networks (Springer US)-Vol. 23, Iss: 7, pp 2165-2176
TL;DR: This paper proposes a novel privacy-preserving with non-frameability handover authentication protocol based on (t, n) secret sharing to fit in with all of the mobility scenarios in the LTE/LTE-A networks, which is called Nframe.
Abstract: Seamless handover between the evolved universal terrestrial radio access network and other access networks is highly desirable to mobile equipments in the long term evolution (LTE) or LTE-Advanced (LTE-A) networks, but ensuring security and efficiency of this process is challenging. In this paper, we propose a novel privacy-preserving with non-frameability handover authentication protocol based on (t, n) secret sharing to fit in with all of the mobility scenarios in the LTE/LTE-A networks, which is called Nframe. To the best of our knowledge, Nframe is the first to support protecting users’ privacy with non-frameability in the handover process. Moreover, Nframe uses pairing-free identity based cryptographic method to secure handover process and to achieve high efficiency. The formal verification by the AVISPA tool shows that Nframe is secure against various malicious attacks and the simulation result indicates that it outperforms the existing schemes in terms of computation and communication cost.
Citations
More filters
Journal ArticleDOI
TL;DR: A comprehensive survey of authentication and privacy-preserving schemes for 4G and 5G cellular networks can be found in this paper, where the authors provide a taxonomy and comparison of authentication schemes in terms of tables.

163 citations

Journal ArticleDOI
TL;DR: In this paper, the state of the art of privacy-preserving schemes for ad hoc social networks including mobile social networks (MSNs) and vehicular social network (VSNs) is reviewed.
Abstract: We review the state of the art of privacy-preserving schemes for ad hoc social networks including mobile social networks (MSNs) and vehicular social networks (VSNs). Specifically, we select and examine in-detail 33 privacy-preserving schemes developed for or applied in the context of ad hoc social networks. Based on novel schemes published between 2008 and 2016, we survey privacy preservation models including location privacy, identity privacy, anonymity, traceability, interest privacy, backward privacy, and content oriented privacy. Recent significant attacks of leaking privacy, countermeasures, and game theoretic approaches in VSNs and MSNs are summarized in the form of tables. In addition, an overview of recommendations for further research is provided. With this survey, readers can acquire a thorough understanding of research trends in privacy-preserving schemes for ad hoc social networks.

112 citations

Journal ArticleDOI
TL;DR: Comprehensive performance evaluation and comparisons show that RUSH outperforms other schemes in both computation and communication efficiencies, and formal security proofs indicate that RRush resists various attacks.
Abstract: The evolving fifth generation (5G) cellular networks will be a collection of heterogeneous and backward-compatible networks. With the increased heterogeneity and densification of 5G heterogeneous networks (HetNets), it is important to ensure security and efficiency of frequent handovers in 5G wireless roaming environments. However, existing handover authentication mechanisms still have challenging issues, such as anonymity, robust traceability and universality. In this paper, we address these issues by introducing RUSH, a Robust and Universal Seamless Handover authentication protocol for 5G HetNets. In RUSH, anonymous mutual authentication with key agreement is enabled for handovers by exploiting the trapdoor collision property of chameleon hash functions and the tamper-resistance of blockchains. RUSH achieves universal handover authentication for all the diverse mobility scenarios, as exemplified by the handover between 5G new radio and non-3GPP access regardless of the trustworthiness of non-3GPP access and the consistency of the core network. RUSH also achieves perfect forward secrecy, master key forward secrecy, known randomness secrecy, key escrow freeness and robust traceability. Our formal security proofs based on the BAN-logic and formal verification based on AVISPA indicate that RUSH resists various attacks. Comprehensive performance evaluation and comparisons show that RUSH outperforms other schemes in both computation and communication efficiencies.

81 citations


Cites background or methods from "Nframe: A privacy-preserving with n..."

  • ...Note that the schemes [14], [15] TABLE 5 Comparison of Transmission Costs...

    [...]

  • ...To achieve anonymity, pseudo identities are adopted in [14], [15]....

    [...]

  • ...The scheme [14] aims to realize robustness by introducingmany other entities to distribute the ability of the AAA server based on the secret sharing technique....

    [...]

  • ...[13] No No No No – – No No No [34] No No No No – – Yes Yes No [24] No No No No – – Yes Yes No Scheme I [20] No No No No – – Yes Yes No Scheme II [20] No No No Yes Yes No Yes Yes No [15] No No No Yes Yes No No No – [14] No No No Yes Yes No Yes Yes No [25] No Yes Yes No – – Yes Yes No [35] No Yes No No – – Yes Yes No [18] No Yes No Yes Yes No No No No [17] No Yes Yes Yes Yes No Yes Yes No RUSH Yes Yes Yes Yes Yes Yes Yes Yes Yes...

    [...]

  • ...Note that both UE’s identity anonymity and UE’s traceability are realized in RUSHand schemes [14], [15], [17], [18], [20]....

    [...]

Posted Content
TL;DR: This survey selects and examines in-detail 33 privacy-preserving schemes developed for or applied in the context of ad hoc social networks and surveys privacy preservation models including location privacy, identity privacy, anonymity, traceability, interest privacy, backward privacy, and content oriented privacy.
Abstract: In this paper, we review the state of the art of privacy-preserving schemes for ad hoc social networks, including, mobile social networks (MSNs) and vehicular social networks (VSNs). Specifically, we select and in-detail examine thirty-three privacy preserving schemes developed for or applied in the context of ad hoc social networks. These schemes are published between 2008 and 2016. Based on this existing privacy preservation schemes, we survey privacy preservation models, including location privacy, identity privacy, anonymity, traceability, interest privacy, backward privacy, and content oriented privacy. The recent important attacks of leaking privacy, countermeasures, and game theoretic approaches in VSNs and MSNs are summarized in form of tables. In addition, an overview of recommendations for further research is also provided. With this survey, readers can have a more thorough understanding of research trends in privacy-preserving schemes for ad hoc social networks

70 citations


Cites methods from "Nframe: A privacy-preserving with n..."

  • ...Five schemes [172]–[176] use the AVISPA tool [171] to verify the security of these schemes against insider attacks and outsider attacks, and to prove two privacy models, namely, identity privacy and location privacy....

    [...]

Journal ArticleDOI
TL;DR: This paper presents the first many-to-one attestation scheme for device swarms, which reduces the possibility of single point of failure verifier and can significantly reduce the attestation time and has a better performance in the energy consumption comparing with list-based attestation schemes.
Abstract: An Internet of Things (IoT) system generally contains thousands of heterogeneous devices which often operate in swarms—large, dynamic, and self-organizing networks. Remote attestation is an important cornerstone for the security of these IoT swarms, as it ensures the software integrity of swarm devices and protects them from attacks. However, current attestation schemes suffer from single point of failure verifier. In this paper, we propose an Efficient and Secure Distributed Remote Attestation (ESDRA) scheme for IoT swarms. We present the first many-to-one attestation scheme for device swarms, which reduces the possibility of single point of failure verifier. Moreover, we utilize distributed attestation to verify the integrity of each node and apply accusation mechanism to report the invaded nodes, which makes ESDRA much easier to feedback the certain compromised nodes and reduces the run-time of attestation. We analyze the security of ESDRA and do some simulation experiments to show its practicality and efficiency. Especially, ESDRA can significantly reduce the attestation time and has a better performance in the energy consumption comparing with list-based attestation schemes.

43 citations


Cites background from "Nframe: A privacy-preserving with n..."

  • ...Because those devices often store a large amount of users’ private information and affect the operation of the entire system [9]–[11]....

    [...]

References
More filters
Journal ArticleDOI
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Abstract: In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k - 1 pieces reveals absolutely no information about D. This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.

14,340 citations

Book ChapterDOI
Victor S. Miller1
18 Aug 1985
TL;DR: In this paper, an analogue of the Diffie-Hellmann key exchange protocol was proposed, which appears to be immune from attacks of the style of Western, Miller, and Adleman.
Abstract: We discuss the use of elliptic curves in cryptography. In particular, we propose an analogue of the Diffie-Hellmann key exchange protocol which appears to be immune from attacks of the style of Western, Miller, and Adleman. With the current bounds for infeasible attack, it appears to be about 20% faster than the Diffie-Hellmann scheme over GF(p). As computational power grows, this disparity should get rapidly bigger.

4,004 citations

Journal ArticleDOI
TL;DR: An overview of the techniques being considered for LTE Release 10 (aka LTEAdvanced) is discussed, which includes bandwidth extension via carrier aggregation to support deployment bandwidths up to 100 MHz, downlink spatial multiplexing including single-cell multi-user multiple-input multiple-output transmission and coordinated multi point transmission, and heterogeneous networks with emphasis on Type 1 and Type 2 relays.
Abstract: LTE Release 8 is one of the primary broadband technologies based on OFDM, which is currently being commercialized. LTE Release 8, which is mainly deployed in a macro/microcell layout, provides improved system capacity and coverage, high peak data rates, low latency, reduced operating costs, multi-antenna support, flexible bandwidth operation and seamless integration with existing systems. LTE-Advanced (also known as LTE Release 10) significantly enhances the existing LTE Release 8 and supports much higher peak rates, higher throughput and coverage, and lower latencies, resulting in a better user experience. Additionally, LTE Release 10 will support heterogeneous deployments where low-power nodes comprising picocells, femtocells, relays, remote radio heads, and so on are placed in a macrocell layout. The LTE-Advanced features enable one to meet or exceed IMT-Advanced requirements. It may also be noted that LTE Release 9 provides some minor enhancement to LTE Release 8 with respect to the air interface, and includes features like dual-layer beamforming and time-difference- of-arrival-based location techniques. In this article an overview of the techniques being considered for LTE Release 10 (aka LTEAdvanced) is discussed. This includes bandwidth extension via carrier aggregation to support deployment bandwidths up to 100 MHz, downlink spatial multiplexing including single-cell multi-user multiple-input multiple-output transmission and coordinated multi point transmission, uplink spatial multiplexing including extension to four-layer MIMO, and heterogeneous networks with emphasis on Type 1 and Type 2 relays. Finally, the performance of LTEAdvanced using IMT-A scenarios is presented and compared against IMT-A targets for full buffer and bursty traffic model.

1,044 citations

Journal ArticleDOI
TL;DR: The open-source framework LTE-Sim is presented to provide a complete performance verification of LTE networks and has been conceived to simulate uplink and downlink scheduling strategies in multicell/multiuser environments, taking into account user mobility, radio resource optimization, frequency reuse techniques, the adaptive modulation and coding module, and other aspects that are very relevant to the industrial and scientific communities.
Abstract: Long-term evolution (LTE) represents an emerging and promising technology for providing broadband ubiquitous Internet access. For this reason, several research groups are trying to optimize its performance. Unfortunately, at present, to the best of our knowledge, no open-source simulation platforms, which the scientific community can use to evaluate the performance of the entire LTE system, are freely available. The lack of a common reference simulator does not help the work of researchers and poses limitations on the comparison of results claimed by different research groups. To bridge this gap, herein, the open-source framework LTE-Sim is presented to provide a complete performance verification of LTE networks. LTE-Sim has been conceived to simulate uplink and downlink scheduling strategies in multicell/multiuser environments, taking into account user mobility, radio resource optimization, frequency reuse techniques, the adaptive modulation and coding module, and other aspects that are very relevant to the industrial and scientific communities. The effectiveness of the proposed simulator has been tested and verified considering 1) the software scalability test, which analyzes both memory and simulation time requirements; and 2) the performance evaluation of a realistic LTE network providing a comparison among well-known scheduling strategies.

685 citations

Journal ArticleDOI
TL;DR: The various categories of applications in VANETs are introduced, as well as some security requirements, threats and certain architectures are proposed to solve the security problem.

407 citations