# Encrypted Speech Retrieval Scheme Based on Multiuser Searchable Encryption in Cloud Storage

Authors: Qiuyu Zhang; Minrui Fu; Yibo Huang; Zhenyu Zhao
Journal: Security and Communication Networks
 (2022)

---

## Abstract

In order to solve the problem of multiuser security sharing and privacy protection of the speech data in cloud storage and realize efficient encrypted speech retrieval, an encrypted speech retrieval scheme based on multiuser searchable encryption was proposed. Firstly, the ciphertext-policy attribute-based encryption (CP-ABE) and searchable encryption (SE) are combined to support a multiuser searchable speech encryption scheme, which achieves the encryption and fine-grained access control of the speech data. Secondly, the Mel frequency cepstral coefficient (MFCC) feature of the original speech that is used as the input of the long- and short-term memory network (LSTM) is extracted to perform the deep semantic feature extraction as the speech keywords. Finally, the speech keywords are encrypted to generate a secure index, bound together with the encrypted speech, and then stored in the cloud. During the user retrieving, the keywords of query speech are extracted by utilizing the trained LSTM to generate the search trapdoor of the user and then uploaded to the cloud server, and the Euclidean distance is used for matching the security index with the search trapdoor. In addition, a proxy server is introduced to execute the partial ciphertext decryption operations to reduce computation overhead and storage space. The theoretical analysis and experimental results show that the proposed scheme has higher security and retrieval accuracy and can realize the secure storage of the massive speech data and multiuser data sharing.


---

## Body

## 1. Introduction

In recent years, cloud storage has become a popular storage solution, more and more enterprises and individuals tend to outsource data to the cloud to save local storage and computing costs, and users can also share their files on the cloud. However, the cloud service providers (CSPs) are not completely trusted. While the popularity and application of cloud storage bring convenience to users, they also bring challenges of security and privacy issues. Once data is stored in the cloud, users will lose their direct control over the data, which could cause sensitive information to leak, especially sensitive speech data [1, 2]. In order to ensure the privacy and confidentiality of the data, users usually encrypt the data and then store it on the cloud server in the form of ciphertext. But the encrypted speech data often loses most of its features, which reduces the searchability in massive ciphertext data and increases the difficulty of retrieving data for users [3, 4].Speech is an important information carrier in audio; as the most direct and convenient multimedia application to convey information, it contains critical and sensitive confidential contents in some specific environments, such as meetings, court evidence, military instructions, and communication recordings. These pieces of sensitive information involving state and enterprise secrets and personal privacy also need to be uploaded to the cloud for remote processing, such as speech retrieval, recognition, and authentication, utilizing the powerful and convenient data storage, and processing and sharing services of cloud computing. Aiming at the issue of the ciphertext retrieval in cloud storage, the searchable encryption (SE) technique is proposed, which is an effective method to solve retrieval of the massive ciphertext in cloud storage [5]. However, most of the existing SE schemes mainly resolve the problem of encrypted text retrieval in cloud storage and are not suitable for speech data with perceptual redundancy properties; meanwhile, the scheme of applying to multimedia speech data is less and mostly is implemented in a single-user environment, which is unable to satisfy the requirements in multiuser scenarios that users share and search the files in the remote cloud storage server. With the popularity of the conception of cloud storage and sharing, users and data have witnessed a surge of growing, and data sharing is becoming more and more important. Therefore, how to retrieve encrypted speech data efficiently with privacy-preserving for multiple users in cloud storage has become an urgent issue to be settled.The existing works for content-based encrypted speech retrieval schemes do not consider that legitimate users can access and retrieve encrypted data safely under the control of the data owner, and it is difficult to meet the retrieval requirements in multiuser scenarios. Moreover, the CP-ABE scheme can achieve data security in the cloud and fine-grained access control to effectively prevent unauthorized access. It has become a vital access control technology for secure data sharing and multiuser searchable encryption in cloud storage.In the existing SE schemes, there are fewer approaches for extracting keywords from the speech that needs to be stored in the cloud server. In addition, the existing SE technology is implemented by matching keywords and is not suitable for encrypted speech data with perceptual redundancy characteristics. Thanks are due to the deep learning technique that has been widely used in image recognition/retrieval [6–8], speaker recognition [9], speech recognition/retrieval, and other fields [10–13] with its powerful automatic feature learning ability and efficient feature description. This paper exploits the LSTM network model for speech deep feature extraction and recognition and uses the output as speech keyword, which not only achieves the purpose of extracting speech keywords but also has high retrieval accuracy.The above researches are analyzed in order to ensure the safe sharing and privacy protection of the speech data in the cloud by multiple users and realize efficient multiuser encrypted speech retrieval. The CP-ABE scheme is adopted for privacy protection of speech data and multiuser access control, and the LSTM network model is employed to extract the deep semantic features of the speech data that are taken as the keywords involved in the SE scheme. Based on these, a multiuser searchable encryption speech retrieval scheme supporting one-to-many mode is presented in this paper. The main contributions of this work are as follows:(1)
An encrypted speech retrieval scheme is present that supports multiuser search, which also allows data owners or legally authorized multiple users to send speech search trapdoors to retrieve encrypted speech data stored in cloud servers(2)
The combination of CP-ABE and SE schemes can not only ensure the privacy of speech data and achieve fine-grained access control of users in cloud storage but also realize the secure sharing of speech data(3)
A novel method for keyword extraction of speech content is proposed, which uses the deep features extracted by the LSTM network model as speech keywords to improve retrieval accuracyThe rest of this paper is arranged as follows: Section2 analyzes relevant research work in detail. Section 3 explains the related theoretical basis. Section 4 presents a multiuser encrypted speech retrieval scheme and its implementation process. Section 5 carries out the theoretical analysis and experimental verification of the proposed scheme compared with the existing method performance. Section 6summarizes the work of our paper.


## 2. Related Work

The existing SE schemes have four application modes, namely, one-to-one mode (S/S), one-to-many mode (S/M), many-to-one mode (M/S), and many-to-many mode (M/M); according to application scenarios, these four modes can be divided into single-user searchable encryption and multiuser searchable encryption [14]. Song et al. [15] first proposed a single-user searchable encryption scheme based on sequential scanning. The scheme enables users to store encrypted data in the cloud and perform keyword search through the ciphertext domain. Although it is saving amounts of overhead for users, the search efficiency is low. Li et al. [16] proposed a multikeyword fuzzy searchable encryption retrieval scheme over encrypted cloud storage data. It utilizes inner product to compute relevance to achieve matching retrieval, and the locality sensitive hashing (LSH) and bloom filter are used which obtains high search accuracy. Considering the fuzzy semantic problem of keywords, Liu et al. [17] proposed a fuzzy semantic SE scheme (FSSE), which utilizes a fingerprint generation algorithm and semantic expansion technique to realize fuzzy semantic search by using the Hamming distance. Although the scheme is secure and privacy-preserving, there exists a collusion attack between two cloud servers.However, the above schemes are all single-user searchable encryption schemes that the application scenarios are limited, and very few researchers are engaged in multiuser searchable encryption. Curtmola et al. [18] first presented a multiuser SE scheme to allow a group of users to search the owner’s files by using broadcast encryption. Since then, researchers have proposed solutions for different functions in multiuser scenarios. Ranjan et al. [19] proposed a privacy-preserving scheme that supports keyword search over encrypted data in multiple data owner and multiuser scenarios. The scheme realizes privacy protection and access control by adopting attribute encryption and improves search efficiency by tree index. Deng et al. [20] proposed an efficient multiuser SE scheme with keyword authorization in cloud storage. The solution enables owners to share and search their encrypted files with authorized users. Type-3 asymmetric bilinear mapping and keyword authorization binary tree is used to obtain better performance and prove the security under BDHV and SXDH assumptions. To settle the issue of fine-grained access control for multiuser searchable encryption, Cao et al. [21] proposed a multiuser searchable privacy-preserving scheme for medical data in cloud storage. Owners adopt the CP-ABE scheme to achieve privacy protection and fine-grained access control for multiple users, but the access control attribute lists have some more redundancy, and the attribute set needs further optimization. Lv et al. [22] proposed multiuser searchable encryption with efficient access control in cloud storage. To make retrieval of encrypted data for multiusers by CP-ABE technique and delegate most decryption to the proxy server, Morales-Sandoval et al. [23] gave an attribute-based searchable encryption (ABSE) scheme for secure cloud storage, sharing, and retrieval of encrypted data under the user’s access control. Aiming at the problem of secure Boolean query and ranked search in mobile cloud, Chen et al. [24] presented a multiuser Boolean keyword search scheme (MBKSS), which achieves a rapid Boolean query outcome, and access tree is utilized to access authorization, and they also designed a homomorphic cryptosystem with partial decryption to protect search privacy and rank search.Considering the privacy and searchability of multimedia data stored in the cloud, Yu et al. [25] constructed public-key encryption with a keywords search (PEKS) model based on the lattice that supports multiuser search, where the delegate accesses the encrypted multimedia database with time constraint through proxy reencryption. Yang et al. [26] proposed a data retrieval scheme for multiple users based on the lattice assumption in the multimedia cloud. The scheme uses broadcast encryption to ensure that encrypted multimedia data can be searched by a group of users and proves security by learning with errors (LWE) problem. The traditional privacy-preserving image retrieval scheme not only brings huge computing and communication overhead but also cannot protect image and query privacy well in multiuser scenarios. Wang et al. [27] proposed a content-based privacy-preserving image retrieval (CBIR) framework, which protects the image and query privacy in multiuser scenarios to an extent, and designed a key conversion protocol to support unshared key multiuser image retrieval without loss of search accuracy. To solve the problem of speech search encryption in the cloud, Li and Zhang. [2] proposed a cloud storage method that supports speech encryption search, users use symmetric cryptography algorithm to encrypt local data, and the speech recognizer and hidden Markov model are applied to extract speech text keywords. Glackin et al. [28] presented a strategy for enabling speech recognition to be performed in a cloud environment while preserving the privacy of users. The CNN model is utilized to extract acoustic features of audio and realizes the search of the speech content through the ranking searchable encryption (RSE). Li et al. [29] designed a searchable encrypted voice scheme with privacy-preserving by using a granule computing technique. It uses MFCC to extract voice features and the features obfuscated by creating the fuzzy granule, and AES is adopted to encrypt voices. Then the k-nearest neighbor ciphertext granule search algorithm is used to achieve category retrieval. Hadian et al. [30] proposed a privacy-preserving voice search scheme for medical data, which uses homomorphic encryption to preserve the richness and privacy of voice data and enables efficient voice-based search. Li et al. [31] presented a multiuser searchable encryption voice scheme (MUSEV) deployed in a home IoT system. The LSTM method is employed to achieve voice conversion and enhance retrieval performance and uses the Diffie–Hellman algorithm to exchange parameters between users to support multiuser scheme and improve security.In summary, most of the existing SE schemes are for multimedia text and image retrieval, and there are relatively few works on the retrieval of sensitive speech data. In response to these issues, an encrypted speech retrieval scheme based on multiuser searchable encryption is proposed. Combined with CP-ABE’s characteristic of data security sharing, the scheme enables multiple users to share and retrieve the encrypted speech data stored in the cloud while protecting the privacy of speech data and keywords and uses the LSTM network model to extract deep semantic features as speech keywords to improve the retrieval accuracy.


