2018
DOI: 10.1109/access.2018.2861424
|View full text |Cite
|
Sign up to set email alerts
|

Verifiable Public Key Encryption With Keyword Search Based on Homomorphic Encryption in Multi-User Setting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 44 publications
(26 citation statements)
references
References 32 publications
0
26
0
Order By: Relevance
“…Jiang et al [9] constructed a verifiable multi-keyword ranked searchable scheme that the client used the Message Authentication Code (MAC) and binary vector to verify the correctness of the returned results. Wu et al [10] proposed a verifiable public key searchable encryption scheme by using homomorphic encryption in a multi-user environment. Kurosawa et al [11] proposed a dynamic and verifiable searchable encryption scheme in which the data user can update files dynamically and detect malicious behavior of the server.…”
Section: B Related Workmentioning
confidence: 99%
“…Jiang et al [9] constructed a verifiable multi-keyword ranked searchable scheme that the client used the Message Authentication Code (MAC) and binary vector to verify the correctness of the returned results. Wu et al [10] proposed a verifiable public key searchable encryption scheme by using homomorphic encryption in a multi-user environment. Kurosawa et al [11] proposed a dynamic and verifiable searchable encryption scheme in which the data user can update files dynamically and detect malicious behavior of the server.…”
Section: B Related Workmentioning
confidence: 99%
“…The suggested technique allows the server in DGHV Homomorphic encryption to provide an reversed encryption index structure with no involving query trapdoor to efficiency improve the search. [10] In cloud computing, the cipher text policy attribute based encryption (CPABE) analyzes the challenges faced in safe data sharing and developed encryption algorithm for it. Normally, the shared data files must have multilevel hierarchy characteristic, especially in military area.…”
Section: Literature Surveymentioning
confidence: 99%
“…However, PEKS often has much more computation overheads than SSE due to doing paring computations. There are more recent works for improving security [17,18], improving functionality [19,20], and improving performance [21] for the PEKS. Boneh et al showed that PEKS implies IBE [13].…”
Section: Related Work Querying On Encrypted Data Is a Long-termmentioning
confidence: 99%