Author of the publication

Forward Secure Searchable Encryption Using Key-Based Blocks Chain Technique.

, , , , , , and . ICA3PP (4), volume 11337 of Lecture Notes in Computer Science, page 85-97. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

NewMCOS: Towards a Practical Multi-Cloud Oblivious Storage Scheme., , , , , and . IEEE Trans. Knowl. Data Eng., 32 (4): 714-727 (2020)Lightweight authentication protocol in edge-based smart grid environment., , , , and . EURASIP J. Wirel. Commun. Netw., 2021 (1): 68 (2021)A Mutation Approach of Detecting SQL Injection Vulnerabilities., , , , , , and . ICCCS (2), volume 10603 of Lecture Notes in Computer Science, page 175-188. Springer, (2017)Generalized Format-Preserving Encryption for Character Data., , , , and . CloudComp, volume 197 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 113-122. Springer, (2016)FSSE: Forward secure searchable encryption with keyed-block chains., , , , , and . Inf. Sci., (2019)ShadowFPE: New Encrypted Web Application Solution Based on Shadow DOM., , , , , , , and . Mob. Networks Appl., 26 (4): 1733-1746 (2021)EncodeORE: Reducing Leakage and Preserving Practicality in Order-Revealing Encryption., , , , , , and . IEEE Trans. Dependable Secur. Comput., 19 (3): 1579-1591 (2022)Searchable Symmetric Encryption with Forward Search Privacy., , , , , , and . IEEE Trans. Dependable Secur. Comput., 18 (1): 460-474 (2021)Cetus: an efficient symmetric searchable encryption against file-injection attack with SGX., , , , , , and . Sci. China Inf. Sci., (2021)ThinORAM: Towards Practical Oblivious Data Access in Fog Computing Environment., , , , , , and . IEEE Trans. Serv. Comput., 13 (4): 602-612 (2020)