## 3. Preliminaries

### 3.1. Bilinear Pairing Map

G0 is defined as the cyclic group of prime number p, the generator of G0 is g, and GT is the multiplicative cyclic group with the same order as G0. There exists a bilinear mapping e: G0×G0⟶GT is defined under the following properties:(1)
Bilinearity: for alla,b∈Zpa,b∈Zp and g1,g2∈G0, there exists(1)eg1a,g2b=eg1,g2ab.(2)
Nondegeneracy: for allg1,g2∈G0, eg1,g2≠IG, where IG is the identity element of group G2.(3)
Computability: for allg1,g2∈G0, there exists an efficient algorithm to compute eg1,g2.(4)
Symmetry: for alla,b∈Zpa,b∈Zp and g1,g2∈G0, there exists(2)eg1a,g2b=eg1b,g2a=eg1,g2ab.


### 3.2. Ciphertext-Policy Attribute-Based Encryption (CP-ABE)

The attribute encryption is mainly divided into CP-ABE and key policy attribute encryption (KP-ABE). In the CP-ABE scheme, the user’s identity is represented by a set of descriptive attributes, and the user’s key is related to its own set of attributes. The data owner sets the attribute set for the user’s private key and access structure for the ciphertext. Only when the attributes of the users satisfy the access structure, can users decrypt the ciphertext. Otherwise, the ciphertext cannot be decrypted. The CP-ABE scheme mainly includes the following four steps [32]:Step 1: system initialization: the system setup stage makes the input of the security parameterλ, and then it outputs the public parameter PP and the master key MSK.Step 2: key generation: the key generation stage takes the public parameterPP and a set LDUi of user’s attribute that satisfies the access structure as input; it outputs attribute key SKDUi, which associates with the attributes of the users.Step 3: ecryption: the encryption stage performs the input of public parameterPP, access structure Λ, and a speech data file S that needs to be encrypted; it produces encrypted data CT of the speech data file S, where CT contains information related to access structure Λ.Step 4: decryption: the encryption stage takes the public parameterPP, encrypted data CT, and attribute key SKDUi associated with access control attributes list LDUi of users as input. If the attribute set satisfies the access structure Λ, then the encrypted data CT can be eventually decrypted by using its attribute private key K.


## 3.1. Bilinear Pairing Map

G0 is defined as the cyclic group of prime number p, the generator of G0 is g, and GT is the multiplicative cyclic group with the same order as G0. There exists a bilinear mapping e: G0×G0⟶GT is defined under the following properties:(1)
Bilinearity: for alla,b∈Zpa,b∈Zp and g1,g2∈G0, there exists(1)eg1a,g2b=eg1,g2ab.(2)
Nondegeneracy: for allg1,g2∈G0, eg1,g2≠IG, where IG is the identity element of group G2.(3)
Computability: for allg1,g2∈G0, there exists an efficient algorithm to compute eg1,g2.(4)
Symmetry: for alla,b∈Zpa,b∈Zp and g1,g2∈G0, there exists(2)eg1a,g2b=eg1b,g2a=eg1,g2ab.


## 3.2. Ciphertext-Policy Attribute-Based Encryption (CP-ABE)

The attribute encryption is mainly divided into CP-ABE and key policy attribute encryption (KP-ABE). In the CP-ABE scheme, the user’s identity is represented by a set of descriptive attributes, and the user’s key is related to its own set of attributes. The data owner sets the attribute set for the user’s private key and access structure for the ciphertext. Only when the attributes of the users satisfy the access structure, can users decrypt the ciphertext. Otherwise, the ciphertext cannot be decrypted. The CP-ABE scheme mainly includes the following four steps [32]:Step 1: system initialization: the system setup stage makes the input of the security parameterλ, and then it outputs the public parameter PP and the master key MSK.Step 2: key generation: the key generation stage takes the public parameterPP and a set LDUi of user’s attribute that satisfies the access structure as input; it outputs attribute key SKDUi, which associates with the attributes of the users.Step 3: ecryption: the encryption stage performs the input of public parameterPP, access structure Λ, and a speech data file S that needs to be encrypted; it produces encrypted data CT of the speech data file S, where CT contains information related to access structure Λ.Step 4: decryption: the encryption stage takes the public parameterPP, encrypted data CT, and attribute key SKDUi associated with access control attributes list LDUi of users as input. If the attribute set satisfies the access structure Λ, then the encrypted data CT can be eventually decrypted by using its attribute private key K.


## 4. The Proposed Scheme

### 4.1. System Model

Figure1 shows the system model of the proposed multiuser encrypted speech retrieval scheme with privacy protection. It consists of five different entities: speech data owner (DO), speech retrieval user (DU), trusted authority (TA), cloud server (CS), and proxy server.Figure 1
The system model.The scheme allows multiple users DU, including data owner DO, to retrieve encrypted speech stored in cloud server CS. DO sets the access policy (access control attribute list of users) and uses the CP-ABE scheme to embed the access control policy into the ciphertext. Only the user’s attributes meet the access control policy, and the ciphertext can be decrypted, which achieves a multiuser searchable speech encryption scheme with fine-grained access control.As shown in Figure1, the access policy of our scheme adopts the access structure of the “AND” gate that supports multivalued attributes, where “∗” in the access policy means that the attribute can take any value, realizing flexible access. In our scheme, the access policy is expressed as Γ=Li0,Li1∗,⋯,Lij|i=0,1,…,m;j=0,1,…,n, where i and j represent the number of users and user’s attributes, respectively. Assuming that the attribute list of user DU0 in the system is LDU0=L00,att1,…,L0j|j=0,1,…,n and the attribute list of user DU1 is LDU1=att1,L11,…,L1j|j=0,1,…,n, then it can see that the attribute list of user DU0 satisfies the access policy, but DU1 does not meet the access policy, who cannot access and decrypt data. Besides, the proxy server is introduced to perform a partial decrypting operation to reduce computing overhead on the client. The five constituent entities in the system model, as shown in Figure 1, have the following responsibilities:Speech data owner (DO): DO encrypts the shared speech and stores it to the cloud server (CS). Moreover, multiuser and multiattribute access control lists (access policy) are established by DO. Before encrypting speech data, the LSTM network model is employed to extract deep semantic features of original speech as speech keywords and generates security index I. Then the encrypted speech and security index are bound together and uploaded to the cloud server (CS).Speech retrieval user (DU): DU generates search trapdoors by extracting keywords of the query speech and sends them to CS for matching retrieval in the ciphertext domain, while users have their own attributes and private key and embed the attributes into the private key to generate attribute private key that is used to decrypt the encrypted speech returned.Trusted authority (TA): TA is a trusted third-party authority, which is mainly responsible for generating public parameterPP, MSK, and attribute key SKDUi of the system.Cloud server (CS): CS provides users with data storage service and matching retrieval operation. After receiving the user’s search request, the search trapdoor uploaded by the user and the security index I stored in the CS are used to calculate the privacy-preserving Euclidean distance to realize speech retrieval in the ciphertext domain. If the search trapdoor is matched successfully, the encrypted speech associated with it will be returned.Proxy server: the proxy server mainly performs partial decryption operations of the encrypted data to reduce the user’s computing and storage overhead, which is honest and trustworthy and will not disclose any information.


### 4.2. Security Model

The scheme proposed in this paper selects the indistinguishable security model under plaintext attack [18], which is depicted by introducing the game between challenger B and adversary A, and the specific process is as follows:Initialization: adversary A sends the access policyΛ to challenger B that he desires to challenge.Setup: challenger B executes the key generation algorithm and sends the public parameterPP and the master key MSK to adversary A.Phase 1: adversary A queries the attribute keySKDUi of the users, but the attribute list LDUi of the user does not satisfy the Λ, and then the corresponding attribute key SKDUi is returned by challenger B.Challenge: adversary A submits two equal length original dataS0 and S1, then randomly selects β ∈ {0, 1}, encrypts Sβ under the access policy Λ, generating ciphertext CTΛ∗, and finally sends it to adversary A.Phase 2: adversary A repeats phase 1, but adversary A continues to submit a series of attribute listLDUi to challenger B that is different from phase 1.Guess: adversary A outputs guessβ′. If β′ = β, adversary A wins the game; otherwise, adversary A loses. The advantage of adversary A in this game is defined as (3)AdvCPAλ=Prβ=β′−12.Definition: if A does not break the above security model in a nonnegligible advantage in polynomial time, then our scheme proposed is secure based on the ciphertext indistinguishable under selective plaintext attack (IND-CPA).


