Distributed Searchable Asymmetric Encryption

Searchable asymmetric encryption (SAE) can also be called Public Key Encryption with Keyword Search (PEKS), which allows us to search the keyword on the data of having been encrypted. The essence of Asymmetric searchable encryption is that users exchange the data of encryption, one party sends a ciphertext with key encryption, the other party with another key receives the ciphertext. Encryption key is not the same as the decryption key, and cannot deduce another key from any one of the key, thus it greatly enhances the information protection, and can prevent leakage the user's search criteria—Search Pattern. Secure schemes of SAE are practical, sometimes, however the speed of encryption/decryption in Public-key encryption is slower than private key. In order to get higher efficiency and security in information retrieval, in this paper we introduce the concept of distributed SAE, which is useful for security and can enable search operations on encrypted data. Moreover, we give the proof of security.

Download Full-text

BESTIE: Broadcast Encryption Scheme for Tiny IoT Equipment

Electronics ◽

10.3390/electronics9091389 ◽

2020 ◽

Vol 9 (9) ◽

pp. 1389

Author(s):

Jiwon Lee ◽

Jihye Kim ◽

Hyunok Oh

Keyword(s):

The Other ◽

Public Key ◽

Broadcast Encryption ◽

Encryption Scheme ◽

The Public ◽

Private Key ◽

Diffie Hellman ◽

The Standard Model ◽

Encryption Decryption ◽

Subset Difference

In public key broadcast encryption, anyone can securely transmit a message to a group of receivers such that privileged users can decrypt it. The three important parameters of the broadcast encryption scheme are the length of the ciphertext, the size of private/public key, and the performance of encryption/decryption. It is suggested to decrease them as much as possible; however, it turns out that decreasing one increases the other in most schemes. This paper proposes a new broadcast encryption scheme for tiny Internet of Things (IoT) equipment (BESTIE), minimizing the private key size in each user. In the proposed scheme, the private key size is O(logn), the public key size is O(logn), the encryption time per subset is O(logn), the decryption time is O(logn), and the ciphertext text size is O(r), where n denotes the maximum number of users, and r indicates the number of revoked users. The proposed scheme is the first subset difference-based broadcast encryption scheme to reduce the private key size O(logn) without sacrificing the other parameters. We prove that our proposed scheme is secure under q-Simplified Multi-Exponent Bilinear Diffie-Hellman (q-SMEBDH) in the standard model.

Download Full-text

Public Key Encryption with Keyword Search from Lattices in Multiuser Environments

Mathematical Problems in Engineering ◽

10.1155/2016/6549570 ◽

2016 ◽

Vol 2016 ◽

pp. 1-7 ◽

Cited By ~ 1

Author(s):

Daini Wu ◽

Xiaoming Wang ◽

Qingqing Gan

Keyword(s):

Data Privacy ◽

Keyword Search ◽

Random Oracle Model ◽

Random Oracle ◽

Public Key ◽

Public Key Encryption ◽

Encrypted Data ◽

Cloud Server ◽

Learning With Errors ◽

Multiuser Environments

A public key encryption scheme with keyword search capabilities is proposed using lattices for applications in multiuser environments. The proposed scheme enables a cloud server to check if any given encrypted data contains certain keywords specified by multiple users, but the server would not have knowledge of the keywords specified by the users or the contents of the encrypted data, which provides data privacy as well as privacy for user queries in multiuser environments. It can be proven secure under the standard learning with errors assumption in the random oracle model.

Download Full-text

Privacy-Preserving and Efficient Public Key Encryption with Keyword Search Based on CP-ABE in Cloud

Cryptography ◽

10.3390/cryptography4040028 ◽

2020 ◽

Vol 4 (4) ◽

pp. 28

Author(s):

Yunhong Zhou ◽

Shihui Zheng ◽

Licheng Wang

Keyword(s):

Access Control ◽

Data Privacy ◽

Keyword Search ◽

Good Method ◽

Privacy Preserving ◽

Public Key ◽

Public Key Encryption ◽

Encrypted Data ◽

Fine Grained ◽

Attribute Based Encryption

