Computer Engineering / Bilgisayar Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/10
Browse
2 results
Search Results
Article Implementation and Evaluation of Improved Secure Index Scheme Using Standard and Counting Bloom Filters(Gazi Üniversitesi, 2017) Tekin, Leyla; Şahin, Serap; Şahin, Serap; 03.04. Department of Computer Engineering; 03. Faculty of Engineering; 01. Izmir Institute of TechnologyThis paper presents an improved Secure Index scheme as a searchable symmetric encryption technique and provides a solution that enables a secure and efficient data storage and retrieval system. Secure Index scheme, conceived by Goh, is based on standard Bloom filters (SBFs). Knowledge of the limitations of SBFs, such as handling insertions but not deletions, helps in understanding the advantages of counting Bloom filters (CBFs). Thus, we have extended this scheme by adding a new algorithm so that CBFs can also be applicable. Unlike the old scheme, our scheme can handle dynamic update of a document by updating the existing index without rebuilding it. Moreover, we give a complementary comparison of both filters in our scheme. Finally, a detailed performance evaluation shows that our scheme exhibits similar performance with regard to the query overhead and the false positive probability and is quite efficient than the old scheme with regard to the update overhead by allocating more space.Article Privacy Issues on Social Networks(Gazi Üniversitesi, 2018) Şahin, Serap; Şahin, Serap; 03.04. Department of Computer Engineering; 03. Faculty of Engineering; 01. Izmir Institute of TechnologyThe privacy is a need for humanity since the creation of civilizations. In social networks the common point is that each user has to create a profile to define his or her own identity. The profile description includes many items with privacy settings to tune their visibility degrees for only owner, friends, friends of friends and sometimes for public. After enrolment stage, users extend their social connection graphs with accepted new friends and these graphs grow without the control of individual due to the new friends of friends. Hence, with high probability, the shared information of member is generally available to public and can be retrieved by users around the world. This article is prepared to give an overview on the reasons of privacy concerns and risks of SNs, and summarize the current and future possible solution directions for researchers and governments.