检索结果-南通市图书馆

IXT: Improved searchable encryption for multi-word queries based on PSI

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2023年第5期17卷 153-163页

作者： Yunbo YANG Xiaolei DONG Zhenfu CAO Jiachen SHEN Shangmin DOU Shanghai Key Laboratory of Trustworthy Computing East China Normal UniversityShanghai 200062China Kunyao Academy of Shanghai Kunyao Network Technology Co. Ltd.Shanghai 200233China PwC US Advisory Shanghai AC Shanghai 201203China

Oblivious Cross-Tags(OXT)[1]is the first efficient searchable encryption(SE)protocol for conjunctive queries in a single-writer single-reader framework.However,it also has a trade-off between security and efficiency by leaking partial database information to the server.Recent attacks on these SE schemes show that the leakages from these SE schemes can be used to recover the content of queried keywords.To solve this problem,Lai et al.[2]propose Hidden Cross-Tags(HXT),which reduces the access pattern leakage from Keyword Pair Result Pattern(KPRP)to Whole Result Pattern(WRP).However,the WRP leakage can also be used to recover some additional contents of queried keywords.This paper proposes Improved Cross-Tags(IXT),an efficient searchable encryption protocol that achieves access and searches pattern hiding based on the labeled private set intersection.We also prove the proposed labeled private set intersection(PSI)protocol is secure against semi-honest adversaries,and IXT is-semi-honest secure(is leakage function).Finally,we do experiments to compare IXT with HXT.The experimental results show that the storage overhead and computation overhead of the search phase at the client-side in IXT is much lower than those in HXT.Meanwhile,the experimental results also show that IXT is scalable and can be applied to various sizes of datasets.

关键词： searchable encryption private set intersection

Secure Content Based Image Retrieval Scheme Based on Deep Hashing and searchable encryption

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2023年第6期75卷 6161-6184页

作者： Zhen Wang Qiu-yu Zhang Ling-tao Meng Yi-lin Liu School of Computer and Communication Lanzhou University of TechnologyLanzhou730050China

To solve the problem that the existing ciphertext domain image retrieval system is challenging to balance security,retrieval efficiency,and retrieval accuracy.This research suggests a searchable encryption and deep hashing-based secure image retrieval technique that extracts more expressive image features and constructs a secure,searchable encryption scheme.First,a deep learning framework based on residual network and transfer learn-ing model is designed to extract more representative image deep features.Secondly,the central similarity is used to quantify and construct the deep hash sequence of features.The Paillier homomorphic encryption encrypts the deep hash sequence to build a high-security and low-complexity searchable index.Finally,according to the additive homomorphic property of Paillier homomorphic encryption,a similarity measurement method suitable for com-puting in the retrieval system’s security is ensured by the encrypted domain.The experimental results,which were obtained on Web Image Database from the National University of Singapore(NUS-WIDE),Microsoft Common Objects in Context(MS COCO),and ImageNet data sets,demonstrate the system’s robust security and precise retrieval,the proposed scheme can achieve efficient image retrieval without revealing user privacy.The retrieval accuracy is improved by at least 37%compared to traditional hashing schemes.At the same time,the retrieval time is saved by at least 9.7%compared to the latest deep hashing schemes.

关键词： Content-based image retrieval deep supervised hashing central similarity quantification searchable encryption Paillier homomorphic encryption

A searchable encryption Scheme Based on Lattice for Log Systems in Blockchain

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2022年第9期72卷 5429-5441页

作者： Gang Xu Yibo Cao Shiyuan Xu Xin Liu Xiu-Bo Chen Yiying Yu Xiaojun Wang School of Information Science and Technology North China University of TechnologyBeijing100144China School of Information Engineering Inner Mongolia University of Science and TechnologyBaotou014010China Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and TelecommunicationsBeijing100876China School of Electronic Engineering Dublin City UniversityDublinIreland

With the increasing popularity of cloud storage,data security on the cloud has become increasingly visible.searchable encryption has the ability to realize the privacy protection and security of data in the cloud.However,with the continuous development of quantum computing,the standard Public-key encryption with Keyword Search(PEKS)scheme cannot resist quantumbased keyword guessing attacks.Further,the credibility of the server also poses a significant threat to the security of the retrieval process.This paper proposes a searchable encryption scheme based on lattice cryptography using blockchain to address the above problems.Firstly,we design a lattice-based encryption primitive to resist quantum keyword guessing attacks.Moreover,blockchain is to decentralize the cloud storage platform’s jurisdiction of data.It also ensures that the traceability of keyword retrieval process and maintains the credibility of search result,which malicious platforms are prevented as much as possible from deliberately sending wrong search results.Last but not least,through security analysis,our proposed scheme satisfies the credibility and unforgeability of the keyword ciphertext.The comprehensive performance evaluates that our scheme has certain advantages in terms of efficiency compared with others.

