To improve the quality of medical care and reduce unnecessary medical errors, electronic medical records (EMRs) are widely applied in hospital information systems. However, rapidly increasing EMRs bring heavy storage burden to hospitals. Professional data management service provided by cloud server can save the hospital local storage, and meanwhile, realize EMRs sharing among external researchers. However, the risk of leaking information of patients discourages hospitals to outsource patients’ EMRs to the remote cloud server. In this paper, a secure and efficient cloud storing and sharing method can be achieved by applying the proposed public key authenticated encryption with ciphertext update and keyword search (PAUKS). The proposed PAUKS scheme enables EMRs to be encrypted and queried without decryption, and is secure against inside keyword guessing attacks. Compared with the recently proposed PAEKS in literature, the PAUKS scheme enjoys smaller computation and communication overheads. The required number of trapdoors per query is constant in PAUKS scheme, instead of the linearly expanding as the number of senders increases in PAEKS. Furthermore, an inverted index can be built safely in PAUKS scheme to accelerate the query procedure. Experiment results show that our PAUKS scheme owns a comparable running overhead, but enjoys a higher query efficiency after ciphertexts update. 

Public-Key Authenticated Encryption With Keyword Search Supporting Constant Trapdoor Generation and Fast Search

Secure cloud search service allows resource-constrained clients to effectively search over encrypted cloud storage. Towards enabling owner-enforced search authorization, the notion of attribute-based keyword search (ABKS) has been introduced and widely deployed in practice. To enhance traditional security of ABKS, two state-of-the-art solutions are presented to address keyword guessing attacks or setup inconsistency for secret key. Nevertheless, they have not simultaneously considered the following threats to a data user: (i) inconsistent secret key/cipher-index caused by outside dishonest authority and/or data owner; (ii) algorithm substitution attacks (ASA) launched by inside adversarial eavesdropping. These attacks may unfortunately lead to cloud data breach and user information exposure. To tackle such outside and inside threats, we introduce subversion-resistance and consistency for secure and fine-grained cloud document search services. In particular, we propose a consistent ABKS system with cryptographic reverse firewalls (CRF). Technically, we refer to verifiable functional encryption and employ non-interactive zero-knowledge proofs of discrete logarithm equality to ensure strong input consistency for ABKS. In addition, we build a trusted CRF zone for sanitizing algorithm outputs against ASA attacks. Moreover, we formalize the security model and formally prove security of our system. To clarify practical performance, we implement state-of-the-art solutions and our system in real cloud environment based on Enron dataset. The results show that our system achieves more enhanced security properties without obviously sacrificing performance. In particular, our system achieves comparable time and storage cost for document-index encryption and document search, as compared to state-of-the-art solutions.

Subversion-Resistant and Consistent Attribute-Based Keyword Search for Secure Cloud Storage

A more efficient public-key authenticated encryption scheme with keyword search

In Industrial Internet of Things, powerful cloud servers are needed to process substantial sensitive industrial data, which should be encrypted before being uploaded to the cloud. To retrieve encrypted data, certificateless public key authenticated encryption with keyword search (CLPAEKS) is proposed. It has three advantages: 1) no certificate management problem; 2) no key escrow problem; and 3) inside keyword guessing attack resistance. The basic security requirements of current CLPAEKS schemes are ciphertext indistinguishability (CI security) and trapdoor indistinguishability (TI security) in the single-challenge setting. However, these security requirements are incomplete, since some necessary real-world scenarios are not considered: 1) the multichallenge setting to capture scenarios where multiple keywords may be embedded in one file or search query and 2) the fully chosen keyword attack, which allows the adversary to obtain ciphertext or trapdoor of any keyword. In this article, we formalize two enhanced security models for the CLPAEKS system to both capture the multichallenge setting and resist against fully chosen keyword attacks. Then, we provide a cryptanalysis on some of previous CLPAEKS schemes to better understand the necessity of these security models. Furthermore, we propose the first CLPAEKS scheme provably secure in our enhanced security models. Compared with previous CLPAEKS schemes, our scheme provides stronger security guarantee for the privacy of both ciphertext keyword and target keyword. We also evaluate the performance of our CLPAEKS scheme and optimize the efficiency of our scheme by performing most of the computation offline. As a result, the online efficiency of our CLPAEKS scheme is comparable to other schemes optimized using the same techniques. 

Certificateless Public Key Authenticated Searchable Encryption With Enhanced Security Model in IIoT Applications

