An improved asymmetric searchable encryption scheme

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Data to be uploaded on the cloud storage system will often be encrypted for security reasons. No classic encryption & decryption algorithms however provide any search function. To increase user efficiency, an asymmetric searchable encryption scheme is designed in this paper. This improved scheme aims at fixing such flaws as “trapdoors that can be generated by anyone”, “ciphertexts that are tampered with at discretion”, “key pairs generated by users”, “identities encrypted” and “a useless component”. Findings suggest that the proposed scheme, while maintaining the established framework, perfectly resolves all the aforementioned flaws in the previous scheme.

Cite

CITATION STYLE

APA

Wu, Q. (2016). An improved asymmetric searchable encryption scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10066 LNCS, pp. 39–44). Springer Verlag. https://doi.org/10.1007/978-3-319-49148-6_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free