### 4.3. Speech Deep Semantic Feature Extraction

In view of the time series relationship of speech features, the LSTM network model is utilized to extract the deep semantic features of the input speech and takes the feature as speech keywordW in this paper. The internal structure of LSTM is shown in Figure 2, which is composed of forget gate, input gate, and output gate.Figure 2
The internal structure of LSTM.Compared with the recurrent neural network (RNN), a state vectorCt is added, and forgetting and updating information is controlled by gating unit. The LSTM model proposed in this paper mainly consists of input layer, hidden layer, and output layer, it has 128 structural units, as shown in Figure 2, in the hidden layer, and the hidden layer at the current moment is determined by the previous hidden layer and input at the current moment.(1)
Forget gate: it is used to save partially forgotten information in the original LSTM unit, and according to outputH(t − 1) of the hidden layer at the previous moment and input X(t) at the current moment, the forgotten degree ft is output by activation function б (sigmoid function):(4)ft=σWxfT⋅Xt+WhfT⋅Ht−1+bf.(2)
Input gate: it decides what new data can be added and stored to the LSTM unit. The input gateit is firstly calculated, and a new candidate memory unit vector C˜t is generated through the tanh function, which is then added, and the data from the memory unit after forget gate ft as output Ct of the memory unit:(5)it=σWxiT⋅Xt+WhiT⋅Ht−1+bi,C˜t=tanhWxcT⋅Xt+WhcT⋅Ht−1+bc,Ct=it⊗C˜t+ft⊗Ct−1.(3)
The LSTM unit of the hidden layer outputs datay(t) by multiplying the data ot of the output gate and data Ct of the new memory unit processed by tanh function point by point:(6)ot=σWxoT⋅Xt+WhoT⋅Ht−1+bo,yt=Ht=ot⊗tanhCt,whereWi, Wf, and Wo are parameter matrices to be trained and bi, bf, and bo are bias items to be trained.(4)
Finally, the datay(t) of the hidden layer is input into the fully connected dense layer containing 512 neurons, and tanh is used as the activation function. The depth feature vector V=Vi|i=1,2,…,l is obtained in the dense layer, where l represents the dimension, and it is 512 in this paper. Eventually, 512 feature data are mapped into 10 categories of speech in the output layer. To reduce complexity, the extracted deep semantic feature V is hashed according to (7) to construct speech hash sequence Vi = {v1, v2, …, vl} as the speech keyword.(7)vi=1,Vi−Vτ>0,0,Vi−Vτ≤0,whereVτ is the median of deep feature vector V.


### 4.4. Detailed Construction of Multiuser Speech Retrieval Scheme

The system model in Figure1 studies the searchable speech encryption scheme with multiple users DU =  DUi|i=0,1,2,⋯,m, where DU0 is the data owner and m is the number of users. The specific processing procedure for multiuser searchable speech encryption is as follows.Firstly, DO defines an access policyΛ based on the actual situation and encrypts data under this policy Λ. The access structure is represented by the access control attribute list of the users so that only users satisfied with the access policy can access and decrypt. The attribute list of the users is exhibited in Table 1.Table 1
The access control attribute list of the users.
UserAttributesDU0L01L02⋯L0nDU1L11L12⋯L1nDU2L21L22⋯L2n⋯⋯⋯⋯DUmLm1Lm2⋯LmnThen, TA generates the user’s attribute keySKDUi=skij|j=0,1,…,m according to the uploaded attribute list table, and the user can exploit the attribute private key to decrypt the ciphertext. At the same time, DO adopts the LSTM network to extract deep semantic feature V and generates the corresponding security index table.Finally, DO uploads the encrypted data and secure index table to the CS for storage.When the user sends a retrieval request, the trained LSTM network is firstly used to extract the deep semantic featureq of the query speech, and it is encrypted to generate search trapdoor Tq and uploaded to CS. If the attributes of the DU meet the access policy Λ, CS uses the Euclidean distance algorithm to calculate the similarity between the security index table and the search trapdoor Tq to achieve a matching retrieval operation; if matching is achieved successfully, then it submits the retrieval result CTq to the proxy server performing partial ciphertext decryption and returns it to the DU to execute eventual decryption operation by their own attribute private key K. Finally, the original speech is obtained associated with query speech feature q.Figure3 shows the retrieval processing flowchart of the proposed scheme, and the detailed construction of the scheme is as follows.Figure 3
The retrieval processing flowchart of the proposed scheme.The specific steps are as follows.


#### 4.4.1. Building of Encrypted Speech Library and Secure Index

(1)
Key generation is as follows.Step 1: TA first generates public parametersPP and master key MSK of the system. g is a generator of the multiplicative cycle group G0, and P is the large prime number. It chooses a pseudorandom function f:{0, 1}λ ⟶ G0 mapping to prime number field Zl that the order is P, selects the random numbers yj, t0, t1, ⋯, tn∈Ζp∗, and computes(8)F=eg,gyj,Ti=gti.Let the public parameterPP = {(g, f, F, Ti) |i = 0, 1, …, m; j = 0, 1, …, n} and the master key MSK = {yj, ti |i = 0, 1, …, m; j = 0, 1, …, n}.Step 2: TA uses pseudorandom functionf to produce random numbers Ri, Ra, Rj∈Zpl and random matrix MϵZpl×l with size (l + 3) × (l + 3) and takes {Ri, Rj, M−1} as the key for the construction of security index I of the data owner, and {Ra, M} is used as the key to generating search trapdoor Tq of the query user.(2)
According to the access control attribute listLDUi=Lij|j=0,1,…,n of the users, TA generates the attribute key SKDUi=skij|j=0,1,…,n of the users, where n is the number of users’ attributes.Step 1: TA selects a random numberr∈Ζp∗ and calculates(9)rij=rLij∑j=1nLij.Step 2: TA calculates attribute keyskij based on the attribute Lij in the attribute set LDUi of the user DUi:(10)skij=∏j=1nTirij=Ti∑j=1nrij=Tir.Then the attribute keySKDUi of the user DUi can be expressed as(11)SKDUi=skij∣skij=Tirij;j=1,2,…,n.Step 3: TA computes the private key of the users:(12)b=grij,d=gy+rij,wherei=0,1,…,m;j=0,1,…,n. Finally, TA sends the attribute key SKDUi obtained along with {b, d} to the user DUi.(3)
TA encrypts the speech data fileS of the user DUi to generate an encrypted data CT.TA chooses a random numbers∈Ζp∗ and F in the public parameter PP and computes(13)C=SFs,C0=gs,C1=gs∏j=1nTis.Let the encrypted dataCT=C,C0,C1, and upload CT to CS for storage.(4)
DO generates the security index table corresponding to the speech fileS=S1,S2,…,Sn.Step 1: DO firstly extractsl-dimensional deep semantic feature vectors V=V1,V2,…,Vn of the speech file S=S1,S2,…,Sn by using the approach mentioned in Section 4.3.Step 2: DO selects the random numbersRi and Rj generated and expands speech feature vector V into l + 3-dimensional vector v′⟶, and the calculation is shown in(14)v′⟶=∑j=1lvij2+Ri−Rj,vi1,vi2,…,vil,1,Rj.Step 3: DO uses the inverse matrixM−1 of the random reversible matrix M generated in Step 2 to encrypt the vector v′⟶, and the calculation is shown in(15)EM−1V=v′⟶M−1.After completing encryption, DO usesEk(V) as the secure index I of the feature vector V corresponding to the speech file S and uploads the security index I to the CS for storage.


#### 4.4.2. User Speech Retrieval

(1)
For each query speechQ=q1,q2,…,qn, DU generates search trapdoor Tq.Step 1: DU first uses the method in Section4.3 to obtain the l dimension deep semantic feature vector q of the query speech Q.Step 2: DU adopts the random numberRa generated to extend the feature vector q to (l + 3) dimensions vector q′⟶ by(16)q′⟶=1,−2q1,−2q2,…,−2ql,Ra,1.Step 3: according to the random reversible matrixM generated in Step 2, DU encrypts vector q′⟶ generated that is calculated by(17)EM=qq′⟶MT.Finally, the query user DU takesEk(q) as the search trapdoor Tq of the query speech Q corresponding to the feature vector q and sends it to the CS.(2)
CS performs speech retrieval.When CS receives the retrieval trapdoorTq uploaded by the query user DU, the similarity between it and the security index table is calculated by(18)D=I⋅Tq=Ekv⋅Ekq=vi′⟶M−1⋅q′⟶MTT=∑j=1lvij2+Ri−Rj,vi1,…,vil,1,Rj⋅1,−2q1,…,−2ql,Ra,1T=∑j=1lvij−qj2+∑j=1lqj2−Ri−Ra=v⋅qT+∑j=1lqj2−Ri−Ra=dis+∑j=1lqj2−Ri−Ra,wheredis represents the similarity between query speech feature vector q and feature vector V in the speech library by calculating Euclidean distance, as shown in (19), and ∑i=1lqj2−Ri−Ra is a constant, which will not affect the final result. Therefore, it is shown that the similarity measure between encrypted features is equivalent to plaintext, and the distance of the ciphertext domain is proportional to the plaintext domain from (18). Thus, the speech retrieval in the ciphertext domain is equivalent to that in the plaintext domain, and the scheme realizes privacy-preserving speech retrieval in the cloud environment.(19)dis=q,V=∑i=1lvij−qj2,wherel is the dimension of the speech feature vector and vij and qj represent the eigenvalue of the speech feature vector in the speech library and the query speech feature vector, respectively.(3)
Proxy server performs partial decryption of the ciphertextCT to obtain a decrypted ciphertext E.Step 1: proxy server uses private keysskk and C0 to partially decrypt ciphertext C to get the decrypted ciphertext E.(20)E=Ceskk,C0,skk=d⋅skij=gy+rij⋅∏j=1nTirij.Step 2: proxy server sends {E, Li, C1} to the DUi.Step 3: DUi first computes the attribute private key K of the users.(21)K=1eb,C1.(4)
User decrypts ciphertextE to obtain plaintext S of the retrieval results.The retrieval resultS is obtained by using the attribute private key K of the DUi.(22)S=EK.Correctness proof(23)∑j=1nyj=y,∑j=1nrij=∑j=1nrLij∑j=1nLij=r∑j=1nLij∑j=1nLij=r,K=1eb,C1=1egrij,gs∏j=1nTis=1egrij,gs⋅egrij,∏j=1ngtis.Proof.
E/K=C/eskk,C0K=C⋅egrij,gs⋅egrij,∏j=1ngtis/egy+rij⋅∏j=1nTirij,gs=C⋅egrij,gs⋅egrij,∏j=1ngtis/egy,gs⋅egrij,gs⋅e∏j=1ngtirij,gs=SFs⋅egrij,gs⋅egrij,∏j=1ngtis/egy,gs⋅egrij,gs⋅e∏j=1ngtirij,gs=S⋅∏j=1neg,gyjs⋅egrij,gs⋅egrij,∏j=1ngtis/egy,gs⋅egrij,gs⋅e∏j=1ngtirij,gs=S⋅∏j=1neg,gyjs⋅egs,∏j=1ngtirij/egy,gs⋅egs,∏j=1ngtirij=S⋅eg,gs∑j=1nyj/egy,gs=S⋅eg,gys/eg,gys=S.


