Design of secure key management and user authentication scheme for fog computing services

The privacy of users must be considered as the utmost priority in distributed networks. To protect the identities of users, attribute-based encryption (ABE) was presented by Sahai et al. ABE has been widely used in many scenarios, particularly in cloud computing. In this paper, public key encryption with equality test is concatenated with key-policy ABE (KP-ABE) to present KP-ABE with equality test (KP-ABEwET). The proposed scheme not only offers fine-grained authorization of ciphertexts but also protects the identities of users. In contrast to ABE with keyword search, KP-ABEwET can test whether the ciphertexts encrypted by different public keys contain the same information. Moreover, the authorization process of the presented scheme is more flexible than that of Ma et al. ’s scheme. Furthermore, the proposed scheme achieves one-way against chosen-ciphertext attack based on the bilinear Diffie-Hellman (BDH) assumption. In addition, a new computational problem called the twin-decision BDH problem (tDBDH) is proposed in this paper. tDBDH is proved to be as hard as the decisional BDH problem. Finally, for the first time, the security model of authorization is provided, and the security of authorization based on the tDBDH assumption is proven in the random oracle model.

Key-Policy Attribute-Based Encryption With Equality Test in Cloud Computing

Public key encryption supporting equality test (referred to as PKE-ET) provides the capability of testing the equivalence between two messages encrypted under different public keys. Ciphertext-policy attribute-based encryption (CP-ABE) is a promising primitive to achieve versatile and secure data sharing in the cloud computing by providing flexible one-to-many encryption. In this paper, we first initialize the concept of CP-ABE with equality test (CP-ABE-ET) by combining the notions of PKE-ET and CP-ABE. Using ABE-ET primitive, the receiver can delegate a cloud server to perform an equivalence test between two messages, which are encrypted under different access policies. During the delegated equivalence test, the cloud server is unable to obtain any knowledge of the message encrypted under either access policy. We propose a concrete CP-ABE-ET scheme using bilinear pairing and Viete’s formulas, and give the security proof of the proposed scheme formally in the standard model. Moreover, the theoretic analysis and experimental simulation reveal that the proposed scheme is efficient and practical.

Ciphertext-Policy Attribute-Based Encryption With Delegated Equality Test in Cloud Computing

Particularly in the last decade, Internet usage has been growing rapidly. However, as the Internet becomes a part of the day to day activities, cybercrime is also on the rise. Cybercrime will cost nearly $6 trillion per annum by 2021 as per the cybersecurity ventures report in 2020. For illegal activities, cybercriminals utilize any network computing devices as a primary means of communication with a victims’ devices, so attackers get profit in terms of finance, publicity and others by exploiting the vulnerabilities over the system. Cybercrimes are steadily increasing daily. Evaluating cybercrime attacks and providing protective measures by manual methods using existing technical approaches and also investigations has often failed to control cybercrime attacks. Existing literature in the area of cybercrime offenses suffers from a lack of a computation methods to predict cybercrime, especially on unstructured data. Therefore, this study proposes a flexible computational tool using machine learning techniques to analyze cybercrimes rate at a state wise in a country that helps to classify cybercrimes. Security analytics with the association of data analytic approaches help us for analyzing and classifying offenses from India-based integrated data that may be either structured or unstructured. The main strength of this work is testing analysis reports, which classify the offenses accurately with 99 percent accuracy.

Computational System to Classify Cyber Crime Offenses using Machine Learning

Energy trading with dynamic pricing for electric vehicles in a smart city environment

Efficient and secure identity-based encryption scheme with equality test in cloud computing

In the past few years, internet of things has been explored in medical area to achieve high efficiency and accuracy in the medical treatment and management. One of the most powerful technologies called the medical Internet of Things (mIoT), is underpinned by the considerable computational ability of cloud and the efficient data collection of medical sensors. As the data is transmitted over open network, security remains a paramount concern in mIoT. Encryption techniques may help to protect patient privacy, but they limit the future retrieval of the encrypted data. To uplift this limitation, public key encryption with keyword search (PEKS) has been introduced. However, most of the existing PEKS schemes are based on public key infrastructure or identity-based cryptography, which suffers from the certificate management issue and key escrow problem in system deployment, respectively. Moreover, inside keyword guessing attack seems to become a severe issue to violate privacy in data search. To address these issues, we present a certificateless searchable public key authenticated encryption scheme with designated tester (CL-dPAEKS), which, we believe, is suitable for cloud-assisted mIoT. We prove that our scheme can resist various types of attacks, and it is more secure than other schemes that built on certificateless cryptography, without significant loss in efficiency.

Certificateless searchable public key authenticated encryption with designated tester for cloud-assisted medical Internet of Things

To support a sustainable development of smart city, smart grid is an indispensable part. Sensor technology in smart gird enables interactive real-time data transmission between cloud and the edge of the network. There are a number of research challenges in the design of smart grids. One of these research challenges is balancing customer privacy and the cloud-based power system’s function optimization. Identity-based encryption with equality test (IBEET) scheme has recently been identified as a viable solution, in which customers can delegate a trapdoor to the power system control server and the server then searches on the encrypted data to determine whether two different ciphertexts are encryptions of the same plaintext. Unfortunately, existing schemes are inefficient and the trapdoor could be used to perform equality test on any message; thus, leakage of privacy. In this paper, we propose an efficient IBEET scheme with bilinear pairing, which reduces the need for time-consuming HashToPoint function and each trapdoor could only be used to perform the equality test on a particular keyword. We then prove the security of our scheme for one-way chosen-ciphertext security against a chosen identity (OW-ID-CCA) attack in the random oracle model (ROM). The performance evaluation of our scheme demonstrates that in comparison to the scheme of Ma (2016), our scheme achieves a reduction of 36.7 and 39.24 percent in computation costs during the encryption phase and test phase, respectively.

Efficient Identity-Based Encryption Scheme with Equality Test in Smart City

With the rapid development of E-commerce, security has been a serious concern in E-commerce transactions. Digital signature is a common and efficient way to ensure the security of an E-commerce transaction by verifying that the message is created by the sender and has not been altered since its creation. Recently, several certificate-based signature schemes based on bilinear pairings were presented. Unfortunately, the security and efficiency of those schemes cannot meet the requirements of applications in E-commerce properly. To address this issue, we introduce a new efficient CBS scheme using bilinear pairings which could be applied in E-commerce applications. We demonstrate the security proof of our proposed scheme under the k-CAA and Inv-CDH assumption in random oracle model. Furthermore, the analysis show that the computation performance of our presented scheme is better than the previously proposed schemes while the communication cost of our scheme is not worse than that of previous schemes.

Efficient Certificate-Based Signature Scheme for Electronic Commerce Security Using Bilinear Pairing

Online social networking applications have become more and more popular in the advance of the technological age. Much of our personal information has been disclosed in social networking activities ...

Yubo Zhang

Papers

Efficient and secure identity-based encryption scheme with equality test in cloud computing

Certificateless searchable public key authenticated encryption with designated tester for cloud-assisted medical Internet of Things

Efficient Identity-Based Encryption Scheme with Equality Test in Smart City

Efficient Certificate-Based Signature Scheme for Electronic Commerce Security Using Bilinear Pairing

Pairing-Free Identity-Based Encryption with Authorized Equality Test in Online Social Networks