secure search
Recently Published Documents


TOTAL DOCUMENTS

53
(FIVE YEARS 24)

H-INDEX

7
(FIVE YEARS 2)

Sensors ◽  
2022 ◽  
Vol 22 (2) ◽  
pp. 528
Author(s):  
Aitizaz Ali ◽  
Muhammad Fermi Pasha ◽  
Jehad Ali ◽  
Ong Huey Fang ◽  
Mehedi Masud ◽  
...  

Due to the value and importance of patient health records (PHR), security is the most critical feature of encryption over the Internet. Users that perform keyword searches to gain access to the PHR stored in the database are more susceptible to security risks. Although a blockchain-based healthcare system can guarantee security, present schemes have several flaws. Existing techniques have concentrated exclusively on data storage and have utilized blockchain as a storage database. In this research, we developed a unique deep-learning-based secure search-able blockchain as a distributed database using homomorphic encryption to enable users to securely access data via search. Our suggested study will increasingly include secure key revocation and update policies. An IoT dataset was used in this research to evaluate our suggested access control strategies and compare them to benchmark models. The proposed algorithms are implemented using smart contracts in the hyperledger tool. The suggested strategy is evaluated in comparison to existing ones. Our suggested approach significantly improves security, anonymity, and monitoring of user behavior, resulting in a more efficient blockchain-based IoT system as compared to benchmark models.


2021 ◽  
Vol 16 (2) ◽  
Author(s):  
Zhangjie Fu ◽  
Yan Wang ◽  
Xingming Sun ◽  
Xiaosong Zhang
Keyword(s):  

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Yunhong Zhou ◽  
Jiehui Nan ◽  
Licheng Wang

At present, with the popularity of Internet of things (IoT), a huge number of datasets generated by IoT devices are being uploaded to the cloud storage in remote data management service, but a series of security and privacy defects also arises, where one of the best ways for preventing data disclosure is encryption. Among them, searchable encryption (SE) is considered to be a very attractive cryptographic technology, since it allows users to search records in an encrypted form and to protect user’s data on an untrusted server. For the sake of enhancing search permission, attribute-based keyword search (ABKS) is an efficient method to provide secure search queries and fine-grained access authentications over ciphertexts. However, most existing ABKS schemes concentrate on single keyword search, which usually returns redundant and irrelevant results, so it would cost some unnecessary computation and communication resources. Furthermore, existing work in the literature mostly only supports unshared multiowner where a specific data owner owns each file, which is not able to satisfy more desired expressive search. In this work, we propose a novel attribute-based multikeyword search for shared multiowner (ABMKS-SM) primitive in IoT to achieve enhanced access control for users; meanwhile, it can support multikeyword search over ciphertexts and give a formal security analysis in the adaptive against chosen keyword attack (IND-CKA) model. Finally, we have also implemented this prototype to show efficiency when compared with some previous schemes.


2021 ◽  
Vol 21 (1) ◽  
pp. 1-17
Author(s):  
Zhitao Guan ◽  
Naiyu Wang ◽  
Xunfeng Fan ◽  
Xueyan Liu ◽  
Longfei Wu ◽  
...  
Keyword(s):  

PLoS ONE ◽  
2021 ◽  
Vol 16 (1) ◽  
pp. e0244979
Author(s):  
Shufen Niu ◽  
Wenke Liu ◽  
Song Han ◽  
Lizhi Fang

As cloud storage technology develops, data sharing of cloud-based electronic medical records (EMRs) has become a hot topic in the academia and healthcare sectors. To solve the problem of secure search and sharing of EMR in cloud platforms, an EMR data-sharing scheme supporting multi-keyword search is proposed. The proposed scheme combines searchable encryption and proxy re-encryption technologies to perform keyword search and achieve secure sharing of encrypted EMR. At the same time, the scheme uses a traceable pseudo identity to protect the patient’s private information. Our scheme is proven secure based on the modified Bilinear Diffie-Hellman assumption and Quotient Decisional Bilinear Diffie-Hellman assumption under the random oracle model. The performance of our scheme is evaluated through theoretical analysis and numerical simulation.


Sign in / Sign up

Export Citation Format

Share Document