## 4.1. System Model

Figure1 shows the system model of the proposed multiuser encrypted speech retrieval scheme with privacy protection. It consists of five different entities: speech data owner (DO), speech retrieval user (DU), trusted authority (TA), cloud server (CS), and proxy server.Figure 1
The system model.The scheme allows multiple users DU, including data owner DO, to retrieve encrypted speech stored in cloud server CS. DO sets the access policy (access control attribute list of users) and uses the CP-ABE scheme to embed the access control policy into the ciphertext. Only the user’s attributes meet the access control policy, and the ciphertext can be decrypted, which achieves a multiuser searchable speech encryption scheme with fine-grained access control.As shown in Figure1, the access policy of our scheme adopts the access structure of the “AND” gate that supports multivalued attributes, where “∗” in the access policy means that the attribute can take any value, realizing flexible access. In our scheme, the access policy is expressed as Γ=Li0,Li1∗,⋯,Lij|i=0,1,…,m;j=0,1,…,n, where i and j represent the number of users and user’s attributes, respectively. Assuming that the attribute list of user DU0 in the system is LDU0=L00,att1,…,L0j|j=0,1,…,n and the attribute list of user DU1 is LDU1=att1,L11,…,L1j|j=0,1,…,n, then it can see that the attribute list of user DU0 satisfies the access policy, but DU1 does not meet the access policy, who cannot access and decrypt data. Besides, the proxy server is introduced to perform a partial decrypting operation to reduce computing overhead on the client. The five constituent entities in the system model, as shown in Figure 1, have the following responsibilities:Speech data owner (DO): DO encrypts the shared speech and stores it to the cloud server (CS). Moreover, multiuser and multiattribute access control lists (access policy) are established by DO. Before encrypting speech data, the LSTM network model is employed to extract deep semantic features of original speech as speech keywords and generates security index I. Then the encrypted speech and security index are bound together and uploaded to the cloud server (CS).Speech retrieval user (DU): DU generates search trapdoors by extracting keywords of the query speech and sends them to CS for matching retrieval in the ciphertext domain, while users have their own attributes and private key and embed the attributes into the private key to generate attribute private key that is used to decrypt the encrypted speech returned.Trusted authority (TA): TA is a trusted third-party authority, which is mainly responsible for generating public parameterPP, MSK, and attribute key SKDUi of the system.Cloud server (CS): CS provides users with data storage service and matching retrieval operation. After receiving the user’s search request, the search trapdoor uploaded by the user and the security index I stored in the CS are used to calculate the privacy-preserving Euclidean distance to realize speech retrieval in the ciphertext domain. If the search trapdoor is matched successfully, the encrypted speech associated with it will be returned.Proxy server: the proxy server mainly performs partial decryption operations of the encrypted data to reduce the user’s computing and storage overhead, which is honest and trustworthy and will not disclose any information.


## 4.2. Security Model

The scheme proposed in this paper selects the indistinguishable security model under plaintext attack [18], which is depicted by introducing the game between challenger B and adversary A, and the specific process is as follows:Initialization: adversary A sends the access policyΛ to challenger B that he desires to challenge.Setup: challenger B executes the key generation algorithm and sends the public parameterPP and the master key MSK to adversary A.Phase 1: adversary A queries the attribute keySKDUi of the users, but the attribute list LDUi of the user does not satisfy the Λ, and then the corresponding attribute key SKDUi is returned by challenger B.Challenge: adversary A submits two equal length original dataS0 and S1, then randomly selects β ∈ {0, 1}, encrypts Sβ under the access policy Λ, generating ciphertext CTΛ∗, and finally sends it to adversary A.Phase 2: adversary A repeats phase 1, but adversary A continues to submit a series of attribute listLDUi to challenger B that is different from phase 1.Guess: adversary A outputs guessβ′. If β′ = β, adversary A wins the game; otherwise, adversary A loses. The advantage of adversary A in this game is defined as (3)AdvCPAλ=Prβ=β′−12.Definition: if A does not break the above security model in a nonnegligible advantage in polynomial time, then our scheme proposed is secure based on the ciphertext indistinguishable under selective plaintext attack (IND-CPA).


## 4.3. Speech Deep Semantic Feature Extraction

In view of the time series relationship of speech features, the LSTM network model is utilized to extract the deep semantic features of the input speech and takes the feature as speech keywordW in this paper. The internal structure of LSTM is shown in Figure 2, which is composed of forget gate, input gate, and output gate.Figure 2
The internal structure of LSTM.Compared with the recurrent neural network (RNN), a state vectorCt is added, and forgetting and updating information is controlled by gating unit. The LSTM model proposed in this paper mainly consists of input layer, hidden layer, and output layer, it has 128 structural units, as shown in Figure 2, in the hidden layer, and the hidden layer at the current moment is determined by the previous hidden layer and input at the current moment.(1)
Forget gate: it is used to save partially forgotten information in the original LSTM unit, and according to outputH(t − 1) of the hidden layer at the previous moment and input X(t) at the current moment, the forgotten degree ft is output by activation function б (sigmoid function):(4)ft=σWxfT⋅Xt+WhfT⋅Ht−1+bf.(2)
Input gate: it decides what new data can be added and stored to the LSTM unit. The input gateit is firstly calculated, and a new candidate memory unit vector C˜t is generated through the tanh function, which is then added, and the data from the memory unit after forget gate ft as output Ct of the memory unit:(5)it=σWxiT⋅Xt+WhiT⋅Ht−1+bi,C˜t=tanhWxcT⋅Xt+WhcT⋅Ht−1+bc,Ct=it⊗C˜t+ft⊗Ct−1.(3)
The LSTM unit of the hidden layer outputs datay(t) by multiplying the data ot of the output gate and data Ct of the new memory unit processed by tanh function point by point:(6)ot=σWxoT⋅Xt+WhoT⋅Ht−1+bo,yt=Ht=ot⊗tanhCt,whereWi, Wf, and Wo are parameter matrices to be trained and bi, bf, and bo are bias items to be trained.(4)
Finally, the datay(t) of the hidden layer is input into the fully connected dense layer containing 512 neurons, and tanh is used as the activation function. The depth feature vector V=Vi|i=1,2,…,l is obtained in the dense layer, where l represents the dimension, and it is 512 in this paper. Eventually, 512 feature data are mapped into 10 categories of speech in the output layer. To reduce complexity, the extracted deep semantic feature V is hashed according to (7) to construct speech hash sequence Vi = {v1, v2, …, vl} as the speech keyword.(7)vi=1,Vi−Vτ>0,0,Vi−Vτ≤0,whereVτ is the median of deep feature vector V.


## 4.4. Detailed Construction of Multiuser Speech Retrieval Scheme

The system model in Figure1 studies the searchable speech encryption scheme with multiple users DU =  DUi|i=0,1,2,⋯,m, where DU0 is the data owner and m is the number of users. The specific processing procedure for multiuser searchable speech encryption is as follows.Firstly, DO defines an access policyΛ based on the actual situation and encrypts data under this policy Λ. The access structure is represented by the access control attribute list of the users so that only users satisfied with the access policy can access and decrypt. The attribute list of the users is exhibited in Table 1.Table 1
The access control attribute list of the users.
UserAttributesDU0L01L02⋯L0nDU1L11L12⋯L1nDU2L21L22⋯L2n⋯⋯⋯⋯DUmLm1Lm2⋯LmnThen, TA generates the user’s attribute keySKDUi=skij|j=0,1,…,m according to the uploaded attribute list table, and the user can exploit the attribute private key to decrypt the ciphertext. At the same time, DO adopts the LSTM network to extract deep semantic feature V and generates the corresponding security index table.Finally, DO uploads the encrypted data and secure index table to the CS for storage.When the user sends a retrieval request, the trained LSTM network is firstly used to extract the deep semantic featureq of the query speech, and it is encrypted to generate search trapdoor Tq and uploaded to CS. If the attributes of the DU meet the access policy Λ, CS uses the Euclidean distance algorithm to calculate the similarity between the security index table and the search trapdoor Tq to achieve a matching retrieval operation; if matching is achieved successfully, then it submits the retrieval result CTq to the proxy server performing partial ciphertext decryption and returns it to the DU to execute eventual decryption operation by their own attribute private key K. Finally, the original speech is obtained associated with query speech feature q.Figure3 shows the retrieval processing flowchart of the proposed scheme, and the detailed construction of the scheme is as follows.Figure 3
The retrieval processing flowchart of the proposed scheme.The specific steps are as follows.


