2011
DOI: 10.1007/978-3-642-25516-8_12
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
15
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(15 citation statements)
references
References 31 publications
0
15
0
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%
“…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%
“…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%
“…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%