Open Access iconOpen Access

ARTICLE

crossmark

An Efficient Encrypted Speech Retrieval Based on Unsupervised Hashing and B+ Tree Dynamic Index

Qiu-yu Zhang*, Yu-gui Jia, Fang-Peng Li, Le-Tian Fan

School of Computer and Communication, Lanzhou University of Technology, Lanzhou, 730050, China

* Corresponding Author: Qiu-yu Zhang. Email: email

(This article belongs to the Special Issue: Recent Advances on Security and Privacy of Multimedia Big Data in the Social Internet of Things)

Computers, Materials & Continua 2023, 76(1), 107-128. https://doi.org/10.32604/cmc.2023.038911

Abstract

Existing speech retrieval systems are frequently confronted with expanding volumes of speech data. The dynamic updating strategy applied to construct the index can timely process to add or remove unnecessary speech data to meet users’ real-time retrieval requirements. This study proposes an efficient method for retrieving encryption speech, using unsupervised deep hashing and B+ tree dynamic index, which avoid privacy leakage of speech data and enhance the accuracy and efficiency of retrieval. The cloud’s encryption speech library is constructed by using the multi-threaded Dijk-Gentry-Halevi-Vaikuntanathan (DGHV) Fully Homomorphic Encryption (FHE) technique, which encrypts the original speech. In addition, this research employs Residual Neural Network18-Gated Recurrent Unit (ResNet18-GRU), which is used to learn the compact binary hash codes, store binary hash codes in the designed B+ tree index table, and create a mapping relation of one to one between the binary hash codes and the corresponding encrypted speech. External B+ tree index technology is applied to achieve dynamic index updating of the B+ tree index table, thereby satisfying users’ needs for real-time retrieval. The experimental results on THCHS-30 and TIMIT showed that the retrieval accuracy of the proposed method is more than 95.84% compared to the existing unsupervised hashing methods. The retrieval efficiency is greatly improved. Compared to the method of using hash index tables, and the speech data’s security is effectively guaranteed.

Keywords


Cite This Article

APA Style
Zhang, Q., Jia, Y., Li, F., Fan, L. (2023). An efficient encrypted speech retrieval based on unsupervised hashing and B+ tree dynamic index. Computers, Materials & Continua, 76(1), 107-128. https://doi.org/10.32604/cmc.2023.038911
Vancouver Style
Zhang Q, Jia Y, Li F, Fan L. An efficient encrypted speech retrieval based on unsupervised hashing and B+ tree dynamic index. Comput Mater Contin. 2023;76(1):107-128 https://doi.org/10.32604/cmc.2023.038911
IEEE Style
Q. Zhang, Y. Jia, F. Li, and L. Fan "An Efficient Encrypted Speech Retrieval Based on Unsupervised Hashing and B+ Tree Dynamic Index," Comput. Mater. Contin., vol. 76, no. 1, pp. 107-128. 2023. https://doi.org/10.32604/cmc.2023.038911



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 720

    View

  • 397

    Download

  • 1

    Like

Share Link