关键词： Lattice cryptography searchable encryption blockchain privacy protection log system information security applied cryptography

Forward and backward secure searchable encryption with multi-keyword search and result verification

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2022年第5期65卷 270-272页

作者： Jie CUI Yue SUN Yan XU Miaomiao TIAN Hong ZHONG School of Computer Science and Technology Anhui University Institute of Physical Science and Information Technology Anhui University Anhui Engineering Laboratory of LoT Security Technologies Anhui University

Dear editor,searchable encryption [1] is a new search method that not only protects personal privacy, but also searches over encrypted data. The multi-keyword scheme can search documents with more keywords so that the... 详细信息

关键词： Forward Security Backward Security Multi-keyword Search Verification searchable encryption

MULKASE:a novel approach for key-aggregate searchable encryption for multi-owner data

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2019年第12期20卷 1717-1748页

作者： Mukti PADHYA Devesh CJINWALA Department of Computer Engineering Sardar Vallabhbhai National Institute of TechnologySurat 394000India Department of Computer Science and Engineering Indian Institute of TechnologyJammu 180001India

Recent attempts at key-aggregate searchable encryption(KASE) combine the advantages of searching encrypted data with support for data owners to share an aggregate searchable key with a user delegating search rights to a set of data. A user, in turn, is required to submit only one single aggregate trapdoor to the cloud to perform a keyword search across the shared set of data. However, the existing KASE methods do not support searching through data that are shared by multiple owners using a single aggregate trapdoor. Therefore, we propose a MULKASE method that allows a user to search across different data records owned by multiple users using a single trapdoor. In MULKASE, the size of the aggregate key is independent of the number of documents held by a data owner. The size of an aggregate key remains constant even though the number of outsourced ciphertexts goes beyond the predefined limit. Security analysis proves that MULKASE is secure against chosen message attacks and chosen keyword attacks. In addition, the security analysis confirms that MULKASE is secure against cross-pairing attacks and provides query privacy. Theoretical and empirical analyses show that MULKASE performs better than the existing KASE methods. We also illustrate how MULKASE can carry out federated searches.

关键词： searchable encryption Cloud storage Key-aggregate encryption Data sharing

维普期刊数据库

Cetus: an efficient symmetric searchable encryption against file-injection attack with SGX

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2021年第8期64卷 195-212页

作者： Yanyu HUANG Siyi LV Zheli LIU Xiangfu SONG Jin LI Yali YUAN Changyu Dong College of Cyber Science and the College of Computer Science Tianjin Key Laboratory of Network and Data Security TechnologyNankai University School of Computer Science and Technology Shandong University School of Computer Science Guangzhou University Department of Computer Science University of G?ttingen School of Computing Newcastle University

Symmetric searchable encryption(SSE) allows the users to store and query their private data in the encrypted database. Many SSE schemes for different scenarios have been proposed in the past few years, however, most of these schemes still face more or fewer security issues. Using these security leakages,many attacks against the SSE scheme have been proposed, and especially the non-adaptive file injection attack is the most serious. Non-adaptive file injection attack(NAFA) can effectively recover some extremely important private information such as keyword plaintext. As of now, there is no scheme that can effectively defend against such attacks. We first propose the new security attribute called toward privacy to resist nonadaptive file injection attacks. We then present an efficient SSE construction called Cetus to achieve toward privacy. By setting up a buffer and designing the efficient oblivious reading algorithm based on software guard extensions(SGX), we propose the efficient one-time oblivious writing mechanism. Oblivious writing protects the update pattern and allows search operations to be performed directly on the data. The experiment results show that Cetus achieves O(aw) search time and O(1) update communication. The practical search time, communication, and computation overheads incurred by Cetus are lower than those of state-of-the-art.

关键词： searchable encryption SGX technique file injection attack forward/toward privacy cloud databases

Blockchain-Assisted Secure Fine-Grained searchable encryption for a Cloud-Based Healthcare Cyber-Physical System

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2021年第12期8卷 1877-1890页

作者： Mamta Brij B.Gupta Kuan-Ching Li Victor C.M.Leun Kostas E.Psannis Shingo Yamaguchi IEEE the Department of Computer Engineering National Institute of Technology the Asia University the Macquarie University the Department of Computer Science and Information Engineering Providence University the Computer Science and Software Engineering Shenzhen University the University of British Columbia the Department of Applied Informatics University of Macedonia the Graduate School of Sciences and Technology for Innovation Yamaguchi University

