With the digitization of traditional medical records, medical institutions encounter difficult problems, such as electronic health record storage and sharing. Patients and doctors spend considerable time querying the required data when accessing electronic health records, but the obtained data are not necessarily correct, and access is sometimes restricted. On this basis, this study proposes a medical data sharing scheme based on permissioned blockchains, which use ciphertext-based attribute encryption to ensure data confidentiality and access control of medical data. Under premise of ensuring patient identity privacy, a polynomial equation is used to achieve an arbitrary connection of keywords, and then blockchain technology is combined. In addition, the proposed scheme has keyword-indistinguishability against adaptive chosen keyword attacks under the random oracle model. Analysis shows that the scheme has high retrieval efficiency.
With the wide application of 5G network, much research has been carried out in recent years towards 5G network slicing technology in order to save 5G network resources and satisfy the service requirements of different users. Different public key cryptosystems may be deployed in different 5G network slicings. Therefore, heterogeneous signcryption is required to achieve secure communications between different 5G network slices. The existing scheme is a one-to-one communication between 5G network slicings. To obtain one-to-many and many-to-one secure communications, two new privacy-preserving heterogeneous signcryption schemes have been proposed in this paper based on 5G network slicings, which can accomplish mutual communications between the public key infrastructure and the certificateless public key cryptography. In this work, we present PKI→CLC completely anonymous multi-receiver signcryption (PMRCHS) and CLC→PKI heterogeneous aggregate signcryption (CPHAS) schemes based on the 5G Internet of Things Slicing and the 5G Internet of Vehicle Slicing. Under the random oracle model, the proposed schemes have proved to satisfy confidentiality and unforgeability under the computational Diffie-Hellman problem and discrete logarithm problem. Furthermore, we make comparisons of the proposed work with the existing works in terms of computational cost, communication cost, anonymity and communication direction. The results show that the proposed schemes are more secure and effective.
Searchable encryption is a promising technique that allows cloud service provider return the interested files to the user, even if the shared files are encrypted. However, once encrypted data is uploaded to the cloud, the data owner loses the physical control of the data; the cloud service provider may face the problem of duplicate data occupying the storage space; how can the data user obtain the legal access rights? Therefore, data integrity detection, data deduplication and reasonable access authorization become the focus of attention. To address these problems, we propose a novel verifiable attribute-based keyword search over encrypted data supporting data deduplication. In the scheme, attribute-based encryption is introduced to achieve effective access authorization based on its one-to-many advantage, as well data confidentiality. A data label of each shared file is generated to finish data deduplication, while the third-party auditor and hash function are adopted to ensure data integrity, including ciphertext, plaintext and symmetric key. Moreover, in order to solve the problem of high computational load caused by attribute-based encryption, outsourcing decryption is used to optimize the scheme. The formal security analysis shows that our scheme can implement fine-grained authorization to search and realize indistinguishable keywords, unforgeability of signatures and confidentiality of ciphertexts. Meanwhile, the results of the experiment reveal that our scheme has a low band-width communication, storage and computability.
The development of the Internet has dramatically facilitated the present society. While a large amount of data is produced, private data security involves users' data rights. Traditionally, attribute-based encryption (ABE) still needs to improve efficiency in the face of a large amount of data. The introduction of edge computing environments reduces the operating costs of lightweight devices by outsourcing some encryption and decryption operations. Therefore, we design an efficient attribute-based encryption scheme under edge computing that supports keyword search. Data owners and users do not disclose private information to the cloud during the search phase. Our work considers the computational efficiency of ordinary and lightweight users, and partial operations can be outsourced according to the demand during decryption, which is more flexible and applicable to practical applications. The scheme also supports efficient attribute revocation and ciphertext update in the cloud environment. Moreover, the proposed algorithm has been proven to be IND-sCP-CPA security and IND-CKA security. The work compares our algorithm with some typical schemes in terms of storage overhead and computation cost in the end. The performance analysis results indicate that the proposed work is efficient and suitable for edge computing.
To achieve secure communication in heterogeneous cryptography systems, we present a heterogeneous hybrid signcryption scheme. The proposed scheme allows a sender in an identity-based cryptography system to send multi-message to multi-receiver in a certificateless cryptography system with different master keys. At the same time, all users are mapped to a distinct pseudo-identity for conditional identity privacy preservation. A trusted authority could trace the real identity when necessary. Compared with existing schemes, the proposed scheme is more practical for actual applications. In addition, the proposed scheme has indistinguishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen message attacks under the random oracle model.