### 4.4.1. Building of Encrypted Speech Library and Secure Index

(1)
Key generation is as follows.Step 1: TA first generates public parametersPP and master key MSK of the system. g is a generator of the multiplicative cycle group G0, and P is the large prime number. It chooses a pseudorandom function f:{0, 1}λ ⟶ G0 mapping to prime number field Zl that the order is P, selects the random numbers yj, t0, t1, ⋯, tn∈Ζp∗, and computes(8)F=eg,gyj,Ti=gti.Let the public parameterPP = {(g, f, F, Ti) |i = 0, 1, …, m; j = 0, 1, …, n} and the master key MSK = {yj, ti |i = 0, 1, …, m; j = 0, 1, …, n}.Step 2: TA uses pseudorandom functionf to produce random numbers Ri, Ra, Rj∈Zpl and random matrix MϵZpl×l with size (l + 3) × (l + 3) and takes {Ri, Rj, M−1} as the key for the construction of security index I of the data owner, and {Ra, M} is used as the key to generating search trapdoor Tq of the query user.(2)
According to the access control attribute listLDUi=Lij|j=0,1,…,n of the users, TA generates the attribute key SKDUi=skij|j=0,1,…,n of the users, where n is the number of users’ attributes.Step 1: TA selects a random numberr∈Ζp∗ and calculates(9)rij=rLij∑j=1nLij.Step 2: TA calculates attribute keyskij based on the attribute Lij in the attribute set LDUi of the user DUi:(10)skij=∏j=1nTirij=Ti∑j=1nrij=Tir.Then the attribute keySKDUi of the user DUi can be expressed as(11)SKDUi=skij∣skij=Tirij;j=1,2,…,n.Step 3: TA computes the private key of the users:(12)b=grij,d=gy+rij,wherei=0,1,…,m;j=0,1,…,n. Finally, TA sends the attribute key SKDUi obtained along with {b, d} to the user DUi.(3)
TA encrypts the speech data fileS of the user DUi to generate an encrypted data CT.TA chooses a random numbers∈Ζp∗ and F in the public parameter PP and computes(13)C=SFs,C0=gs,C1=gs∏j=1nTis.Let the encrypted dataCT=C,C0,C1, and upload CT to CS for storage.(4)
DO generates the security index table corresponding to the speech fileS=S1,S2,…,Sn.Step 1: DO firstly extractsl-dimensional deep semantic feature vectors V=V1,V2,…,Vn of the speech file S=S1,S2,…,Sn by using the approach mentioned in Section 4.3.Step 2: DO selects the random numbersRi and Rj generated and expands speech feature vector V into l + 3-dimensional vector v′⟶, and the calculation is shown in(14)v′⟶=∑j=1lvij2+Ri−Rj,vi1,vi2,…,vil,1,Rj.Step 3: DO uses the inverse matrixM−1 of the random reversible matrix M generated in Step 2 to encrypt the vector v′⟶, and the calculation is shown in(15)EM−1V=v′⟶M−1.After completing encryption, DO usesEk(V) as the secure index I of the feature vector V corresponding to the speech file S and uploads the security index I to the CS for storage.


### 4.4.2. User Speech Retrieval

(1)
For each query speechQ=q1,q2,…,qn, DU generates search trapdoor Tq.Step 1: DU first uses the method in Section4.3 to obtain the l dimension deep semantic feature vector q of the query speech Q.Step 2: DU adopts the random numberRa generated to extend the feature vector q to (l + 3) dimensions vector q′⟶ by(16)q′⟶=1,−2q1,−2q2,…,−2ql,Ra,1.Step 3: according to the random reversible matrixM generated in Step 2, DU encrypts vector q′⟶ generated that is calculated by(17)EM=qq′⟶MT.Finally, the query user DU takesEk(q) as the search trapdoor Tq of the query speech Q corresponding to the feature vector q and sends it to the CS.(2)
CS performs speech retrieval.When CS receives the retrieval trapdoorTq uploaded by the query user DU, the similarity between it and the security index table is calculated by(18)D=I⋅Tq=Ekv⋅Ekq=vi′⟶M−1⋅q′⟶MTT=∑j=1lvij2+Ri−Rj,vi1,…,vil,1,Rj⋅1,−2q1,…,−2ql,Ra,1T=∑j=1lvij−qj2+∑j=1lqj2−Ri−Ra=v⋅qT+∑j=1lqj2−Ri−Ra=dis+∑j=1lqj2−Ri−Ra,wheredis represents the similarity between query speech feature vector q and feature vector V in the speech library by calculating Euclidean distance, as shown in (19), and ∑i=1lqj2−Ri−Ra is a constant, which will not affect the final result. Therefore, it is shown that the similarity measure between encrypted features is equivalent to plaintext, and the distance of the ciphertext domain is proportional to the plaintext domain from (18). Thus, the speech retrieval in the ciphertext domain is equivalent to that in the plaintext domain, and the scheme realizes privacy-preserving speech retrieval in the cloud environment.(19)dis=q,V=∑i=1lvij−qj2,wherel is the dimension of the speech feature vector and vij and qj represent the eigenvalue of the speech feature vector in the speech library and the query speech feature vector, respectively.(3)
Proxy server performs partial decryption of the ciphertextCT to obtain a decrypted ciphertext E.Step 1: proxy server uses private keysskk and C0 to partially decrypt ciphertext C to get the decrypted ciphertext E.(20)E=Ceskk,C0,skk=d⋅skij=gy+rij⋅∏j=1nTirij.Step 2: proxy server sends {E, Li, C1} to the DUi.Step 3: DUi first computes the attribute private key K of the users.(21)K=1eb,C1.(4)
User decrypts ciphertextE to obtain plaintext S of the retrieval results.The retrieval resultS is obtained by using the attribute private key K of the DUi.(22)S=EK.Correctness proof(23)∑j=1nyj=y,∑j=1nrij=∑j=1nrLij∑j=1nLij=r∑j=1nLij∑j=1nLij=r,K=1eb,C1=1egrij,gs∏j=1nTis=1egrij,gs⋅egrij,∏j=1ngtis.Proof.
E/K=C/eskk,C0K=C⋅egrij,gs⋅egrij,∏j=1ngtis/egy+rij⋅∏j=1nTirij,gs=C⋅egrij,gs⋅egrij,∏j=1ngtis/egy,gs⋅egrij,gs⋅e∏j=1ngtirij,gs=SFs⋅egrij,gs⋅egrij,∏j=1ngtis/egy,gs⋅egrij,gs⋅e∏j=1ngtirij,gs=S⋅∏j=1neg,gyjs⋅egrij,gs⋅egrij,∏j=1ngtis/egy,gs⋅egrij,gs⋅e∏j=1ngtirij,gs=S⋅∏j=1neg,gyjs⋅egs,∏j=1ngtirij/egy,gs⋅egs,∏j=1ngtirij=S⋅eg,gs∑j=1nyj/egy,gs=S⋅eg,gys/eg,gys=S.


## 4.4.1. Building of Encrypted Speech Library and Secure Index

(1)
Key generation is as follows.Step 1: TA first generates public parametersPP and master key MSK of the system. g is a generator of the multiplicative cycle group G0, and P is the large prime number. It chooses a pseudorandom function f:{0, 1}λ ⟶ G0 mapping to prime number field Zl that the order is P, selects the random numbers yj, t0, t1, ⋯, tn∈Ζp∗, and computes(8)F=eg,gyj,Ti=gti.Let the public parameterPP = {(g, f, F, Ti) |i = 0, 1, …, m; j = 0, 1, …, n} and the master key MSK = {yj, ti |i = 0, 1, …, m; j = 0, 1, …, n}.Step 2: TA uses pseudorandom functionf to produce random numbers Ri, Ra, Rj∈Zpl and random matrix MϵZpl×l with size (l + 3) × (l + 3) and takes {Ri, Rj, M−1} as the key for the construction of security index I of the data owner, and {Ra, M} is used as the key to generating search trapdoor Tq of the query user.(2)
According to the access control attribute listLDUi=Lij|j=0,1,…,n of the users, TA generates the attribute key SKDUi=skij|j=0,1,…,n of the users, where n is the number of users’ attributes.Step 1: TA selects a random numberr∈Ζp∗ and calculates(9)rij=rLij∑j=1nLij.Step 2: TA calculates attribute keyskij based on the attribute Lij in the attribute set LDUi of the user DUi:(10)skij=∏j=1nTirij=Ti∑j=1nrij=Tir.Then the attribute keySKDUi of the user DUi can be expressed as(11)SKDUi=skij∣skij=Tirij;j=1,2,…,n.Step 3: TA computes the private key of the users:(12)b=grij,d=gy+rij,wherei=0,1,…,m;j=0,1,…,n. Finally, TA sends the attribute key SKDUi obtained along with {b, d} to the user DUi.(3)
TA encrypts the speech data fileS of the user DUi to generate an encrypted data CT.TA chooses a random numbers∈Ζp∗ and F in the public parameter PP and computes(13)C=SFs,C0=gs,C1=gs∏j=1nTis.Let the encrypted dataCT=C,C0,C1, and upload CT to CS for storage.(4)
DO generates the security index table corresponding to the speech fileS=S1,S2,…,Sn.Step 1: DO firstly extractsl-dimensional deep semantic feature vectors V=V1,V2,…,Vn of the speech file S=S1,S2,…,Sn by using the approach mentioned in Section 4.3.Step 2: DO selects the random numbersRi and Rj generated and expands speech feature vector V into l + 3-dimensional vector v′⟶, and the calculation is shown in(14)v′⟶=∑j=1lvij2+Ri−Rj,vi1,vi2,…,vil,1,Rj.Step 3: DO uses the inverse matrixM−1 of the random reversible matrix M generated in Step 2 to encrypt the vector v′⟶, and the calculation is shown in(15)EM−1V=v′⟶M−1.After completing encryption, DO usesEk(V) as the secure index I of the feature vector V corresponding to the speech file S and uploads the security index I to the CS for storage.