The concept of sharing of personal health data over cloud storage in a healthcare-cyber physical system has become popular in recent times as it improves access quality.The privacy of health data can only be preserved by keeping it in an encrypted form,but it affects usability and flexibility in terms of effective search.Attribute-based searchable encryption(ABSE)has proven its worth by providing fine-grained searching capabilities in the shared cloud storage.However,it is not practical to apply this scheme to the devices with limited resources and storage capacity because a typical ABSE involves serious computations.In a healthcare cloud-based cyber-physical system(CCPS),the data is often collected by resource-constraint devices;therefore,here also,we cannot directly apply ABSE schemes.In the proposed work,the inherent computational cost of the ABSE scheme is managed by executing the computationally intensive tasks of a typical ABSE scheme on the blockchain network.Thus,it makes the proposed scheme suitable for online storage and retrieval of personal health data in a typical CCPS.With the assistance of blockchain technology,the proposed scheme offers two main benefits.First,it is free from a trusted authority,which makes it genuinely decentralized and free from a single point of failure.Second,it is computationally efficient because the computational load is now distributed among the consensus nodes in the blockchain network.Specifically,the task of initializing the system,which is considered the most computationally intensive,and the task of partial search token generation,which is considered as the most frequent operation,is now the responsibility of the consensus nodes.This eliminates the need of the trusted authority and reduces the burden of data users,respectively.Further,in comparison to existing decentralized fine-grained searchable encryption schemes,the proposed scheme has achieved a significant reduction in storage and computational cost for the secret key associated with users.It has been verified b

关键词： Cloud-based cyber-physical systems(CCPS) data encryption healthcare information search and retrieval keyword search public-key cryptosystems searchable encryption

维普期刊数据库

Secure Channel Free ID-Based searchable encryption for Peer-to-Peer Group

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2016年第5期31卷 1012-1027页

作者： Xiao-Fen Wang Yi Mu Rongmao Chen Xiao-Song Zhang College of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Big Data Research Center University of Electronic Science and Technology of China Chengdu 611731 China School of Computing and Information Technology University of Wollongong Wollongong NSW 2500 Australia College of Computer National University of Defense Technology Changsha 410073 China

Data sharing and searching are important functionalities in cloud storage. In this paper, we show how to securely and flexibly search and share cloud data among a group of users without a group manager. We formalize a novel cryptosystem： secure channel free searchable encryption in a peer-to-peer group, which features with the secure cloud data sharing and searching for group members in an identity-based setting. Our scheme allows group members to join or leave the group dynamically. We present two schemes： basic scheme and enhanced scheme. We formally prove that our basic scheme achieves consistency and indistinguishability against the chosen keyword and ciphertext attack and the outsider＇s keyword guessing attack, respectively. An enhanced scheme is also proposed to achieve forward secrecy, which allows to revoke user search right over the former shared data.

关键词： searchable encryption forward secrecy data sharing peer-to-peer group

Lattice-Based searchable encryption Scheme against Inside Keywords Guessing Attack

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2020年第8期64卷 1107-1125页

作者： Xiaoling Yu Chungen Xu Lei Xu Yuntao Wang School of Science Nanjing University of Science and TechnologyNanjing210094China School of Information Science Security and NetworksJapan Advanced Institute of Science and TechnologyIshikawa9231292Japan

To save the local storage,users store the data on the cloud server who offers convenient internet services.To guarantee the data privacy,users encrypt the data before uploading them into the cloud server.Since encryption can reduce the data availability,public-key encryption with keyword search(PEKS)is developed to achieve the retrieval of the encrypted data without decrypting them.However,most PEKS schemes cannot resist quantum computing attack,because the corresponding hardness assumptions are some number theory problems that can be solved efficiently under quantum computers.Besides,the traditional PEKS schemes have an inherent security issue that they cannot resist inside keywords guessing attack(KGA).In this attack,a malicious server can guess the keywords encapsulated in the search token by computing the ciphertext of keywords exhaustively and performing the test between the token and the ciphertext of keywords.In the paper,we propose a lattice-based PEKS scheme that can resist quantum computing attacks.To resist inside KGA,this scheme adopts a lattice-based signature technique into the encryption of keywords to prevent the malicious server from forging a valid ciphertext.Finally,some simulation experiments are conducted to demonstrate the performance of the proposed scheme and some comparison results are further shown with respect to other searchable schemes.

关键词： searchable encryption lattice assumption inside keywords guessing attack post-quantum secure