Time efficient secure DNA based access control model for cloud computing environment

The uses of Big Data (BD) are gradually increasing in many new emerging applications, such as Facebook, eBay, Snapdeal, etc. BD is a term, which is used for describing a large volume of data. The data security is always a big concern of BD. Besides the data security, other issues of BD are data storage, high data accessing time, high data searching time, high system overhead, server demand, etc. In this paper, a new access control model has been proposed for BD to solve all these issues, where fast accessing of the large volume of data are provided based on the data size Here, a long 512-bit Deoxyribonucleic Acid (DNA) based key sequence has been used for improving the data security, and it is secured against the collision attack, man-in-the-middle attack, internal attack, etc. The proposed scheme is evaluated in terms of both theoretical and experimental results, which show the proficiency of the proposed scheme over the existing schemes.     

Video image scaling technology based on adaptive interpolation algorithm and TTS FPGA implementation

With the rapid development of digital multimedia terminals, the scaling of video images has solved the needs of high-end displays for low-resolution signals and high-definition signals displayed by low-end displays. The main purpose of this article is to convert the input video image signal into a video image signal with the required resolution through video image scaling. This article mainly studies various image scaling algorithms, analyzes their advantages and disadvantages, and adopts a top-down design method to implement FPGA video scaling design and verify the correctness of the results. This article introduces various traditional image interpolation algorithms. On the basis of comparing the subjective and objective quality of the image after the summation of various algorithms, the fuzzy interpolation algorithm is used to zoom the video image. In FPGA design, horizontal scaling and vertical scaling are handled separately, which reduces the computational complexity of image upgrades and facilitates control logic and specific implementation. The experimental results of this paper show that the maximum working frequency that the designed image scaling unit can reach is 153.12 MHz, which can process 1080p video signals in real time. Video image scaling technology has broad market prospects.     

Ultra-reliable secure data aggregation scheme with low latency for isolated terminals in 5G and beyond defined STINs

5G and beyond defined space-terrestrial integrated networks (STINs) have become an emerging research field, thanks to the rapid development of future generation communication technologies and satellite networks. Ultra-reliable low latency STINs utilizing 5G and beyond technologies put forward requirements for the trustworthiness of network terminals and the convenience of data aggregation. Some research work has been carried out in this field. However, the secure aggregation in STINs between isolated terminals that lack connection with base stations and data centers needs to be further studied. In this paper, a trustworthiness based secure data aggregation scheme with low latency for isolated terminals in 5G and beyond defined STINs is proposed. The trustworthiness of the isolated terminals is evaluated by the satellites and the data centers to increase the reliability of the aggregated data. A lightweight trusted special channel establishment method between an isolated terminal and a data center is presented. The security and performance analysis shows that the novel proposal is secure and efficient.     

Anonymous and expeditious mobile user authentication scheme for GLOMONET environments

The Global Mobility Network (GLOMONET) is rapidly becoming important as well as a popular feature in today's high‐performance network. The legal mobile users enjoy life using the ubiquitous services via GLOMONET. However, because of the broadcast nature of the wireless channel, providing user authentication along with the privacy and anonymity of the users in GLOMONET is indeed a challenging task. In this article, we come up with a secure and expeditious mobile communication environment using symmetric key cryptosystem to ensure mobile users' anonymity and privacy against eavesdroppers and backward/forward secrecy of the session key. Our scheme can also protect numerous security threats, like man‐in‐the‐middle attack, known session key attack, lost smartcard attack, and forgery attack. Furthermore, we put forward a new technique named as “friendly foreign agent policy,” where many foreign agents can make different groups among themselves and perform important responsibilities to authenticate a legitimate mobile user without interfering his or her home agent even though the mobile user moves to a new location, covered by a new foreign agent (belongs to the same group). Security and performance analyses show that the proposed scheme is secure and more efficient as compared with other competitive schemes for GLOMONET environments.     

PP-OCQ: A distributed privacy-preserving optimal closeness query scheme for social networks

Optimal closeness query in social networks requires obtaining the social datasets from each user so that he/she finds out a shortest social distance with any target user. For example, we can make friends in terms of the most similar social relationship of family background, education level and hobbies etc. Unfortunately, social data concerning user’s attributes might reveal personal sensitive information and be exploited maliciously. Considering the above privacy-revealing issues, this paper proposes a Privacy-Preserving Optimal Closeness Query (PP-OCQ) scheme, which achieves the secure optimal closeness query in a distributed manner without revealing the users’ sensitive information. We construct an equivalent cost graph where all users’ information are encrypted by his/her public key and the data are authenticated by signature. It employs the ElGamal Cryptosystem to achieve the privacy protection in social networks, and gives an optimal closeness query protocol without leaking the users’ sensitive information on homomorphic user ciphertexts. Then it follows the routing protocol, distributed Bellman-Ford shortest-paths protocol, to query the optimal closeness through the users’ message propagation in multiple iterations. The direction of propagation is controlled by some indicators so that each user performs corresponding operations based on homomorphism property and fails to obtain other user’s information due to the masking of random numbers. Our analysis and simulations show that the proposed scheme is efficient in terms of computation cost and communication overhead.