Searchable Encryption Research Papers - Academia.edu (original) (raw)

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 both theoretically and practically in the performance analysis section.

- by
- •
- Data Encryption, Keyword Search, Public Key Cryptosystems, Searchable Encryption

We build on the new security notion for deterministic encryption (PRIV) and the PRIV-secure schemes presented by Bellare et al at Crypto’07. Our work introduces: 1) A generic and efficient construction of deterministic length-preserving hybrid encryption, which is an improvement on the scheme sketched in the above paper; to our best knowledge, this is the first example of length-preserving hybrid encryption; 2) postquantum deterministic encryption (using the IND-CPA variant of code-based McEliece PKE) which enjoys a simplified construction, where the public key is re-used as a hash function.

- by Kirill Morozov
- •
- Mathematics, Computer Science, Network Security, Database

The fast progression of the Internet of Vehicles (IoV) has resulted in a large number of vehicles connecting to networks. This leads to massive growth in the data collected from vehicles via IoV. Fortunately, cloud computing provides a vast range of services such as operating systems, hardware, software, and resources. Therefore, the massive amount of data cumulated through IoV can be outsourced to the cloud. However, considering the untrusted nature of the cloud, the cumulated data must be encrypted before it is outsourced to the cloud server. Unfortunately, this ensures to difficulty while searching the data. To address this challenge, an efficient certificateless public key cryptography with equality test (CL-PKC-ET) is presented in this paper. In this scheme, the authorized cloud server has the permission to execute the equality test on encrypted data and retrieve the result without knowing any relevant information about the ciphertext. Our CL-PKC-ET scheme is demonstrated under the Bilinear Diffie-Hellman assumption in the random oracle model. Ultimately, we compare the CL-PKE-ET with a state-of-art scheme and the performance evaluation indicates that our scheme accomplishes 96.40%, 32.08%, and 43.98% reduction in computation costs during the encryption, decryption, and test stages, respectively. Therefore, we assert that our scheme is ideal for deployment in both the cloud and IoV environments. INDEX TERMS Internet of Vehicles (IoV), cloud, certificateless, equality test.

- by rashad elhabob
- •
- Equality Test, Searchable Encryption, Internet of Vehicles
- by Kirill Morozov
- •
- Mathematics, Computer Science, Network Security, Database

As adoption of eHealth solutions advances, new computing paradigms - such as cloud computing - bring the potential to improve efficiency in managing medical health records and help reduce costs. However, these opportunities introduce new security risks which can not be ignored. In this paper, we present a forward-looking design for a privacy-preserving eHealth cloud system. The proposed solution, is based on a Symmetric Searchable Encryption scheme that allows patients of an electronic healthcare system to securely store encrypted versions of their medical data and search directly on them without having to decrypt them first. As a result, the proposed protocol offers better protection than the current available solutions and paves the way for the next generation of eHealth systems.

- by Antonis Michalas
- •
- Information Security, Cloud Computing, eHealth, Cyber Security
- by Iva Sella
- •
- Equality Test, Searchable Encryption, Internet of Vehicles

Cloud Computing is an emerging technology which provides on-demand services based on the pay-asyou-go model which reduces IT costs significantly. Cloud comes with many benefits such as Business continuity, Collaboration efficiency, scalability, resource sharing etc. But still, it constitutes several data security issues such as data confidentiality, integrity, authentication, privacy etc. Thus, to protect sensitive data, the document is encrypted at the data owner side before transmitting it to a cloud environment. Cryptography is necessary to provide data security. Although this overpowers the advantages of cloud computing, whenever data user wants to access a part of data it needs to decrypt the data before using. In this paper, a Hybrid Searchable Encryption Scheme is proposed which provide data security while supporting multi-keyword search over the encrypted data by using a Vector Space Model (VSM). Where sense embedding technique is used to create VSM for the document. To provide data confidentiality combination of AES and Blowfish encryption is used. Sha-3 and RSA are used for data integrity. Steganography is applied for secure transfer of keys and message digest. The experimental result shows that the proposed scheme achieves better data security by providing data confidentiality, integrity and authentication along with multi-keyword search at the client end.

- by Prachi Gupta and +1
- •
- Cloud Computing, Vector Space Model, Searchable Encryption, Hybrid Encryption

Outsourcing data storage is a topic of emerging importance in database security. In this paper, we consider exact-match query functionality in the public-key setting. Solutions proposed in the database community lack clarity and proofs of security, while encryption-with-keyword-search schemes from the cryptographic community require linear search time (in database size) for each query, which is prohibitive. To bridge the gap, we introduce a new cryptographic primitive we call (asymmetric) efficiently-searchable encryption (ESE), which allows users to store encrypted data on a remote, untrusted server in such a way that the server can index the data and retrieve or update required parts on request just as e#ciently as for unencrypted data. We give an appropriate definition of security for ESE and several constructions that provably-achieve the definition, in the random oracle model, while providing various computation- and bandwidth-efficiency properties. As deterministic encryption ...

- by Alexandra Boldyreva
- •
- Database, Searchable Encryption

This paper proposes a system, entitled Concealer that allows sharing time-varying spatial data (e.g., as produced by sensors) in encrypted form to an untrusted third-party service provider to provide location-based applications (involving aggregation queries over selected regions over time windows) to users. Concealer exploits carefully selected encryption techniques to use indexes supported by database systems and combines ways to add fake tuples in order to realize an efficient system that protects against leakage based on output-size. Thus, the design of Concealer overcomes two limitations of existing symmetric searchable encryption (SSE) techniques: (i) it avoids the need of specialized data structures that limit usability/practicality of SSE in large scale deployments, and (ii) it avoids information leakages based on the output-size, which may leak data distributions. Experimental results validate the efficiency of the proposed algorithms over a spatial time-series dataset (collected from a smart space) and TPC-H datasets, each of 136 Million rows, the size of which prior approaches have not scaled to.

- by Shantanu Sharma
- •
- Information Security, Database Systems, Privacy, Security

Abstract. Searchable encryption schemes provide an important mechanism to cryptographically protect data while keeping it available to be searched and accessed. In a common approach for their construction, the encrypting entity chooses one or several keywords that describe the content of each encrypted record of data. To perform a search, a user obtains a trapdoor for a keyword of her interest and uses this trapdoor to find all the data described by this keyword. We present a searchable encryption scheme that allows users to privately search by keywords on encrypted data in a public key setting and decrypt the search results. To this end, we define and implement two primitives: public key encryption with oblivious keyword search (PEOKS) and committed blind anonymous identity-based encryption (IBE). PEOKS is an extension of public key encryption with keyword search (PEKS) in which users can obtain trapdoors from the secret key holder without revealing the keywords. Furthermore, we de...

- by Caroline Sheedy
- •
- Computer Science, Public key cryptography, Keyword Search, Public Key Encryption