Dynamic Verifiable Encrypted Keyword Search Using Bitmap Index and Homomorphic MAC

Ramasamy, Rajkumar; Vivek, S. Sree; George, Praveen; Kshatriya, Bharat S. Rawal

doi:10.1109/cscloud.2017.47

Cited by 8 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Currently, recall (R), precision (P) and F1 score are also commonly used to evaluate the performance and quality of network models, and the calculation formula is shown in Eqs. (16)(17)(18). Table 3 shows the comparison of P, R and F1 scores of CNN-BiGRU models under different CPOs (Re-sampling, MP3 compression, Amplitude increase, Amplitude decrease, and Add noise).…”

Section: Speech Retrieval Performance Analysismentioning

confidence: 99%

“…Kalapaaking et al [16] proposed a global model verification method based on blockchain multi-signature and stored the signature in the blockchain to prevent tampering. Ramasamy et al [17] designed a new homomorphic MAC to provide a dynamic, verifiable, high-security keyword retrieval scheme. Li et al [18] proposed a SE scheme under multi-user conditions, combining smart contracts to reduce the verification cost.…”

Section: Related Workmentioning

confidence: 99%

“…However, some malicious cloud servers still access, leak, and maliciously tamper with without authorization, so it is necessary to verify the correctness of the returned results [13]. To avoid users forging verification results due to economic interests, resulting in a lack of fairness in verification, the non-tamperability of blockchain can be exploited [14] to ensure data integrity based on verifiable algorithms [15][16][17]. In addition, combining blockchain and smart contracts [18][19][20] is more suitable for achieving retrieval result verification in SE algorithms, making retrieval operations more efficient and ensuring the reliability and fairness of verification [21].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Multi-User and multi-keyword verifiable encrypted speech retrieval method based on blockchain

Li,

Zhang,

Huang

et al. 2023

Preprint

View full text Add to dashboard Cite

Aiming at the existing encrypted speech retrieval schemes that do not support multi-user multi-keyword retrieval, low retrieval efficiency and accuracy, lack of verifiability of encrypted speech retrieval results, and user fairness, a multi-user and multi-keyword verifiable encrypted speech retrieval method based on blockchain was proposed. Firstly, use the advanced encryption standard-128 (AES-128) to encrypt the speech and upload it to the cloud server. Secondly, the Mel-frequency cepstral coefficient (MFCC) and Filter bank (Fbank) speech features are extracted and fused into new MFCC-Fbank features, which are input into the designed CNN-BiGRU model for training. These features are used to extract more robust deep features to construct hash codes and are used as searchable encrypted keywords. Finally, use smart contracts to store encrypted speech hash codes and corresponding index values and manage multi-user keys through trusted institutions. When retrieval, smart contracts are used as trusted third parties for retrieval work, and the designed adaptive homomorphic Message Authentication Code (MAC) algorithm is used to verify the correctness of the retrieval results, ensuring fairness in verification and data privacy. The experimental results show that the proposed method effectively prevents user privacy leakage and improves encrypted speech retrieval accuracy and data security under multi-user and multi-keyword conditions.

show abstract

Section: Speech Retrieval Performance Analysismentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multi-User and multi-keyword verifiable encrypted speech retrieval method based on blockchain

Li,

Zhang,

Huang

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Sardar et al [12] used a bilinear digital signature based on a dynamic SSE scheme to achieve forward security and public verifiability. Ramasamy et al [13] used the bitmap index and homomorphic MAC to dynamically update the documents and verify search results without leaking the access pattern. However, most of the existing verifiable searchable encryption schemes only focus on detecting malicious behavior, but lack a mechanism to punish dishonest performers.…”

Section: B Related Workmentioning

confidence: 99%

Blockchain-Based Searchable Encryption Scheme With Fair Payment

Yan

Yuan

et al. 2020

IEEE Access

View full text Add to dashboard Cite

In order to solve the problem that most of the existing blockchain-based searchable encryption schemes only support exact keyword search and mutual distrust between the cloud server and the user, a searchable encryption scheme based on blockchain, that has functions such as file update dynamically, search results verification, fuzzy keyword search, and fair payment, is proposed. We use edit distance to generate the fuzzy keywords set. According to the un-modification characteristic of Ethereum blockchain and the security of the RSA accumulator, our scheme can verify the search results by the smart contract and realize the service-payment fairness between the user and the cloud server. The security analysis shows that the proposed scheme achieves non-adaptive semantic security. Performance analysis and experiment show that our scheme is efficient and meets the demand of search application in the cloud environment. INDEX TERMS Ethereum blockchain, fuzzy keyword search, fair payment, searchable encryption.

show abstract

“…Subsequently, their scheme was implemented in the network coding‐enabled wireless networks [16], as well as P2P live streaming systems [32]. Recent investigations on homomorphic MAC can be also found in [33–35] etc. Although homomorphic MACs are more computationally efficient than homomorphic hashes, they still have several significant weaknesses, including larger bandwidth overhead and the key distribution and management problem.…”

Section: Related Workmentioning

confidence: 99%

Defending pollution attacks in network coding enabled wireless ad hoc networks: a game‐theoretic framework

Liu

Huang

Yao³

et al. 2020

IET Communications

View full text Add to dashboard Cite

Dynamic Verifiable Encrypted Keyword Search Using Bitmap Index and Homomorphic MAC

Cited by 8 publications

References 9 publications

Multi-User and multi-keyword verifiable encrypted speech retrieval method based on blockchain

Multi-User and multi-keyword verifiable encrypted speech retrieval method based on blockchain

Blockchain-Based Searchable Encryption Scheme With Fair Payment

Defending pollution attacks in network coding enabled wireless ad hoc networks: a game‐theoretic framework

Contact Info

Product

Resources

About