الفهرس | Only 14 pages are availabe for public view |
Abstract As a result of cloud computing revolution, different business organizations may start thinking for adopting cloud services. The adoption of cloud services faces different challenges and risks. The main goal is to effectively adopt the cloud services that meet business goals with assurance of service availability and security. Many organizations utilize storage as a service in cloud, but they are facing important challenge which is preserving the privacy of the data. As the data stored in cloud is out of control of the data’ owner, so data should be encrypted before outsourcing to cloud to ensure its privacy, to overcome the challenge and achieve required goals. This thesis presents a searchable encryption approach. Where, searchable encryption is a new concept used to keep privacy while storing data in an un-trusted third party. This approach can be used in a lot of applications such as mail servers, files systems, data bases management, etc. Searchable encryption consists on storing encrypted data (documents, mails, OS files, etc), retrieving it without any leak of information and keeping anonymity while retaining information confidentiality. The proposed scheme in this thesis aims to enhance the data indexing, which leads to a better information retrieval over encrypted data. The construction time and searching time are the evaluation measures that measure the performance of the proposed index. Then the proposed approach is compared with other index structure approaches. Setup, Create Index, Trapdoor, and Searching over encrypted data are the main processes which are performed by the proposed approach. In the setup process, a secret key is created to be used to encrypt the index. This process is used only in the first time at system’ initialization. In the Create Index process the dataset files are processed to obtain the index for these datasets. The resulted index contains all words in files in the dataset. In the Trapdoor process generates encrypted keyword corresponding to specific keyword search. In the searching process, the index is traversed to find the files contain the keyword search. The results reveal that, the proposed algorithm introduces better performance than the previous algorithms regard to the search time which consumes less time than other algorithms. However, it is a construction time slightly exceeds other known algorithms. |