In the area of searchable encryption, public key encryption with keyword search (PEKS) has been a critically important and promising technique which provides secure search over encrypted data in cloud computing. PEKS can protect user data privacy without affecting the usage of the data stored in the untrusted cloud server environment. However, most of the existing PEKS schemes concentrate on data users’ rich search functionalities, regardless of their search permission. Attribute-based encryption technology is a good method to solve the security issues, which provides fine-grained access control to the encrypted data. In this paper, we propose a privacy-preserving and efficient public key encryption with keyword search scheme by using the ciphertext-policy attribute-based encryption (CP-ABE) technique to support both fine-grained access control and keyword search over encrypted data simultaneously. We formalize the security definition, and prove that our scheme achieves selective indistinguishability security against an adaptive chosen keyword attack. Finally, we present the performance analysis in terms of theoretical analysis and experimental analysis, and demonstrate the efficiency of our scheme.

Download Full-text

SPEKS: Forward Private SGX-Based Public Key Encryption with Keyword Search

Applied Sciences ◽

10.3390/app10217842 ◽

2020 ◽

Vol 10 (21) ◽

pp. 7842

Author(s):

Hyundo Yoon ◽

Soojung Moon ◽

Youngki Kim ◽

Changhee Hahn ◽

Wonjun Lee ◽

...

Keyword(s):

Keyword Search ◽

Information Leakage ◽

Computation Time ◽

Public Key ◽

Public Key Encryption ◽

Encrypted Data ◽

Performance Improvements ◽

Security Proof ◽

Processing Cost ◽

Definition Of

Public key encryption with keyword search (PEKS) enables users to search over encrypted data outsourced to an untrusted server. Unfortunately, updates to the outsourced data may incur information leakage by exploiting the previously submitted queries. Prior works addressed this issue by means of forward privacy, but most of them suffer from significant performance degradation. In this paper, we present a novel forward private PEKS scheme leveraging Software Guard Extension (SGX), a trusted execution environment provided by Intel. The proposed scheme presents substantial performance improvements over prior work. Specifically, we reduce the query processing cost from O(n) to O(1), where n is the number of encrypted data. According to our performance analysis, the overall computation time is reduced by 80% on average. Lastly, we provide a formal security definition of SGX-based forward private PEKS, as well as a rigorous security proof of the proposed scheme.

Download Full-text

A Secure Data Sharing Scheme with Designated Server

Security and Communication Networks ◽

10.1155/2019/4268731 ◽

2019 ◽

Vol 2019 ◽

pp. 1-16 ◽

Cited By ~ 1

Author(s):

Binrui Zhu ◽

Jiameng Sun ◽

Jing Qin ◽

Jixin Ma

Keyword(s):

Data Sharing ◽

Keyword Search ◽

Public Key ◽

Public Key Encryption ◽

Cloud Platform ◽

Sharing Scheme ◽

Outsourced Data ◽

Secure Data ◽

Encryption Decryption ◽

Designated Server

The cloud-assisted Internet of Things (CIoT) is booming, which utilizes powerful data processing capabilities of the cloud platform to solve massive Internet of Things (IoT) data. However, the CIoT faces new security challenges, such as the confidentiality of the outsourced data. Data encryption is a fundamental technique that can guarantee the confidentiality of outsourced data, but it limits target encrypted data retrieval from cloud platform. Public key encryption with keyword search (PEKS) provides a promising solution to address this problem. In PEKS, a cloud server can be authorized to search the keyword in encrypted documents and retrieve associated encrypted documents for the receiver. However, most existing PEKS schemes merely focus on keyword search function while ignoring the associated documents encryption/decryption function. Thus, in practice, a PEKS scheme must cooperate with another separated public key encryption (PKE) scheme to fulfill a completely secure data sharing scheme. To address this problem, in this paper, we propose a secure data sharing scheme with designated server that combines PKE scheme with PEKS scheme, which provides both keyword search and documents encryption/decryption functions. Furthermore, only the designated server can search the keyword via encrypted documents for enhanced security in our work. Moreover, our scheme also satisfies the public verifiability of search results, which includes both keywords and documents ciphertexts’ correctness and integrity. As to the security, our scheme provides stronger indistinguishability security of document and keyword in the proposed security model.

Download Full-text