## 4.4.2. User Speech Retrieval

(1)
For each query speechQ=q1,q2,…,qn, DU generates search trapdoor Tq.Step 1: DU first uses the method in Section4.3 to obtain the l dimension deep semantic feature vector q of the query speech Q.Step 2: DU adopts the random numberRa generated to extend the feature vector q to (l + 3) dimensions vector q′⟶ by(16)q′⟶=1,−2q1,−2q2,…,−2ql,Ra,1.Step 3: according to the random reversible matrixM generated in Step 2, DU encrypts vector q′⟶ generated that is calculated by(17)EM=qq′⟶MT.Finally, the query user DU takesEk(q) as the search trapdoor Tq of the query speech Q corresponding to the feature vector q and sends it to the CS.(2)
CS performs speech retrieval.When CS receives the retrieval trapdoorTq uploaded by the query user DU, the similarity between it and the security index table is calculated by(18)D=I⋅Tq=Ekv⋅Ekq=vi′⟶M−1⋅q′⟶MTT=∑j=1lvij2+Ri−Rj,vi1,…,vil,1,Rj⋅1,−2q1,…,−2ql,Ra,1T=∑j=1lvij−qj2+∑j=1lqj2−Ri−Ra=v⋅qT+∑j=1lqj2−Ri−Ra=dis+∑j=1lqj2−Ri−Ra,wheredis represents the similarity between query speech feature vector q and feature vector V in the speech library by calculating Euclidean distance, as shown in (19), and ∑i=1lqj2−Ri−Ra is a constant, which will not affect the final result. Therefore, it is shown that the similarity measure between encrypted features is equivalent to plaintext, and the distance of the ciphertext domain is proportional to the plaintext domain from (18). Thus, the speech retrieval in the ciphertext domain is equivalent to that in the plaintext domain, and the scheme realizes privacy-preserving speech retrieval in the cloud environment.(19)dis=q,V=∑i=1lvij−qj2,wherel is the dimension of the speech feature vector and vij and qj represent the eigenvalue of the speech feature vector in the speech library and the query speech feature vector, respectively.(3)
Proxy server performs partial decryption of the ciphertextCT to obtain a decrypted ciphertext E.Step 1: proxy server uses private keysskk and C0 to partially decrypt ciphertext C to get the decrypted ciphertext E.(20)E=Ceskk,C0,skk=d⋅skij=gy+rij⋅∏j=1nTirij.Step 2: proxy server sends {E, Li, C1} to the DUi.Step 3: DUi first computes the attribute private key K of the users.(21)K=1eb,C1.(4)
User decrypts ciphertextE to obtain plaintext S of the retrieval results.The retrieval resultS is obtained by using the attribute private key K of the DUi.(22)S=EK.Correctness proof(23)∑j=1nyj=y,∑j=1nrij=∑j=1nrLij∑j=1nLij=r∑j=1nLij∑j=1nLij=r,K=1eb,C1=1egrij,gs∏j=1nTis=1egrij,gs⋅egrij,∏j=1ngtis.Proof.
E/K=C/eskk,C0K=C⋅egrij,gs⋅egrij,∏j=1ngtis/egy+rij⋅∏j=1nTirij,gs=C⋅egrij,gs⋅egrij,∏j=1ngtis/egy,gs⋅egrij,gs⋅e∏j=1ngtirij,gs=SFs⋅egrij,gs⋅egrij,∏j=1ngtis/egy,gs⋅egrij,gs⋅e∏j=1ngtirij,gs=S⋅∏j=1neg,gyjs⋅egrij,gs⋅egrij,∏j=1ngtis/egy,gs⋅egrij,gs⋅e∏j=1ngtirij,gs=S⋅∏j=1neg,gyjs⋅egs,∏j=1ngtirij/egy,gs⋅egs,∏j=1ngtirij=S⋅eg,gs∑j=1nyj/egy,gs=S⋅eg,gys/eg,gys=S.


## 5. Experimental Results and Performance Analysis

This paper evaluates the performance of the proposed scheme by the theoretical analysis and experimental results. The Chinese speech database THCHS-30 [33] published by the Speech and Language Technology Center of Tsinghua University (CSLT) is adopted as the dataset, with a total duration of more than 30 hours, a sampling frequency of 16 kHz, and a sampling accuracy of 16-bit single-channel wave format speech segments. Ten kinds of speech sound with different content were obtained from 17 different speakers, and a speech segment of equal length 4 s was used for the experiment, 80% of which was used for LSTM training and 20% for testing. In the experimental retrieval analysis stage, 1000 speech segments from THCHS-30 were randomly selected for evaluation.The hardware platform is Intel(R) Core(TM) i5-5200U CPU, 2.50 GHz, and 16 GB of memory, and the software environment is Windows 10, MATLAB R2017b, and TensorFlow-CPU 2.1.x+Python 3.7 for experimental testing and performance evaluation.


### 5.1. Security Analysis

In this section, based on the DBDH assumption, the security against selected plaintext attacks under the standard model is proved, and an analysis of data and search privacy is conducted.Theorem: challenger B can resolve the DBDH difficulty problem with a nonnegligible advantageε/2, if adversary A can break the proposed scheme with an advantage ε=AdvCPAλ.Proof: challenger B inputs a random DBDH challengeg,gα,gϕ,gθ,H and a random bit σ ∈ {0, 1}; if σ = 0, set H=eg,gαϕθ. Otherwise, if σ = 1, then H is a random value in GT. The interaction between challenger B and adversary A is simulated as follows.Initialization: adversary A chooses the access structureΛ to be challenged that is sent to challenger B and assumes that the trusted authority TA and the proxy server are loyal and will not disclose the attribute key SKDUi.Setup: challenger B sends the public parameterPP and the master key MSK to adversary A.Phase 1: adversary A submits an attribute listLij∈L to challenger B requesting an attribute key SKDUi.Challenge: adversary A submits two equal length original plaintext dataS0 and S1 and randomly selects β ∈ {0, 1} to generate challenged ciphertext C∗=Sβ⋅Hu∏j=1negθ,gyj, C0∗=gθ, and C0∗=gθugθ∑Λti. Finally, challenger B returns the challenged ciphertext CTΛ∗=Λ∗,C∗,C0∗,C1∗ to adversary A.WhenH=eg,gαϕθ, the ciphertext CTΛ∗=Λ∗,C∗,C0∗,C1∗ is the legal ciphertext of the plaintext Sβ. Otherwise, when H is a random value in GT, the ciphertext CTΛ∗ is a random ciphertext.Phase 2: perform the same query as in the key query phase 1.Guess: adversary A guesses a bitβ′∈0,1β′∈0,1; if β' = β, challenger B outputs 0, indicating a guess H=eg,gαϕθ, and then σ = 0. At this time, CTΛ∗ is an available ciphertext, and the advantage of adversary A is ε=AdvCPAλ. Therefore, it can be concluded that(24)PrΒg,gα,gϕ,gθ,eg,gαϕθ=0=12+AdvCPAλ.Otherwise, it outputs 1, which means that the guessH is a random value in GT; that is, σ = 1. At this point, it is completely random for adversary A, and it can acquire(25)PrΒg,gα,gϕ,gθ,H=0=12.Thus, the advantage of challenger B is(26)AdvCPA−Βλ=12PrΒg,gα,gϕ,gθ,eg,gαϕθ=0+12PrΒg,gα,gϕ,gθ,H=0−121212+AdvCPAλ+12⋅12−12=AdvCPAλ2=ε2.Therefore, it can be concluded that the DBDH assumption can be broken with a nonnegligible advantage. The scheme proposed is IND-CPA secure.(1)
The privacy protection of the speech dataIn our scheme, according toC=SFs in (13), using public parameter F encrypts the original data S to obtain the encrypted data C, and only users satisfied with the access policy Λ can decrypt the ciphertext C, effectively preventing illegal users from accessing and acquiring data and improving the security of the data. Even if the malicious user acquires the ciphertext C, according to the attribute key generation (10), the adversary A first needs to solve the discrete logarithm equation skij=Tirij in (11). Due to the difficulty in calculating the discrete logarithm problem, rij cannot be solved.(2)
The privacy protection of the keywordsAccording to (15), the keywords corresponding to each speech file are encrypted with the randomly reversible matrix M−1 and the extended random vector vi′⟶ to hide its content. The encryption result is affected by the reversible matrix M−1 and random numbers Ri and Rj, and these random numbers are indistinguishable. Therefore, the same keyword generates different ciphertext under the same key, and adversary A cannot obtain any information about plaintext from the ciphertext in the polynomial time, which ensures the safety of the keywords.(3)
The privacy protection of the search trapdoorIn the process of generating search trapdoorTq, according to (17), the query user firstly selects random number Ra for each query feature q to construct a random vector q′⟶ and then uses a random matrix M to encrypt the vector to generate search trapdoor Tq. Since Ra and M are indistinguishable, different search trapdoor Tq can be generated for the same query. If adversary A obtains the trapdoor, it cannot get indistinguishable random number Ra and random matrix M from the trapdoor Tq; thus, no information about Q can be acquired that protects the search privacy.


### 5.2. Performance Analysis of the Proposed LSTM Network Model

