Design of Searchable Encryption with Refreshing Keyword Search Using Pairing-Based Cryptography
| dc.contributor.advisor | Minale Ashagrie | |
| dc.contributor.author | Kuma Bekele | |
| dc.date.accessioned | 2025-08-17T22:16:36Z | |
| dc.date.available | 2025-08-17T22:16:36Z | |
| dc.date.issued | 2024-10 | |
| dc.description.abstract | To maintain data security and privacy, the Public Key Encryptions with Keyword Search (PEKS) scheme has been implemented. They offer search capabilities for encrypted data. However, because the Key Generating Center (KGC) knows the target users' private key, the existing PEKS schemes are vulnerable to key-escrow issues. The Certificate-Less Public Key Encryptions with Keyword Search (CL-PEKS) scheme was created to address the key escrow problem in PEKS schemes. However, refreshing keyword searches are not considered by the CL-PEKS schemes that are currently existing. As a result, the target server can launch keyword-guessing attacks and store search trapdoors for system keywords. By appending date information to the encrypted data and keyword, we proposed the certificate-less based Searchable Encryption with a Refreshing Keyword Search (SERKS) scheme. We designed the system model and algorithms for the proposed certificate-less based SERKS using pairing-based cryptography. We also developed its prototype in the case of a web-based e-mail system by using Java Pairing-Based Cryptography (JPBC) library. The security hardness of the proposed scheme is based on the hardness of the Bilinear Diffie-Hellman (BDH) problem assumption. We assessed the suggested scheme's performance with respect to time complexity in terms of both communication and computational costs. The experimental results demonstrate that the suggested SERKS scheme has a lower computational cost than the two related schemes during the key generation and testing phases when compared to the earlier related work. Additionally, it has lower communication costs. | |
| dc.identifier.uri | https://etd.aau.edu.et/handle/123456789/6895 | |
| dc.language.iso | en_US | |
| dc.publisher | Addis Ababa University | |
| dc.subject | Searchable Encryption | |
| dc.subject | Refreshing Keyword Search | |
| dc.subject | Pairing-Based Cryptography | |
| dc.subject | Search Trapdoor | |
| dc.subject | Keyword Guessing Attack | |
| dc.title | Design of Searchable Encryption with Refreshing Keyword Search Using Pairing-Based Cryptography | |
| dc.type | Thesis |