A CIPHERTEXT-POLICY ATTRIBUTE-BASED SEARCHABLE ENCRYPTION SCHEME IN NON-INTERACTIVE MODEL

Journal of Computer Science and Cybernetics ◽

10.15625/1813-9663/0/0/13667 ◽

2019 ◽

Vol 35 (3) ◽

pp. 233-249

Author(s):

Van Anh Trinh ◽

Viet Cuong Trinh

Keyword(s):

Keyword Search ◽

Public Key ◽

Communication Overhead ◽

Encryption Scheme ◽

Public Key Encryption ◽

Encrypted Data ◽

Attribute Based Encryption ◽

Encrypt Data ◽

Cryptographic Primitive ◽

Ciphertext Policy

We address the problem of searching on encrypted data with expressive searching predicate and multi-writer/multi-reader, a cryptographic primitive which has many concrete application scenarios such as cloud computing, email gateway application and so on. In this paper, we propose a public-key encryption with keyword search scheme relied on the ciphertext-policy attribute-based encryption scheme. In our system, we consider the model where a user can generate trapdoors by himself/herself, we thus can remove the Trusted Trapdoor Generator which can save the resource and communication overhead. We also investigate the problem of combination of a public key encryption used to encrypt data and a public-key encryption with keyword search used to encrypt keywords, which can save the storage of the whole system

Download Full-text

Efficient Public Key Encryption with Disjunctive Keywords Search Using the New Keywords Conversion Method

Information ◽

10.3390/info9110272 ◽

2018 ◽

Vol 9 (11) ◽

pp. 272 ◽

Cited By ~ 1

Author(s):

Yu Zhang ◽

Yin Li ◽

Yifan Wang

Keyword(s):

Cloud Storage ◽

Keyword Search ◽

Public Key ◽

Inner Product ◽

Encryption Scheme ◽

Public Key Encryption ◽

Encrypted Data ◽

Bilinear Groups ◽

Time And Space Complexity ◽

Selection Of

Public key encryption with disjunctive keyword search (PEDK) is a public key encryption scheme that allows disjunctive keyword search over encrypted data without decryption. This kind of scheme is crucial to cloud storage and has received a lot of attention in recent years. However, the efficiency of the previous scheme is limited due to the selection of a less efficient converting method which is used to change query and index keywords into a vector space model. To address this issue, we design a novel converting approach with better performance, and give two adaptively secure PEDK schemes based on this method. The first one is built on an efficient inner product encryption scheme with less searching time, and the second one is constructed over composite order bilinear groups with higher efficiency on index and trapdoor construction. The theoretical analysis and experiment results verify that our schemes are more efficient in time and space complexity as well as more suitable for the mobile cloud setting compared with the state-of-art schemes.

Download Full-text

Public Key Encryption with Keyword Search in Cloud: A Survey

Entropy ◽

10.3390/e22040421 ◽

2020 ◽

Vol 22 (4) ◽

pp. 421 ◽

Cited By ~ 3

Author(s):

Yunhong Zhou ◽

Na Li ◽

Yanmei Tian ◽

Dezhi An ◽

Licheng Wang

Keyword(s):

Keyword Search ◽

Public Key ◽

Future Research ◽

Public Key Encryption ◽

Encrypted Data ◽

Research Survey ◽

Attribute Based Encryption ◽

Cryptographic Primitive ◽

Potential Applications ◽

Predicate Encryption

With the popularization of cloud computing, many business and individuals prefer to outsource their data to cloud in encrypted form to protect data confidentiality. However, how to search over encrypted data becomes a concern for users. To address this issue, searchable encryption is a novel cryptographic primitive that enables user to search queries over encrypted data stored on an untrusted server while guaranteeing the privacy of the data. Public key encryption with keyword search (PEKS) has received a lot of attention as an important branch. In this paper, we focus on the development of PEKS in cloud by providing a comprehensive research survey. From a technological viewpoint, the existing PEKS schemes can be classified into several variants: PEKS based on public key infrastructure, PEKS based on identity-based encryption, PEKS based on attribute-based encryption, PEKS based on predicate encryption, PEKS based on certificateless encryption, and PEKS supporting proxy re-encryption. Moreover, we propose some potential applications and valuable future research directions in PEKS.

Download Full-text