Driven by cloud computing technologies, public-key encryption with keyword search (PEKS) is becoming a common practice from aspects of the Industrial Internet of Things, smart healthcare, vehicular social networks, and so on. However, a dozen years of PEKS development is accompanied by some security and privacy issues in the encrypted data search and access processes. The keyword guessing attack is a typical user privacy threat model, that is, an adversary could guess the user&#x2019;s retrieval keyword given a search trapdoor. On the other hand, the emergence of quantum computers make traditional PEKS schemes no longer secure. Although scholars put forward some postquantum secure PEKS schemes, these schemes are based on lattice cryptography with a larger key size. To the best of our knowledge, there is no quantum-resist PEKS scheme established on elliptic curve cryptography. This article utilizes PEKS with designated tester primitive and quantum resistance of isogeny. Then, we put forward a postquantum searchable encryption scheme named Isoga, which fights against keyword guessing attacks. We prove Isoga&#x2019;s searchable ciphertext security and trapdoor indistinguishability under isogeny-related difficult assumptions. Performance evaluation indicates that the Isoga scheme is more practical in the quantum environment, considering seven schemes&#x2019; security properties, communication cost, and computing overload among. 

Isoga: An Isogeny-Based Quantum-Resist Searchable Encryption Scheme Against Keyword Guessing Attacks

In cloud, sensitive data is stored in an encrypted form, and searchable encryption is a technique which allows user to search over encrypted data by keyword and it leaks no useful information. However, the secure searchable encryption scheme which can prevent inside keyword guessing attacks (IKGA) and satisfy multi-trapdoor privacy has not been proposed. We first review the security of Wu et al.’s scheme and demonstrate that their scheme is insecure under IKGA and multi-keyword guessing attacks in this paper. To solve these issues, we propose an improved certificateless public key searchable encryption scheme. Furthermore, we give the proof of the security of our scheme under the computational bilinear Diffie-Hellman assumption. It shows that our scheme can resist IKGA successfully, and provides multi-ciphertext indistinguishability and multi-trapdoor privacy. The better performance is shown in our experiment.

An improved secure certificateless public-key searchable encryption scheme with multi-trapdoor privacy

Abstract In the cloud, users prefer to store their sensitive data in encrypted form. Searching keywords over encrypted data without loss of data confidentiality is an important issue. In 2004, Boneh et al. proposed the first public-key searchable encryption scheme which allows users to search by the private key. However, most existing public-key searchable encryption schemes are vulnerable to keyword guessing attack and can not satisfy multi-ciphertext indistinguishability. In this paper, we construct a secure designated server public-key searchable encryption based on Diffie-Hellman problem. Our security analysis shows that our proposed scheme can resist against keyword guessing attack and provide multi-ciphertext indistinguishability for any adversity. Furthermore, the proposed scheme can achieve multi-trapdoor privacy for external attackers. Moreover, the simulation results between our scheme and previous schemes demonstrate our new scheme is suitable for practical application. 

/pdf/an-improved-secure-designated-server-public-key-searchable-coplps0l.pdf

An improved secure designated server public key searchable encryption scheme with multi-ciphertext indistinguishability

Searchable encryption is an important cryptographic technique that achieves data security and keyword retrieval over encrypted data in cloud. In 2004, Boneh et.al proposed the first searchable encryption scheme based on asymmetric cryptography. Since then, many variants of public key searchable encryption schemes were proposed. However, most previous works are vulnerable to multi-ciphertext attack, and they cannot provide trapdoor indistinguishability. Another problem is how to improve the searching efficiency. To deal with two issues, we construct a fast and secure public key authenticated searchable encryption scheme with designed server. Our scheme can resist keyword guessing attacks, chosen multi-keyword attacks and multi-trapdoor attacks. The search function in our scheme achieves the logarithmic search time in number of keywords while most existing schemes required the linear time. By comparison with previous schemes in computational complexity, our scheme is very fast in keyword search.

An Efficient and Secure Public Key Authenticated Encryption With Keyword Search in the Logarithmic Time

/pdf/an-improved-secure-designated-server-public-key-searchable-3kc5izud.pdf

Cryptanalysis of Two Public Key Encryption Schemes with Multi-keyword Search

Popular Tasks used by Researchers

How can I help with your research?

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

We encountered an error while loading the panel. Please try refreshing the page.

Something went wrong

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

Anyone with the link can view this chat. You can switch it back to private anytime.

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Junling Guo

Author Tools

Chat about Author

Papers

An improved secure certificateless public-key searchable encryption scheme with multi-trapdoor privacy

An improved secure designated server public key searchable encryption scheme with multi-ciphertext indistinguishability

An Efficient and Secure Public Key Authenticated Encryption With Keyword Search in the Logarithmic Time

An improved secure designated server public key searchable encryption scheme with multi-ciphertext indistinguishability

Cryptanalysis of Two Public Key Encryption Schemes with Multi-keyword Search