Ciphertext-Policy Delegatable Hidden Vector Encryption and Its Application to Searchable Encryption in Multi-user Setting

Hattori, Mitsuhiro; Hirano, Tomoyuki; Igarashi, Takashi; Matsuda, Nori; Mori, T.; Sakai, Yusuke; Ohta, Kazuo

doi:10.1007/978-3-642-25516-8_12

Cited by 14 publications

(15 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Performance improvements have been proposed for public-key searchable encryption schemes to make them more practical [5], [6] while most searchable encryption needs to check all encrypted data sequentially because of its strong security (i.e., indistinguishability). Public-key searchable encryption that supports multi-user data sharing and its concrete scheme has been also proposed [18]. However, there is currently no public-key searchable encryption scheme which satisfies both efficient performance and multi-user data sharing.…”

Section: Introductionmentioning

confidence: 99%

Public-key Searchable Encryption with Index Generation for Shared Database

Matsuda

Hirano

Kawai

et al. 2020

Journal of Information Processing

Self Cite

View full text Add to dashboard Cite

Recently, use of cloud computing has expanded to include tasks such as data sharing among multiple enterprises for open innovations and IoT systems for device management, etc. Public-key searchable encryption is particularly useful for cases requiring protection of shared secret data. However, there is no public-key searchable encryption scheme that simultaneously achieves: (A) efficient search performance, (B) multiuser support and (C) implementation on database management systems, simultaneously. In this paper, we propose a new public-key searchable encryption scheme which (A) provides an index generation mechanism for public-key searchable encryption, and (B) generates different secret keys for multiple users. In our scheme, (A) is achieved by a portion of the deterministic values generated from a keyword, and (B) is achieved by hierarchical inner-product predicate encryption. Our scheme in particular, forms wildcards as the user identity from hierarchical inner-product predicate encryption in order to easily represent hierarchical identities. To achieve (C), we further propose an integration method which implements our scheme into database management systems through a user-defined function so that its search functionality can be easily used via SQL.

show abstract

Section: Introductionmentioning

confidence: 99%

Public-key Searchable Encryption with Index Generation for Shared Database

Matsuda

Hirano

Kawai

et al. 2020

Journal of Information Processing

Self Cite

View full text Add to dashboard Cite

show abstract

“…With the growing quantity of encrypted data, it is necessary to provide search service by the cloud providers. Fortunately, a solution called searchable encryption (SE) [1][2][3][4][5][6] has been proposed for several years, which provides keyword search without revealing the plaintexts.…”

Section: Introductionmentioning

confidence: 99%

“…Employees in the same department or division usually need to share confidential documents. The existing multiuser SE schemes are either inefficient [5] or not dynamically scalable [4,7,8] because the company or manager needs to manage a set of secret keys.…”

Section: Introductionmentioning

confidence: 99%

A ciphertext‐policy hidden vector encryption scheme supporting multiuser keyword search

Liao

Wang

Liu

2014

Security Comm Networks

View full text Add to dashboard Cite

In cloud computing, large amount of data can be effectively stored and managed. People could outsource the encrypted data using searchable encryption (SE) for data security and efficient retrieval. However, most existing SE schemes only support the single‐user access, and multiuser searchable encryption is required in many enterprise applications. From the attribute‐based encryption (ABE), we found that the flexibility and usability of encryption schemes can be greatly improved by embedding attribute‐based access policy in the ciphertext. In this paper, by using the idea of ABE, we propose a ciphertext‐policy hidden vector encryption (CPHVE) scheme to support both encryption and search operations for multiple users. In the scheme, a keyword is encrypted with an attribute‐based access policy, which can be searched when the users' attributes satisfy the policy. The security of CPHVE is also defined and proved in this paper. Moreover, the CPHVE scheme is based on standard complexity assumptions on bilinear groups of prime order, thus it is more efficient than the existing schemes. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

“…As a special type of functional encryption, Hidden Vector Encryption (HVE) schemes [5,6,8,9] allow wildcards to appear in either the encryption attribute vector associated with a ciphertext or the decryption attribute vector associated with a user secret key. Similar to ABE schemes, we name the former Ciphertext Policy (CP-) HVE schemes and the latter Key Policy (KP-) HVE schemes.…”

Section: Introductionmentioning

confidence: 99%

“…In [8], Sedghi et al proposed an HVE scheme that has constant decryption key size and short (but still not constant-size) ciphertext. In [9], Hattori et al introduced a formal definition for CP-HVE and proposed a CP-HVE scheme based on the anonymous HIBE proposed in [24] and the wildcarded IBE proposed in [16]. Hattori et al's CP-HVE scheme also has a linear cipertext size.…”

Section: Introductionmentioning

confidence: 99%

Efficient Hidden Vector Encryption with Constant-Size Ciphertext

Phuong

Yang

Susilo

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A Hidden Vector Encryption (HVE) scheme is a special type of anonymous identity-based encryption (IBE) scheme where the attribute string associated with the ciphertext or the user secret key can contain wildcards. In this paper, we introduce two constant-size ciphertext-policy hidden vector encryption (CP-HVE) schemes. Our first scheme is constructed on composite order bilinear groups, while the second one is built on prime order bilinear groups. Both schemes are proven secure in a selective security model which captures plaintext (or payload) and attribute hiding. To the best of our knowledge, our schemes are the first HVE constructions that can achieve constant-size ciphertext among all the existing HVE schemes. 2014 Springer International Publishing Switzerland.Abstract. A Hidden Vector Encryption (HVE) scheme is a special type of anonymous identity-based encryption (IBE) scheme where the attribute string associated with the ciphertext or the user secret key can contain wildcards. In this paper, we introduce two constant-size ciphertextpolicy hidden vector encryption (CP-HVE) schemes. Our first scheme is constructed on composite order bilinear groups, while the second one is built on prime order bilinear groups. Both schemes are proven secure in a selective security model which captures plaintext (or payload) and attribute hiding. To the best of our knowledge, our schemes are the first HVE constructions that can achieve constant-size ciphertext among all the existing HVE schemes.

show abstract

Ciphertext-Policy Delegatable Hidden Vector Encryption and Its Application to Searchable Encryption in Multi-user Setting

Cited by 14 publications

References 31 publications

Public-key Searchable Encryption with Index Generation for Shared Database

Public-key Searchable Encryption with Index Generation for Shared Database

A ciphertext‐policy hidden vector encryption scheme supporting multiuser keyword search

Efficient Hidden Vector Encryption with Constant-Size Ciphertext

Contact Info

Product

Resources

About