2021
DOI: 10.1007/s11042-021-10844-w
|View full text |Cite
|
Sign up to set email alerts
|

Efficient and dynamic verifiable multi-keyword searchable symmetric encryption with full security

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
26
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(26 citation statements)
references
References 37 publications
0
26
0
Order By: Relevance
“…According to the results, the VDB method has attained the requisite security features with excellent efficiency.Liu et al [9] bestowed an SPKS (safe and privacypreserving keyword search) decryption technique that decreases computational and communication overhead for consumers while maintaining user data and querying privacy. The result showed that the SPKS was more felicitous to a cloudenvirons.Najafi et al [10] obtainedtherFSMSE increased the complexity of time complexity, memory, and communication by allowing searching multiple terms, which was more secure and search time complexity. The result demonstrates that the rFSMSE required less time to search many keywords than the existing randomized symmetric searchable encryption (SSE).Pandiaraja et al [11] presented the apriori technique is based on secure inner product computation, which decreases the time it takes to access data in the cloud.…”
Section: Literature Surveymentioning
confidence: 99%
“…According to the results, the VDB method has attained the requisite security features with excellent efficiency.Liu et al [9] bestowed an SPKS (safe and privacypreserving keyword search) decryption technique that decreases computational and communication overhead for consumers while maintaining user data and querying privacy. The result showed that the SPKS was more felicitous to a cloudenvirons.Najafi et al [10] obtainedtherFSMSE increased the complexity of time complexity, memory, and communication by allowing searching multiple terms, which was more secure and search time complexity. The result demonstrates that the rFSMSE required less time to search many keywords than the existing randomized symmetric searchable encryption (SSE).Pandiaraja et al [11] presented the apriori technique is based on secure inner product computation, which decreases the time it takes to access data in the cloud.…”
Section: Literature Surveymentioning
confidence: 99%
“…Multi-ciphertext indistinguishability: Qin et al [11] are the first to suggest MCI. Traditionally, Ciphertext indistinguishability (CI) is a security feature that prevents attackers from extracting any valuable information from ciphertext.…”
Section: Multi-ciphertext Indistinguishability and Multi-trapdoor Pri...mentioning
confidence: 99%
“…Multi-trapdoor privacy: MTP was also originally proposed by Qin et al [11]. Traditionally, trapdoor privacy (TP) aims to prevent attackers from obtaining any valid information related to keywords from trapdoors and internal attacks.…”
Section: Multi-ciphertext Indistinguishability and Multi-trapdoor Pri...mentioning
confidence: 99%
See 1 more Smart Citation
“…When accessing cloud data, some sensitive data needs to be secured, and cryptography can play a large role in this. is discipline can provide more complete security for sensitive data and is currently the more critical technology in cloud storage security issues and is an important cornerstone for cloud storage to be used by many enterprises [2]. In cloud storage, data les are mainly stored in cloud servers, and data owners cannot always supervise access to data.…”
Section: Introductionmentioning
confidence: 99%