{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T00:13:37Z","timestamp":1780618417207,"version":"3.54.1"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T00:00:00Z","timestamp":1745366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61862041"],"award-info":[{"award-number":["61862041"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science and Technology program of Gansu Province of China","award":["21JR7RA120"],"award-info":[{"award-number":["21JR7RA120"]}]},{"name":"Young Doctor Fund Project of Gansu Provincial Department of Education","award":["2022QB-033"],"award-info":[{"award-number":["2022QB-033"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Asian Low-Resour. Lang. Inf. Process."],"published-print":{"date-parts":[[2025,5,31]]},"abstract":"<jats:p>\n            With the continuous growth of dimensions in retrieval systems, only a few data points are distributed near the center (empty space phenomenon), and the distance between data points in high-dimensional space is nearly equal (dimensional effect), resulting in high complexity and low accuracy in retrieval. Aiming at the preceding problems, this article designs a speech secure hash retrieval scheme. In this scheme, the spectral subband centroids of speech are extracted to generate the feature vector, then the biometric template index is established by KDTree classification, and the specific SHA256-Ushiki chaotic encryption algorithm key is allocated to each index. The security framework is constructed according to the cancelable biometric template generated by the combination of classification and distribution key, and the binary hash vector is generated, then the hash vector is encrypted. Experimental results show that through the establishment of the KDTree cancelable biometric template index, the super rectangular region of the\n            <jats:italic>K<\/jats:italic>\n            -dimensional space is constructed, which effectively solves the empty space phenomenon and the dimensional effect. Through the KDTree nearest neighbor search, the algorithm reduces the number of matches between classes, which effectively reduces computational complexity and accuracy problems. The tampering comparison of mobile terminal realizes the content verifiable retrieval. The speech encryption effectively prevents the leakage of plaintext and ensures security of the speech storage and transmission process.\n          <\/jats:p>","DOI":"10.1145\/3723161","type":"journal-article","created":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T09:36:06Z","timestamp":1742117766000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Low Complexity Speech Secure Hash Retrieval Algorithm Based on KDTree Nearest Neighbor Search"],"prefix":"10.1145","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1667-3114","authenticated-orcid":false,"given":"Yibo","family":"Huang","sequence":"first","affiliation":[{"name":"College of Physics and Electronic Engineering, Northwest Normal University, Lanzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6772-8085","authenticated-orcid":false,"given":"Li","family":"An","sequence":"additional","affiliation":[{"name":"College of Physics and Electronic Engineering, Northwest Normal University, Lanzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1488-388X","authenticated-orcid":false,"given":"Qiuyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer and Communication, Lanzhou University of Technology, Lanzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,4,23]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2023.102144"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.05.001"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108074"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.09.012"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-021-01033-z"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1108\/DTA-06-2022-0247"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108356"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2017.10.003"},{"key":"e_1_3_1_10_2","first-page":"26","article-title":"The RLR-Tree: A reinforcement learning based R-tree for spatial data","volume":"1","author":"Gu Tu","year":"2023","unstructured":"Tu Gu, Kaiyu Feng, Gao Cong, Cheng Long, Zheng Wang, and Sheng Wang. 2023. The RLR-Tree: A reinforcement learning based R-tree for spatial data. Proceedings of the ACM on Management of Data 1, 1 (May 2023), Article 63, 26 pages.","journal-title":"Proceedings of the ACM on Management of Data"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/LGRS.2023.3330854"},{"key":"e_1_3_1_12_2","first-page":"2839","volume-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition","author":"He Xiangyu","year":"2019","unstructured":"Xiangyu He, Peisong Wang, and Jian Cheng. 2019. K-nearest neighbors hashing. In Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition. 2839\u20132848."},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3392763"},{"issue":"12","key":"e_1_3_1_14_2","first-page":"32","article-title":"Biohashing encrypted speech retrieval based on chaotic measurement matrix","volume":"48","author":"Huang Yi-Bo","year":"2020","unstructured":"Yi-Bo Huang, Yong Wang, Qiu-Yu Zhang, and Teng-Fei Chen. 2020. Biohashing encrypted speech retrieval based on chaotic measurement matrix. Journal of Huazhong University of Science and Technology (Natural Science Edition) 48, 12 (2020), 32\u201337.","journal-title":"Journal of Huazhong University of Science and Technology (Natural Science Edition)"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3364092"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.11.018"},{"key":"e_1_3_1_17_2","doi-asserted-by":"crossref","unstructured":"Vinicius Sato Kawai Lucas Pascotti Valem Alexandro Baldassin Edson Borin Daniel Carlos Guimar\u00e3es Pedronette and Longin Jan Latecki. 2024. Rank-based hashing for effective and efficient nearest neighbor search for image retrieval. 20 10 (September 2024) Article 329 19 pages.","DOI":"10.1145\/3659580"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121452"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2020.3003219"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2024.3374791"},{"key":"e_1_3_1_21_2","first-page":"11831","article-title":"Mutually improved dense retriever and GNN-based reader for arbitrary-hop open-domain question answering","author":"Li Ronghan","year":"2022","unstructured":"Ronghan Li, Lifang Wang, Zejun Jiang, Zhongtian Hu, Meng Zhao, and Xinyu Lu. 2022. Mutually improved dense retriever and GNN-based reader for arbitrary-hop open-domain question answering. Neural Computing and Applications 34 (2022), 11831\u201311851.","journal-title":"Neural Computing and Applications"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2024.02.005"},{"key":"e_1_3_1_23_2","first-page":"23","article-title":"HARR: Learning discriminative and high-quality hash codes for image retrieval","volume":"20","author":"Ma Zeyu","year":"2024","unstructured":"Zeyu Ma, Siwei Wang, Xiao Luo, Zhonghui Gu, Chong Chen, Jinxing Li, Xian-Sheng Hua, and Guangming Lu. 2024. HARR: Learning discriminative and high-quality hash codes for image retrieval. ACM Transactions on Multimedia Computing, Communications, and Applications 20, 5 (Jan. 2024), Article 134, 23 pages.","journal-title":"ACM Transactions on Multimedia Computing, Communications, and Applications"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASLP.2024.3393772"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2023.3289765"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.09.055"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2024.3372876"},{"key":"e_1_3_1_28_2","first-page":"70497","volume-title":"Advances in Neural Information Processing Systems","author":"Wang Feng","year":"2023","unstructured":"Feng Wang, Zilong Chen, Guokang Wang, Yafei Song, and Huaping Liu. 2023. Masked space-time hash encoding for efficient dynamic scene reconstruction. In Advances in Neural Information Processing Systems, A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine (Eds.), Vol. 36. Curran Associates Inc., 70497\u201370510."},{"key":"e_1_3_1_29_2","article-title":"An enhanced KD-tree-based ray tube subdivision SBR for fast RCS prediction","author":"Wang Hao","year":"2024","unstructured":"Hao Wang, Bing Wei, and Hong Wei Liu. 2024. An enhanced KD-tree-based ray tube subdivision SBR for fast RCS prediction. IEEE Antennas and Wireless Propagation Letters. Preprint.","journal-title":"IEEE Antennas and Wireless Propagation Letters."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3350909"},{"key":"e_1_3_1_31_2","first-page":"16357","volume-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition","author":"Wang Xunguang","year":"2021","unstructured":"Xunguang Wang, Zheng Zhang, Baoyuan Wu, Fumin Shen, and Guangming Lu. 2021. Prototype-supervised adversarial network for targeted attack of deep hashing. In Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition. 16357\u201316366."},{"issue":"15","key":"e_1_3_1_32_2","first-page":"1","article-title":"Geological tetrahedral model-oriented hybrid spatial indexing structure based on Octree and 3D R*-tree","volume":"13","author":"Wang Yongzhi","year":"2020","unstructured":"Yongzhi Wang, Hua Lv, and Yuqing Ma. 2020. Geological tetrahedral model-oriented hybrid spatial indexing structure based on Octree and 3D R*-tree. Arabian Journal of Geosciences 13, 15 (2020), 1\u201311.","journal-title":"Arabian Journal of Geosciences"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2024.3422974"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2024.3374070"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.111336"},{"issue":"9","key":"e_1_3_1_36_2","doi-asserted-by":"crossref","first-page":"6337","DOI":"10.1007\/s11042-019-08450-y","article-title":"An encrypted speech retrieval algorithm based on Chirp-Z transform and perceptual hashing second feature extraction","volume":"79","author":"Zhang Qiu-Yu","year":"2020","unstructured":"Qiu-Yu Zhang, Zi-Xian Ge, Ying-Jie Hu, Jian Bai, and Yi-Bo Huang. 2020. An encrypted speech retrieval algorithm based on Chirp-Z transform and perceptual hashing second feature extraction. Multimedia Tools and Applications 79, 9 (2020), 6337\u20136361.","journal-title":"Multimedia Tools and Applications"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122052"}],"container-title":["ACM Transactions on Asian and Low-Resource Language Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3723161","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3723161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:56:42Z","timestamp":1750298202000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3723161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,23]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,5,31]]}},"alternative-id":["10.1145\/3723161"],"URL":"https:\/\/doi.org\/10.1145\/3723161","relation":{},"ISSN":["2375-4699","2375-4702"],"issn-type":[{"value":"2375-4699","type":"print"},{"value":"2375-4702","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,23]]},"assertion":[{"value":"2023-11-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}