At present, the method of employing the LSTM network model enabling speech recognition can be used as a keyword extraction approach to solving the issue of speech keyword extraction. Therefore, the proposed scheme uses LSTM deep learning model to extract deep semantic features of speech and evaluates the performance of the model through the pretraining model. Figure4 shows the training/test curve of the LSTM network model under the speech spectrogram and MFCC features.Figure 4
The speech spectrogram and MFCC train/test curve. (a) The train/test loss curve. (b) The train/test accuracy curve.
(a)(b)As shown in Figure4, taking MFCC as input of the LSTM network model has faster convergence, lower loss, and higher accuracy. After 40 iterations of training, its training accuracy is 99.97%, and the test accuracy is 99.28%; meantime, the training and test loss is almost close to 0, and the model is not overfitting. However, when the speech spectrogram is used as the input, its training performance is poor. This is because the speech spectrogram feature contains too much redundant information and has a large dimension, which will cause the loss of the feature information of the spectrogram image when it goes through the LSTM network model.


### 5.3. Efficiency Analysis

Table2 shows the computational complexity analysis of the proposed scheme, where n represents the number of speech files, l is the dimension of speech feature vectors, and DOT(l+3) represents the inner product operation of two (l + 3) vectors. In the stage of constructing the security index table, according to (14), each speech file needs to perform (l + 3) inner product operation of feature vector and reversible matrix, so n(l + 3) inner product operation should be performed, and the computational complexity is n(l + 3) DOT(l+3). Similarly, in the process of the generation of the search trapdoor Tq, due to the fact that the scheme is full-text matching retrieval, its computational complexity is n(l + 3) DOT(l+3) according to (16). When performing speech retrieval, CS needs to execute |W| times vector inner product operation, and its computational complexity is n2(l + 3) DOT(l+3). For the storage overhead, the calculation results are shown in Table 3, where |Zp|, |G0|, and |GT| represent the length of elements, and |Lij| is the number of attributes in the scheme.Table 2
The computational complexity analysis of the proposed scheme.
Secure index buildingSearch trapdoorTq generationSpeech retrievaln(l + 3) DOT(l+3)n(l + 3) DOT(l+3)n2(l + 3) DOT(l+3)Table 3
The storage and communication overhead.
StorageCommunicationSecure indexSearch trapdoorPublic parameterAttribute keyCiphertextCT2n(l + 3)|Zp|2n(l + 3)|Zp|6|G0| + |GT|(2|Lij| + 3)|G0| + |Zp||GT| +( 3l + 2)|G0|2l|Zp|Figure5 shows the performance comparison of encryption time using attribute encryption for original speech data with a different number of attributes and the size of the speech data.Figure 5
Performance comparison of the encryption time. (a) Encryption time under a different number of attributes. (b) Encryption time in different speech data size.
(a)(b)As shown in Figure5(a), the time of key generation increases with the increase of the number of user attributes, while the data encryption and decryption time remain basically unchanged or the decryption time changes in a relatively stable range. It can be seen from Figure 5(b) that as the size of the speech data increases, the time of encryption and decryption is also increasing. Therefore, the scheme proposed in this paper transfers the key generation task to a trusted authority TA; meantime, part of the decryption operation is outsourced to proxy servers, which can effectively reduce the computing time of the users and improve the efficiency of the system.


### 5.4. Evaluation of Retrieval Performance

The recall ratio (R), precision ratio (P), F1 score, and retrieval time are usually used to measure the performance of speech retrieval algorithms. The calculation methods of recall rate R and precision rate P are shown in (27) and (28), respectively.(27)R=TPTP+FN×100%,(28)P=TPTP+FP×100%,where TP is the number of samples in the retrieval results that are related to the query keywords and judged to be positive; FN represents the number of samples that are related to the query keywords but judged to be negative; FP is the number of samples that are not related to the query keywords but judged to be positive.In order to further test the performance of speech retrieval, theF1 score is usually used to evaluate the system performance. The higher the F1 score is, the better the performance is. It can be calculated by (29)F1=2×P×RP+R.Existing studies have shown that the precision-recall (P-R) curve can directly and comprehensively reflect the performance of the speech retrieval scheme. Figure6 shows the comparison results of the P-R curve for the proposed scheme under two different features.Figure 6
Performance evaluation of the proposed scheme. (a) ROC curves and AUC value with different features. (b) P-R curves with different features.
(a)(b)As shown in Figure6(a), the AUC values obtained from the ROC curves with the two different features are 0.81 and 0.89, respectively. The value range is all from 0.5 < AUC < 1, indicating that the proposed LSTM model has good generalization ability, and when MFCC is used as input, the classification effect is more significant. Besides, the area enclosed by the P-R curve and X-Y coordinate axis is larger when the input is MFCC features, as shown in Figure 6(b), so it acquires better retrieval performance. Moreover, because recall R and precision P are mutually affected, the proposed scheme has the greatest influence on precision P when recall R is 1.In the experiment, the paper compares the retrieval performance of the proposed scheme with MFCC and spectral acoustic features as input of the LSTM network model, as shown in Figure6. In the proposed scheme, 20 Mel cepstral coefficients are extracted from each speech frame, the speech spectrogram is produced for each speech frame by using the STFT feature, and the spectrogram image is scaled to 227 × 227 size to reduce the amount of data calculation. During the retrieval stage, 1000 speech fragments from the THCHS-30 database were randomly selected as the speech to be retrieved by authorized users after the operation of MP3 compressed content retention, and the deep semantic features of the speech to be retrieved were extracted as search keywords to execute retrieval operation by using the method in Section 4.2. When performing retrieving, the similarity threshold T is set. It shows that the retrieval is successful if the Euclidean distance dis(q, V) < T between a query keyword and a keyword stored in the secure index I in the cloud, and the similarity threshold T is set as 0.245 in this paper. In order to test the retrieval performance of the proposed scheme, the performance is compared with that of the method in [31, 34]. Table 4 shows the comparison results of retrieval performance between the proposed scheme and the existing schemes.Table 4
The evaluation comparison of retrieval performance.
SchemeMultiuserSecurityP (%)R (%)F1 (%)Retrieval time (s)Ref. [31]Scheme-ADiffie–HellmanAdaptively94.0093.0093.500.139Scheme-BAdaptively83.0084.0083.500.134Ref. [34]Scheme-I−CPA92.0093.0092.500.150Scheme-IICPA93.0092.0092.500.120Our schemeMFCCCP-ABEIND-CPA1001001000.269SpectrogramIND-CPA74.9792.0382.630.274As shown in Table4, the proposed scheme has obtained a higher accuracy, recall rate, and F1 score, indicating that the proposed scheme has good retrieval performance. However, the retrieval efficiency of the proposed scheme is about twice that of [31, 34]. However, when MFCC is used as the input of LSTM, the retrieval accuracy, recall rate, and F1 score all reach 100%; this is because the hash construction was performed, effectively enhancing the retrieval performance. When taking the spectrogram images as input, F1 scores were about 10% lower than those of the two schemes in [34], but the retrieval recall rate is equivalent. Compared with [31], the retrieval accuracy and recall rate of scheme-A are lower than those in [31]; however, compared to scheme-B, the recall rate and F1 score are similar. Therefore, the LSTM network is used as the method of the speech content keyword extraction in this paper with better retrieval performance.


## 5.1. Security Analysis

In this section, based on the DBDH assumption, the security against selected plaintext attacks under the standard model is proved, and an analysis of data and search privacy is conducted.Theorem: challenger B can resolve the DBDH difficulty problem with a nonnegligible advantageε/2, if adversary A can break the proposed scheme with an advantage ε=AdvCPAλ.Proof: challenger B inputs a random DBDH challengeg,gα,gϕ,gθ,H and a random bit σ ∈ {0, 1}; if σ = 0, set H=eg,gαϕθ. Otherwise, if σ = 1, then H is a random value in GT. The interaction between challenger B and adversary A is simulated as follows.Initialization: adversary A chooses the access structureΛ to be challenged that is sent to challenger B and assumes that the trusted authority TA and the proxy server are loyal and will not disclose the attribute key SKDUi.Setup: challenger B sends the public parameterPP and the master key MSK to adversary A.Phase 1: adversary A submits an attribute listLij∈L to challenger B requesting an attribute key SKDUi.Challenge: adversary A submits two equal length original plaintext dataS0 and S1 and randomly selects β ∈ {0, 1} to generate challenged ciphertext C∗=Sβ⋅Hu∏j=1negθ,gyj, C0∗=gθ, and C0∗=gθugθ∑Λti. Finally, challenger B returns the challenged ciphertext CTΛ∗=Λ∗,C∗,C0∗,C1∗ to adversary A.WhenH=eg,gαϕθ, the ciphertext CTΛ∗=Λ∗,C∗,C0∗,C1∗ is the legal ciphertext of the plaintext Sβ. Otherwise, when H is a random value in GT, the ciphertext CTΛ∗ is a random ciphertext.Phase 2: perform the same query as in the key query phase 1.Guess: adversary A guesses a bitβ′∈0,1β′∈0,1; if β' = β, challenger B outputs 0, indicating a guess H=eg,gαϕθ, and then σ = 0. At this time, CTΛ∗ is an available ciphertext, and the advantage of adversary A is ε=AdvCPAλ. Therefore, it can be concluded that(24)PrΒg,gα,gϕ,gθ,eg,gαϕθ=0=12+AdvCPAλ.Otherwise, it outputs 1, which means that the guessH is a random value in GT; that is, σ = 1. At this point, it is completely random for adversary A, and it can acquire(25)PrΒg,gα,gϕ,gθ,H=0=12.Thus, the advantage of challenger B is(26)AdvCPA−Βλ=12PrΒg,gα,gϕ,gθ,eg,gαϕθ=0+12PrΒg,gα,gϕ,gθ,H=0−121212+AdvCPAλ+12⋅12−12=AdvCPAλ2=ε2.Therefore, it can be concluded that the DBDH assumption can be broken with a nonnegligible advantage. The scheme proposed is IND-CPA secure.(1)
The privacy protection of the speech dataIn our scheme, according toC=SFs in (13), using public parameter F encrypts the original data S to obtain the encrypted data C, and only users satisfied with the access policy Λ can decrypt the ciphertext C, effectively preventing illegal users from accessing and acquiring data and improving the security of the data. Even if the malicious user acquires the ciphertext C, according to the attribute key generation (10), the adversary A first needs to solve the discrete logarithm equation skij=Tirij in (11). Due to the difficulty in calculating the discrete logarithm problem, rij cannot be solved.(2)
The privacy protection of the keywordsAccording to (15), the keywords corresponding to each speech file are encrypted with the randomly reversible matrix M−1 and the extended random vector vi′⟶ to hide its content. The encryption result is affected by the reversible matrix M−1 and random numbers Ri and Rj, and these random numbers are indistinguishable. Therefore, the same keyword generates different ciphertext under the same key, and adversary A cannot obtain any information about plaintext from the ciphertext in the polynomial time, which ensures the safety of the keywords.(3)
The privacy protection of the search trapdoorIn the process of generating search trapdoorTq, according to (17), the query user firstly selects random number Ra for each query feature q to construct a random vector q′⟶ and then uses a random matrix M to encrypt the vector to generate search trapdoor Tq. Since Ra and M are indistinguishable, different search trapdoor Tq can be generated for the same query. If adversary A obtains the trapdoor, it cannot get indistinguishable random number Ra and random matrix M from the trapdoor Tq; thus, no information about Q can be acquired that protects the search privacy.


