8 April 2020 in IEEE Transactions on Vehicular Technology
More and more users are eager to obtain more comprehensive network services without revealing their private information. Traditionally, in order to access a network, a user is authorized with an identity and corresponding keys, which are generated and managed by the network operator. All users' personally identifying information are centralized stored by the network operator. However, this approach makes users lose the control of their personally identifying information. Users are concerned about who can access these sensitive data and whether they have been compromised. In this paper, we propose a blockchain-based identity management and authentication scheme for mobile networks, where users' identifying information are controlled by the users themselves. Our scheme let users generate their self-sovereign identities (SSIs) and corresponding public keys and private keys. The private key used to authenticate the user's identifying information is only known to the user. We use blockchain to record SSIs and public keys of legitimate user, and adopt chameleon hash to delete illegal users' information on the blockchain, while keeping the blockchain head unchanged. Furthermore, other service providers can obtain the user's SSI and public key and authenticate users by querying the blockchain. Experimental results confirm that our scheme can greatly reduce the revocation overhead and communication overhead.
14 March 2017 in IEEE Transactions on Services Computing
The new paradigm of outsourcing data to the cloud is a double-edged sword. On the one hand, it frees data owners from the technical management, and is easier for data owners to share their data with intended users. On the other hand, it poses new challenges on privacy and security protection. To protect data confidentiality against the honest-but-curious cloud service provider, numerous works have been proposed to support fine-grained data access control. However, till now, no schemes can support both fine-grained access control and time-sensitive data publishing. In this paper, by embedding timed-release encryption into Ciphertext-Policy Attribute-based Encryption (CP-ABE), we propose a new time and attribute factors combined access control on time-sensitive data for public cloud storage (named TAFC). Based on the proposed scheme, we further propose an efficient approach to design access policies faced with diverse access requirements for time-sensitive data. Extensive security and performance analysis shows that our proposed scheme is highly efficient and satisfies the security requirements for time-sensitive data storage in public cloud.
15 April 2020 in IEEE Transactions on Dependable and Secure Computing
Under the assumption of honest-but-curious cloud service provider, various cryptographic techniques have been used to address the issues of data access control and confidentiality in public cloud storage. Among which, attribute-based encryption (ABE) has been shown to be an attractive scheme. Although the technique of ABE brings in various benefits, its onerous overhead should not be ignored. In this paper, based on an improved LSSS (linear secret sharing scheme) matrix expression integrated in CP-ABE (Ciphertext-Policy Attribute-Based Encryption) algorithm, we present an efficient and secure attribute-based access control scheme for the scenarios where multiple data are shared and encrypted with frequently used sub-policies. In the scheme, a user can store the parameters about a specific sub-policy in his/her first decryption, which can be reused in the subsequent data decryptions whose embedded access policies include the same sub-policy so as to significantly reduce the computation cost. Our proposed scheme is proved to be semantically secure under chosen plaintext attacks and can well preserve the confidentiality of the data sharing system. Our analysis and experimentation also show that our scheme does significantly reduce the decryption time and while trades in only very little storage overhead, and thus effectively promotes the efficiency.
22 February 2023 in IEEE/ACM Transactions on Networking
Multipath TCP is designed to utilize multiple network paths to achieve improved throughput and robustness against network failure. These features are supposed to make MPTCP preferable to single-path TCP in mobile networks. However, it fails to achieve the expected performance in practice. A key challenge of using MPTCP in mobile networks is how to effectively spread packets over heterogeneous and unstable network paths to mobile devices with limited buffers. If packets are not sent in an effective way, MPTCP may only provide equal or even lower throughput than single-path TCP. Several packet scheduling algorithms have been designed to tackle this challenge. Unfortunately, they still cannot achieve the expected performance in dynamic scenarios such as mobile networks. In this paper, we propose an Online-Learning Assisted Packet Scheduler (OLAPS) to solve the packet scheduling problem by modeling it as a multi-armed bandit problem. Over time, OLAPS can adaptively learn from current network conditions to make the best scheduling policy to provide the highest possible throughput in a dynamic environment. Moreover, when the inbuilt reward monitor detects the mismatch between network conditions and the learned policy, OLAPS aborts the outdated policy and switches to a new one swiftly. We implement OLAPS as a Linux kernel module and evaluate it over a wide range of ns-3 -simulated network conditions. The results show that OLAPS retains MPTCP’s ability to provide higher throughput and also significantly improves the throughput performance of MPTCP when other in-kernel schedulers suffer a dramatic throughput decline.
20 May 2022 in IEEE Transactions on Quantum Engineering
Quantum networks create a completely new way for communication, and the most important function of a quantum network is to generate long-distance quantum entanglement to serve a number of quantum applications. As the scale of the network expands, in order to establish end-to-end entanglement between two remote nodes, entangled pairs need to be generated and distributed among multiple repeaters along the path from the source to the destination, which requires a specific protocol to negotiate resource allocations and quantum operations among the repeaters. Thus, to realize such remote entanglement distribution in a quantum network, designing a stable and reliable protocol becomes urgent and necessary. In this article, we focus on how to guarantee the generation rate of entangled pairs between any two quantum nodes to meet the requirements of various quantum applications in a large-scale quantum network. We present a connection-oriented entanglement distribution protocol inspired by the connection-oriented communication model in classical networks. Our protocol is located in the network layer of the quantum network to enable end-to-end quantum communication. Three main features are provided by the proposed protocol: 1) it is reliable and can guarantee the successful entanglement generation; 2) it can reduce the influence of quantum decoherence via reducing the latency caused by resource competition; and 3) it can guarantee the rate of generating entanglement between two quantum nodes according to the requirement of quantum applications.
29 December 2020 in IEEE Transactions on Vehicular Technology
Multipath transmission control protocol (MPTCP) allows an end-to-end connection to operate across multiple paths simultaneously and has become an attractive means to improve the goodput of emerging mobile devices with various radio interfaces. The existing multipath congestion control algorithms for MPTCP, however, are mainly packet-loss-based and favor the paths with lower drop rates, leading to severe goodput degradation in heterogeneous wireless networks, where random packet loss occurs frequently and link parameters of different paths are often significantly different. Meanwhile, BBR (Bottleneck Bandwidth and Round-trip propagation time), a rate-based congestion control scheme, is proposed by Google Inc. for TCP to achieve both high goodput and low latency by probing a TCP flow's maximum bandwidth and propagation delay to adjust the sending rate. Aiming at improving the performance of MPTCP in a heterogeneous wireless network environments, in this paper, by taking the advantages of BBR and for considering bottleneck fairness, we propose BBR-based Congestion Control and Packet Scheduling scheme, called BCCPS. The proposed BCCPS first considers a BBR-based congestion control algorithm, MPTCP-BBR, for MPTCP by adaptively adjusting the sending rate of each subflow according to the real probing rate rather than the loss information to enhance the goodput while keeping bottleneck fairness with regular TCP. Then, considering that the different sending rates of the subflows in heterogeneous wireless networks will result in the problem of out-of-order (OFO) delivery, a fine-grained packet scheduling scheme is proposed to keep in-order delivery and so as to reducing the application layer completion time. The performance of the proposed scheme is evaluated via both NS-3 and real network scenarios. Experimental results show that our proposed scheme far outperforms existing MPTCP schemes in heterogeneous wireless environment.