Locality Improvement Scheme Based on QR Code Technique within Inverted Index

Aya Abdulhussein Alyousif, Ali Adil Yassin


Searchable symmetric encryption is one of the most important modern technologies that allow the owner to store private data on an unreliable server and search for the data securely while preserving the data’s confidentiality and privacy. This field has several schemes, but these schemes suffered from slower data retrieval in the case of large database sizes owing to the poor locality. Hence, the server visits several memory locations for a single query. Other studies focused on improving the locality, but the result is either increased storage capacity or decreased efficiency of data reading. In the present study, we present a secure, searchable scheme that overcomes the abovementioned issues and works to improve the locality by exploiting the QR code technique and the Advanced Encryption Standard algorithm. Furthermore, our work maintains read efficiency, helps reduce the risk of data breaches, and protects sensitive information from being accessed by unauthorized individuals. Moreover, the proposed scheme can resist cyber security attacks, such as frequency analysis attacks and keyword guessing attacks. Additionally, we used real-world data in our experiments and demonstrated that our proposed scheme is secure and practically efficient and holds high accuracy.

Full Text:



G. Sen Poh, J.-J. Chin, W.-C. Yau, K.-K. R. Choo, and M. S. Mohamad, “Searchable symmetric encryption: designs and challenges,” ACM Comput. Surv., vol. 50, no. 3, pp. 1–37, 2017.

G. Asharov, M. Naor, G. Segev, and I. Shahaf, “Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations,” in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2016, pp. 1101–1114.

E. Damiani, S. D. C. Di Vimercati, S. Foresti, S. Jajodia, S. Paraboschi, and P. Samarati, “Key management for multi-user encrypted databases,” in Proceedings of the 2005 ACM workshop on Storage security and survivability, 2005, pp. 74–83.

D. Cash and S. Tessaro, “The locality of searchable symmetric encryption,” in Annual international conference on the theory and applications of cryptographic techniques, 2014, pp. 351–368.

I. Demertzis and C. Papamanthou, “Fast searchable encryption with tunable locality,” in Proceedings of the 2017 ACM International Conference on Management of Data, 2017, pp. 1053–1067.

G. Asharov, G. Segev, and I. Shahaf, “Tight tradeoffs in searchable symmetric encryption,” J. Cryptol., vol. 34, no. 2, pp. 1–37, 2021.

D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Proceeding 2000 IEEE symposium on security and privacy. S&P 2000, 2000, pp. 44–55.

D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M.-C. Roşu, and M. Steiner, “Highly-scalable searchable symmetric encryption with support for boolean queries,” in Annual cryptology conference, 2013, pp. 353–373.

S. Kamara, C. Papamanthou, and T. Roeder, “Dynamic searchable symmetric encryption,” in Proceedings of the 2012 ACM conference on Computer and communications security, 2012, pp. 965–976.

M. Chase and S. Kamara, “Structured encryption and controlled disclosure,” in International conference on the theory and application of cryptology and information security, 2010, pp. 577–594.

P. Van Liesdonk, S. Sedghi, J. Doumen, P. Hartel, and W. Jonker, “Computationally efficient searchable symmetric encryption,” in Workshop on Secure Data Management, 2010, pp. 87–100.

K. Kurosawa and Y. Ohtaki, “How to update documents verifiably in searchable symmetric encryption,” in c, 2013, pp. 309–328.

S. Kamara and C. Papamanthou, “Parallel and dynamic searchable symmetric encryption,” in International conference on financial cryptography and data security, 2013, pp. 258–274.

S. Singh, “QR code analysis,” Int. J. Adv. Res. Comput. Sci. Softw. Eng., vol. 6, no. 5, 2016.

A. S. Narayanan, “QR codes and security solutions,” Int. J. Comput. Sci. Telecommun., vol. 3, no. 7, pp. 69–72, 2012.

A. M. Abdullah, “Advanced encryption standard (AES) algorithm to encrypt and decrypt data,” Cryptogr. Netw. Secur., vol. 16, pp. 1–11, 2017.

J. Katz and Y. Lindell, Introduction to modern cryptography. CRC press, 2020.

D. V. N. Siva Kumar and P. Santhi Thilagam, “Searchable encryption approaches: attacks and challenges,” Knowl. Inf. Syst., vol. 61, no. 3, pp. 1179–1207, 2019.

D. Cash, P. Grubbs, J. Perry, and T. Ristenpart, “Leakage-abuse attacks against searchable encryption,” in Proceedings of the 22nd ACM SIGSAC conference on computer and communications security, 2015, pp. 668–679.

Y. Miao, Q. Tong, R. H. Deng, K.-K. R. Choo, X. Liu, and H. Li, “Verifiable searchable encryption framework against insider keyword-guessing attack in cloud storage,” IEEE Trans. Cloud Comput., vol. 10, no. 2, pp. 835–848, 2020.

S. Gangan, “A review of man-in-the-middle attacks,” arXiv Prepr. arXiv1504.02115, 2015.

D. Cash et al., “Dynamic searchable encryption in very-large databases: Data structures and implementation,” Cryptol. ePrint Arch., 2014.

R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,” in Proceedings of the 13th ACM conference on Computer and communications security, 2006, pp. 79–88.

DOI: https://doi.org/10.31449/inf.v47i7.4745

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.