## 5.2. Performance Analysis of the Proposed LSTM Network Model

At present, the method of employing the LSTM network model enabling speech recognition can be used as a keyword extraction approach to solving the issue of speech keyword extraction. Therefore, the proposed scheme uses LSTM deep learning model to extract deep semantic features of speech and evaluates the performance of the model through the pretraining model. Figure4 shows the training/test curve of the LSTM network model under the speech spectrogram and MFCC features.Figure 4
The speech spectrogram and MFCC train/test curve. (a) The train/test loss curve. (b) The train/test accuracy curve.
(a)(b)As shown in Figure4, taking MFCC as input of the LSTM network model has faster convergence, lower loss, and higher accuracy. After 40 iterations of training, its training accuracy is 99.97%, and the test accuracy is 99.28%; meantime, the training and test loss is almost close to 0, and the model is not overfitting. However, when the speech spectrogram is used as the input, its training performance is poor. This is because the speech spectrogram feature contains too much redundant information and has a large dimension, which will cause the loss of the feature information of the spectrogram image when it goes through the LSTM network model.


## 5.3. Efficiency Analysis

Table2 shows the computational complexity analysis of the proposed scheme, where n represents the number of speech files, l is the dimension of speech feature vectors, and DOT(l+3) represents the inner product operation of two (l + 3) vectors. In the stage of constructing the security index table, according to (14), each speech file needs to perform (l + 3) inner product operation of feature vector and reversible matrix, so n(l + 3) inner product operation should be performed, and the computational complexity is n(l + 3) DOT(l+3). Similarly, in the process of the generation of the search trapdoor Tq, due to the fact that the scheme is full-text matching retrieval, its computational complexity is n(l + 3) DOT(l+3) according to (16). When performing speech retrieval, CS needs to execute |W| times vector inner product operation, and its computational complexity is n2(l + 3) DOT(l+3). For the storage overhead, the calculation results are shown in Table 3, where |Zp|, |G0|, and |GT| represent the length of elements, and |Lij| is the number of attributes in the scheme.Table 2
The computational complexity analysis of the proposed scheme.
Secure index buildingSearch trapdoorTq generationSpeech retrievaln(l + 3) DOT(l+3)n(l + 3) DOT(l+3)n2(l + 3) DOT(l+3)Table 3
The storage and communication overhead.
StorageCommunicationSecure indexSearch trapdoorPublic parameterAttribute keyCiphertextCT2n(l + 3)|Zp|2n(l + 3)|Zp|6|G0| + |GT|(2|Lij| + 3)|G0| + |Zp||GT| +( 3l + 2)|G0|2l|Zp|Figure5 shows the performance comparison of encryption time using attribute encryption for original speech data with a different number of attributes and the size of the speech data.Figure 5
Performance comparison of the encryption time. (a) Encryption time under a different number of attributes. (b) Encryption time in different speech data size.
(a)(b)As shown in Figure5(a), the time of key generation increases with the increase of the number of user attributes, while the data encryption and decryption time remain basically unchanged or the decryption time changes in a relatively stable range. It can be seen from Figure 5(b) that as the size of the speech data increases, the time of encryption and decryption is also increasing. Therefore, the scheme proposed in this paper transfers the key generation task to a trusted authority TA; meantime, part of the decryption operation is outsourced to proxy servers, which can effectively reduce the computing time of the users and improve the efficiency of the system.


## 5.4. Evaluation of Retrieval Performance

The recall ratio (R), precision ratio (P), F1 score, and retrieval time are usually used to measure the performance of speech retrieval algorithms. The calculation methods of recall rate R and precision rate P are shown in (27) and (28), respectively.(27)R=TPTP+FN×100%,(28)P=TPTP+FP×100%,where TP is the number of samples in the retrieval results that are related to the query keywords and judged to be positive; FN represents the number of samples that are related to the query keywords but judged to be negative; FP is the number of samples that are not related to the query keywords but judged to be positive.In order to further test the performance of speech retrieval, theF1 score is usually used to evaluate the system performance. The higher the F1 score is, the better the performance is. It can be calculated by (29)F1=2×P×RP+R.Existing studies have shown that the precision-recall (P-R) curve can directly and comprehensively reflect the performance of the speech retrieval scheme. Figure6 shows the comparison results of the P-R curve for the proposed scheme under two different features.Figure 6
Performance evaluation of the proposed scheme. (a) ROC curves and AUC value with different features. (b) P-R curves with different features.
(a)(b)As shown in Figure6(a), the AUC values obtained from the ROC curves with the two different features are 0.81 and 0.89, respectively. The value range is all from 0.5 < AUC < 1, indicating that the proposed LSTM model has good generalization ability, and when MFCC is used as input, the classification effect is more significant. Besides, the area enclosed by the P-R curve and X-Y coordinate axis is larger when the input is MFCC features, as shown in Figure 6(b), so it acquires better retrieval performance. Moreover, because recall R and precision P are mutually affected, the proposed scheme has the greatest influence on precision P when recall R is 1.In the experiment, the paper compares the retrieval performance of the proposed scheme with MFCC and spectral acoustic features as input of the LSTM network model, as shown in Figure6. In the proposed scheme, 20 Mel cepstral coefficients are extracted from each speech frame, the speech spectrogram is produced for each speech frame by using the STFT feature, and the spectrogram image is scaled to 227 × 227 size to reduce the amount of data calculation. During the retrieval stage, 1000 speech fragments from the THCHS-30 database were randomly selected as the speech to be retrieved by authorized users after the operation of MP3 compressed content retention, and the deep semantic features of the speech to be retrieved were extracted as search keywords to execute retrieval operation by using the method in Section 4.2. When performing retrieving, the similarity threshold T is set. It shows that the retrieval is successful if the Euclidean distance dis(q, V) < T between a query keyword and a keyword stored in the secure index I in the cloud, and the similarity threshold T is set as 0.245 in this paper. In order to test the retrieval performance of the proposed scheme, the performance is compared with that of the method in [31, 34]. Table 4 shows the comparison results of retrieval performance between the proposed scheme and the existing schemes.Table 4
The evaluation comparison of retrieval performance.
SchemeMultiuserSecurityP (%)R (%)F1 (%)Retrieval time (s)Ref. [31]Scheme-ADiffie–HellmanAdaptively94.0093.0093.500.139Scheme-BAdaptively83.0084.0083.500.134Ref. [34]Scheme-I−CPA92.0093.0092.500.150Scheme-IICPA93.0092.0092.500.120Our schemeMFCCCP-ABEIND-CPA1001001000.269SpectrogramIND-CPA74.9792.0382.630.274As shown in Table4, the proposed scheme has obtained a higher accuracy, recall rate, and F1 score, indicating that the proposed scheme has good retrieval performance. However, the retrieval efficiency of the proposed scheme is about twice that of [31, 34]. However, when MFCC is used as the input of LSTM, the retrieval accuracy, recall rate, and F1 score all reach 100%; this is because the hash construction was performed, effectively enhancing the retrieval performance. When taking the spectrogram images as input, F1 scores were about 10% lower than those of the two schemes in [34], but the retrieval recall rate is equivalent. Compared with [31], the retrieval accuracy and recall rate of scheme-A are lower than those in [31]; however, compared to scheme-B, the recall rate and F1 score are similar. Therefore, the LSTM network is used as the method of the speech content keyword extraction in this paper with better retrieval performance.


## 6. Conclusions

This paper proposes an encrypted speech retrieval scheme based on multiuser searchable encryption in cloud storage, which not only can solve the issue of privacy disclosure and secure speech data sharing for multiple users in the process of the encrypted speech retrieval in cloud storage but also realizes the efficient and secure retrieval of massive encrypted speech and employs LSTM network model to extract deep semantic features that further improve the retrieval accuracy and recall rate. In order to enhance the security of speech data and achieve access control between users, the CP-ABE scheme is adopted to protect the privacy of the data and realize fine-grained access control of multiple users. A privacy-preserving encrypted speech retrieval is realized by encrypting speech features with a random matrix and matching retrieval with Euclidian distance after hiding keywords content. The security analysis and experimental results indicate that the proposed scheme can satisfy the indistinguishability of the index and trapdoor information, has higher retrieval performance, and also proves that the scheme chooses security under the chosen plaintext attack based on the DBDH assumption.In future work, we plan to focus on the research of the ciphertext location leakage and efficient encrypted speech retrieval scheme supporting fuzzy keyword query.



---

*Source: 9045259-2022-03-30.xml*