مواقع التدريسيينجامعة الكوفة
فيروز مشتاق جعفر شيرعلي
أستاذ

فيروز مشتاق جعفر شيرعلي

English Version
0بحث منشور
0محاضرة

الملف الشخصي

- اعمل كتدريسية في علوم الحاسبات في جامعه الكوفة. منذ 1995
- حاصلة على شهادة البكالوريوس في علوم الحاسبات من جامعة بابل عام 1995
- حاصلة على شهادة الماجستير في علوم الحاسبات من جامعة بابل عام 2010
- حاصلة على شهادة الدكتوراه في أمن المعلومات من جامعة خواجون/ الصين عام 2017
تخصصي الدقيق في التشفير التطبيقي، وترتبط بحوثي بالقضايا المهمة التي تخص الخصوصية والأمن السيبراني. تركيزي الأساسي هو علي تصميم وتحليل خوارزميات مشفره ، والتي هي خوارزميات فعاله تعمل على البيانات المشفرة في الحوسبة الضبابية وادارة البيانات.

البحوث المنشورة

2
2017

Searchable Encryption with Conjunctive Field Free Keyword Search Scheme

الباحثونDr. Fairouz Sherali، Dr. Song Feng Lu
المجلةIEEE
مختصر البحث

Abstract—Prior Searchable Symmetric Encryption (SSE) works focus on single keyword search. Conjunctive Keyword Searches (CKS) schemes enhance system usability by retrieving the matching files. Most of existing conjunctive keyword works that use conjunctive keyword searches with fixed position keyword fields are not useful for many applications, such as the body of e-mail and unstructured text. The recipients have to repeatedly perform the search protocol for many times. In our paper, we propose a new symmetric key encryption scheme which supports a keyword field free method for conjunctive keyword search on encrypted file without needing to specify the positions of the keywords where the keywords can be in any arbitrary order. In this scheme, the recipients can give the server one trapdoor for multi keywords. In other words, the proposed method will retrieve the data in one round of communication between the recipients and server, and the search process could not leak any information about the number of keywords in query. Furthermore, we introduced an efficient secure index construction based on pseudorandom functions and Bloom filters. Through analysis section, we determine how such scheme could be used to guarantee fast, low storage overhead and secure access to the database.

2016

Symmetric Key Encryption with Conjunctive Field Free Keyword Search Scheme

الباحثونFairouz Sherali، Song Feng Lu
المجلةBritish Journal of Mathematics & Computer Science
مختصر البحث

Searchable symmetric encryption (SSE) enables a sender to outsource the encrypted files to a cloud server, while maintaining the ability to conditionally search over it without knowing the sensitive data contents. Prior work in this area has focused on single keyword search. Conjunctive Keyword Searches (CKS) schemes improve system usability by retrieving the matched files, but in this type of search the receiver has to provide the server with a trapdoor for every individual keyword in the conjunction and rely on an intersection protocol to retrieve the correct set of files, in other words the receiver has to repeatedly perform the search protocol for many times based on the number of keywords in the conjunction. Most of the existing (CKS) schemes use conjunctive keyword searches with fixed position keyword fields, this type of search is not applicable for many real applications, such as the database text and the body of e-mail. In this paper, we propose a new trapdoor-indistinguishable symmetric key encryption with conjunctive keyword search, which does not need to specify the positions of the keywords. Instead of giving the server one trapdoor for each keyword in the conjunction set, the recipient give it a trapdoor for multiple keywords in the conjunction set to search on encrypted files. Furthermore, the search process could not reveal any information about the number of keywords in the query expression. Our proposed scheme is proven secure against chosen-keyword attacks under the Decisional Diffie-Hellman(DDH) assumption in the random oracle model.

المحاضرات

9
عرض التفاصيل