{"corpus_id":182525725,"paper_sha":"7c9cb8996ae358a6eb21d5c334ead83498e879c7","doi":"10.3906/ELK-1808-161","arxiv_id":null,"pmid":null,"pmcid":null,"mag_id":2945231950,"dblp_id":"journals/elektrik/ZhangGZZ19","acl_id":null,"title":"An efficient retrieval algorithm of encrypted speech based on inverse fast Fouriertransform and measurement matrix","year":2019,"publication_date":"2019-05-15","venue":"Turkish J. Electr. Eng. Comput. Sci.","journal":{"name":"Turkish J. Electr. Eng. Comput. Sci.","pages":"1719-1736","volume":"27"},"journal_issn":null,"journal_title":null,"publication_types":["JournalArticle"],"pubmed_pub_types":null,"s2_fields_of_study":["Computer Science"],"reference_count":31,"citation_count":7,"influential_citation_count":2,"is_open_access":false,"arxiv_categories":null,"arxiv_license":null,"arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":null,"s2_open_access_landing_url":null,"s2_open_access_license":null,"s2_open_access_status":null,"pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"In this paper, we present an efficient retrieval algorithm for encrypted speech based on an inverse fast Fourier transform and measurement matrix. Our approach improves query performance, as well as retrieval efficiency and accuracy, compared to existing content-based encrypted speech retrieval methods. Our proposed algorithm constructs a perceptual hash scheme using perceptual hash sequences from original speech files. By classifying the sequences and applying run-length compression, we decrease the cloud storage required for the hash index. We secure the speech database by encrypting it with Henon chaos scrambling, which offers excellent resistance to attacks. Experimental results show that the robustness, discrimination, and feature extraction efficiency of our proposed method are better than the existing alternatives, with good recall and precision ratios and with high retrieval efficiency and accuracy.","claims":[{"public_id":"cl_a15bc48a7aa429251e7286067e4406a0","status":"active","text":"An efficient retrieval algorithm for encrypted speech based on the inverse fast Fourier transform and measurement matrix improves query performance, retrieval efficiency, and accuracy compared to existing content-based encrypted speech retrieval methods.","confidence":0.88,"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/claims/cl_a15bc48a7aa429251e7286067e4406a0"},{"public_id":"cl_1aad603921ae9648a5522743a6093957","status":"active","text":"Classifying perceptual hash sequences and applying run-length compression decreases the cloud storage required for the hash index.","confidence":0.85,"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/claims/cl_1aad603921ae9648a5522743a6093957"},{"public_id":"cl_391225c5946f21c934e1b08de65d604c","status":"active","text":"Encrypting the speech database with Henon chaos scrambling provides strong resistance to attacks.","confidence":0.85,"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/claims/cl_391225c5946f21c934e1b08de65d604c"},{"public_id":"cl_0255ae073362403046c2308d9fc79733","status":"active","text":"The proposed encrypted speech retrieval algorithm achieves better robustness, discrimination, and feature extraction efficiency than existing alternatives, with good recall and precision ratios and high retrieval efficiency and accuracy.","confidence":0.85,"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/claims/cl_0255ae073362403046c2308d9fc79733"}],"concepts":[{"public_id":"co_1cb9c8319d0bde2a74d90bbe20951fbe","status":"active","name":"speech database","description":"The database of speech files that is encrypted for secure storage and retrieval.","types":["resource","dataset"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/concepts/co_1cb9c8319d0bde2a74d90bbe20951fbe"},{"public_id":"co_1dc972b2fa92e14edce7df1b902a7da7","status":"active","name":"recall and precision ratios","description":"Performance metrics used to evaluate the retrieval quality of the proposed method.","types":["metric"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/concepts/co_1dc972b2fa92e14edce7df1b902a7da7"},{"public_id":"co_2f3d90038c16417b612c69086a7366df","status":"active","name":"run-length compression","description":"A compression technique applied to classified perceptual hash sequences to reduce storage requirements.","types":["method"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/concepts/co_2f3d90038c16417b612c69086a7366df"},{"public_id":"co_30673f561bf795d96d05cecb8105c8d7","status":"active","name":"measurement matrix","description":"A matrix component used together with the IFFT in building the retrieval algorithm.","types":["method","technique"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/concepts/co_30673f561bf795d96d05cecb8105c8d7"},{"public_id":"co_3f984a89aae4a064c250f0464a55ed0a","status":"active","name":"Henon chaos scrambling","description":"A chaos-based encryption technique used to secure the speech database against attacks.","types":["method","technique"],"aliases":["Henon chaotic scrambling"],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/concepts/co_3f984a89aae4a064c250f0464a55ed0a"},{"public_id":"co_4296db5127a8d83497c2cbb90ea86a0b","status":"active","name":"encrypted speech retrieval algorithm","description":"The proposed method for retrieving encrypted speech files efficiently based on IFFT and a measurement matrix.","types":["method"],"aliases":["retrieval algorithm of encrypted speech"],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/concepts/co_4296db5127a8d83497c2cbb90ea86a0b"},{"public_id":"co_5b4ae75f3de91bcee3e346a4be473899","status":"active","name":"perceptual hash sequences","description":"Hash sequences extracted from original speech files used to build the perceptual hash scheme.","types":["data","feature representation"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/concepts/co_5b4ae75f3de91bcee3e346a4be473899"},{"public_id":"co_6e6532e462abac3a62eb150dc2fb193d","status":"active","name":"content-based encrypted speech retrieval","description":"The general field of existing methods for retrieving encrypted speech based on content, used as a comparison baseline.","types":["method","field"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/concepts/co_6e6532e462abac3a62eb150dc2fb193d"},{"public_id":"co_997260d46b7a56a0469fd6ae0bdec71c","status":"active","name":"perceptual hash scheme","description":"A hashing scheme constructed from perceptual hash sequences derived from original speech files.","types":["method"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/concepts/co_997260d46b7a56a0469fd6ae0bdec71c"},{"public_id":"co_c0899aa0d8feb363bd9c0f4947f937e9","status":"active","name":"hash index","description":"The index built from perceptual hash sequences that is stored in the cloud and whose storage size is reduced by compression.","types":["resource","data structure"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/concepts/co_c0899aa0d8feb363bd9c0f4947f937e9"},{"public_id":"co_ffa20899f7cba5200d9eb6c635bb8dc0","status":"active","name":"inverse fast Fourier transform","description":"A signal transform used in constructing the proposed retrieval algorithm.","types":["method"],"aliases":["IFFT"],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["review"],"url":"https://sah.borca.ai/u/b9tnx83g25"}],"url":"https://sah.borca.ai/concepts/co_ffa20899f7cba5200d9eb6c635bb8dc0"}],"external_ids":{"DOI":"10.3906/ELK-1808-161","ArXiv":null,"PubMed":null,"PubMedCentral":null,"MAG":2945231950,"DBLP":"journals/elektrik/ZhangGZZ19","ACL":null},"open_access":{"is_open_access":false,"pdf_url":null,"landing_url":"https://sah.borca.ai/papers/182525725","source":null,"pdf_url_source":null,"license":null,"reason":"pdf_url_not_indexed"},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":false,"full_text_source":null,"count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":638363,"paper_uid":"7ea7d80b-9a4e-4644-aa0e-1069d75364f2","canonical_identity":{"paper_id":638363,"paper_uid":"7ea7d80b-9a4e-4644-aa0e-1069d75364f2","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/182525725"}