Şahin, Serap
Loading...
Profile URL
Name Variants
Şahin, S.
Sahin, Serap
Şahin, S
Sahin, S.
Sahin, S
Atay, Serap
Atay, S:
Sahin, Serap
Şahin, S
Sahin, S.
Sahin, S
Atay, Serap
Atay, S:
Job Title
Email Address
serapsahin@iyte.edu.tr
Main Affiliation
03.04. Department of Computer Engineering
Status
Former Staff
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Sustainable Development Goals
1NO POVERTY
1
Research Products
2ZERO HUNGER
0
Research Products
3GOOD HEALTH AND WELL-BEING
0
Research Products
4QUALITY EDUCATION
1
Research Products
5GENDER EQUALITY
0
Research Products
6CLEAN WATER AND SANITATION
0
Research Products
7AFFORDABLE AND CLEAN ENERGY
0
Research Products
8DECENT WORK AND ECONOMIC GROWTH
0
Research Products
9INDUSTRY, INNOVATION AND INFRASTRUCTURE
11
Research Products
10REDUCED INEQUALITIES
0
Research Products
11SUSTAINABLE CITIES AND COMMUNITIES
0
Research Products
12RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
13CLIMATE ACTION
0
Research Products
14LIFE BELOW WATER
1
Research Products
15LIFE ON LAND
0
Research Products
16PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
17PARTNERSHIPS FOR THE GOALS
0
Research Products
Documents
4
Citations
14
h-index
2
This researcher does not have a WoS ID.
Scholarly Output
33
Articles
7
Views / Downloads
141591/26175
Supervised MSc Theses
8
Supervised PhD Theses
1
WoS Citation Count
62
Scopus Citation Count
101
Patents
0
Projects
3
WoS Citations per Publication
1.88
Scopus Citations per Publication
3.06
Open Access Source
32
Supervised Theses
9
| Journal | Count |
|---|---|
| International Journal of Information Security Science | 2 |
| Turkish Journal of Electrical Engineering and Computer Sciences | 2 |
| Scientific Data | 2 |
| Information Security Technical Report | 1 |
| International Conference on Hybrid Information Technology, ICHIT 2006 | 1 |
Current Page: 1 / 3
Scopus Quartile Distribution
Competency Cloud
33 results
Scholarly Output Search Results
Now showing 1 - 10 of 33
Master Thesis Matching of Social Media Accounts by Using Public Information(Izmir Institute of Technology, 2016) Çetinkal, Yağız; Şahin, Serap; Şahin, SerapProtection of private information on social networks (SNs) has become a serious and important topic since social network sites became popular and widely adopted worldwide. Usually people want their personal information to be known only by a small group of people including close friends and families. But sometimes they willingly accept to give some particular information about themselves to individuals which are neither a friend nor an acquaintance. Each SN has different purposes and people subscribe many of them. However, public information available on these sites reveals many aspects of user’s identity. In this work, it is shown that public information can be used to detect the different accounts of the same individual. This study is performed on two popular social media sites: Twitter and Facebook. Public attributes of the profiles such as real name, user name and status updates (tweets and posts) are used for comparing profiles on two SNs. Different data mining algorithms are compared for matching profiles. Also relationship between text similarity and total term counts of status updates is analyzed. Results show that simple features like real names, user names and status updates have high similarity between the accounts of the same users and these features can be used to detect profiles of the same user on different SNs. Also the more status updates a user posts on Facebook the more he will likely be detected by the matching schema. Thus, public information can be exploited to pose a threat to the privacy of the people on the Internet.Correction Database Covering the Prayer Movements Which Were Not Available Previously (Vol 10, 276, 2023)(Nature Portfolio, 2025) Mihcin, Senay; Sahin, Ahmet Mert; Yilmaz, Mehmet; Alpkaya, Alican Tuncay; Tuna, Merve; Akdeniz, Sevinc; Sahin, SerapDoctoral Thesis Tracking and Prediction of Evolution of Communities in Dynamic Networks(01. Izmir Institute of Technology, 2021) Karataş, Arzum; Karataş, Arzum; Şahin, Serap; Şahin, SerapCommunities are the most meaningful structures in dynamic networks. Tracking this evolution provides insights into the patterns of community evolution in networks over time and valuable information for decision support systems in many research areas such as marketing, recommender systems, and criminology. Previous work has focused on either high accuracy or time efficiency, but not on low memory consumption. This motivates us to develop a method that combines highly accurate tracking results with low computational resources. This dissertation first provides a brief overview of research in dynamic network analysis. Then, a novel space-efficient method, called TREC, for tracking the evolution of communities in dynamic networks is presented, where community matching using LSH with minhasing technique is proposed to efficiently track similar communities in terms of memory consumption over time. The accuracy of TREC is evaluated on benchmark datasets, and the execution time performance is measured on real dynamic datasets. In addition, a comparative algorithmic complexity analysis of TREC in terms of space and time is performed. Both theoretical and experimental results show that TREC outperforms competitor methods on both datasets in terms of combination of space, accuracy, and execution time. Next, it is investigated that whether the TREC method is suitable for predicting the evolution of community areas. In this evaluation, a prediction study is conducted. A common methodology is followed which includes main steps such as feature extraction, feature selection, classifier training and cross validation. Experimental results show that TREC method is suitable for predicting evolution of communities.Conference Object Citation - WoS: 38Citation - Scopus: 57Application Areas of Community Detection: a Review(Institute of Electrical and Electronics Engineers Inc., 2019) Karatas, A.; Sahin, S.In the realm of today's real world, information systems are represented by complex networks. Complex networks contain a community structure inherently. Community is a set of members strongly connected within members and loosely connected with the rest of the network. Community detection is the task of revealing inherent community structure. Since the networks can be either static or dynamic, community detection can be done on both static and dynamic networks as well. In this study, we have talked about taxonomy of community detection methods with their shortages. Then we examine and categorize application areas of community detection in the realm of nature of complex networks (i.e., static or dynamic) by including sub areas of criminology such as fraud detection, criminal identification, criminal activity detection and bot detection. This paper provides a hot review and quick start for researchers and developers in community detection area. © 2018 IEEE.Conference Object Edu-Voting: an Educational Homomorphic E-Voting System(Karabük Üniversitesi, 2018) Tekin, Leyla; Özgür, Hüseyin Güven; Sayin, Burcu; Karataş, Arzum; Şenkula, Pelin; İrtem, Emre; Şahin, SerapAs an instrument of democracy, voting is a critical issue. Although paper-based voting systems are still used commonly, e-voting systems have started to substitute under favor of improvements in the technology. This situation gives rise to need for secure, reliable, and transparent e-voting systems to make people trust. To do this, there are some security requirements that should be concerned and satisfied such as privacy, fairness, verifiability etc. This study has an educational intuition that analyzes those requirements, theoretical background information related to cryptographic schemes behind them and creates a place-based e-voting design which was implemented for kiosk voting. As a contribution, Paillier homomorphic cryptosystem is used in our system. Moreover, our study includes a detailed criticism for the implemented system in terms of chosen cryptosystems and design modules with security and e-voting requirements.Master Thesis Analysing the Encrypted Search Algorithms on Encrypted Data(Izmir Institute of Technology, 2018) Tekin, Leyla; Şahin, Serap; Şahin, SerapIn this thesis, we study the static and dynamic Searchable Symmetric Encryption (SSE) schemes (Cash et al. (2014), Kamara and Moataz (2017)). We present different approaches for secure single- and multi-keyword ranked searches, that are: Sorted, OPEBased, Paillier-Based, Embedded, and Matrix-Based. We extend the base schemes according to these approaches so that the matching documents of a search query are ranked by a relevance score calculation technique like term frequency (tf), term frequency-inverse document frequency (tf-idf) or keyword frequency, depending on the characteristics of the scheme. For this, the existing structures of the schemes are modified since they cannot be directly used for ranked searches. Therefore, the ranking facility is added to them. Further, Matrix-Based Approach is a new hybrid approach that is based on an updated structure of the static scheme (Cash et al. (2014)) and fills a matrix to rank the relevant documents for a search keyword, as in the work (Ibrahim et al. (2012)), however, computing the matrix is totally different from their work.Article Comparison of Group Key Establishment Protocols(Türkiye Klinikleri Journal of Medical Sciences, 2017) Şahin, Serap; Aslanoğlu, RabiaRecently group-oriented applications over unsecure open networks such as Internet or wireless networks have become very popular. Thus, group communication security over unsecure open networks has become a vital concern. Group key establishment (GKE) protocols are used to satisfy the confidentiality requirement of a newly started communication session by the generation or sharing of an ephemeral common key between the group members. In this study, we analyze the computation and communication efficiency of GKE protocols. Besides confidentiality, the security characteristics of identification and integrity control are also required for all steps of the protocol implementations. Thus, the main contribution of this work is to provide the computation and communication efficiency analysis of the same GKE protocols along with the identification of the group entities and integrity control of messages during the protocol steps. The specific implementation and analysis of GKE protocols are performed by group key agreement (GKA) with pairing- based cryptography and group key distribution (GKD) with verifiable secret sharing, respectively. Finally, a comparison of GKA and GKD protocols on the basis of their strong points and cost characteristics are also provided to inform potential users.Conference Object Citation - Scopus: 2A Comparative Study of Modularity-Based Community Detection Methods for Online Social Networks(CEUR Workshop Proceedings, 2018) Karataş, Arzum; Şahin, SerapDigital data represent our daily activities and tendencies. One of its main source is Online Social Networks (OSN) such as Facebook, YouTube etc. OSN are generating continuously high volume of data and define a dynamic virtual environment. This environment is mostly represented by graphs. Analysis of OSN data (i.e.,extracting any kind of relations and tendencies) defines valuable information for economic, socio-cultural and politic decisions. Community detection is important to analyze and understand underlying structure and tendencies of OSNs. When this information can be analysed successfully, software engineering tools and decision support systems can produce more successful results for end users. In this study, we present a survey of selected outstanding modularity-based static community detection algorithms and do comparative analysis among them in terms of modularity, running time and accuracy. We use different real-world OSN test beds selected from SNAP dataset collection such as Facebook Ego network, Facebook Pages network (Facebook gemsec), LiveJournal, Orkut and YouTube networks.Article Privacy Issues on Social Networks(Gazi Üniversitesi, 2018) Şahin, SerapThe 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.Master Thesis The Realization of a Blockchain-Based E-Voting Solution With a New Consensus Algorithm(01. Izmir Institute of Technology, 2022) Karaçay, Mustafa; Şahin, SerapSecurity and transparency issues in the paper-based voting system and technological advances popularized e-voting systems. Many academic research and industrial solutions have recently been proposed, designed, and implemented with a Homomorphic Cryptography Scheme or HTTPS. However, there is a new popular player in the game which is called blockchain technology. This study analyzes the requirements of a welldesigned e-voting system and the technology behind the blockchain, and proposes an e-voting system with a novel consensus algorithm. Different strategies are designed and implemented to satisfy all requirements. First, RSA and Paillier Homomorphic Cryptosystem are applied to meet requirements such as individual verifiability, secrecy, etc. So that no one can modify the vote; however, any voter can verify his/her vote during the whole vote period. Second, different blockchains are used to meet requirements such as eligibility, privacy, authentication, etc. So that the system detects whether the data is coming from an eligible or a non-eligible voter. The system ensures that votes and voters can not be correlated if it is an eligible voter. So, the privacy of eligible voters is always protected. Third, our blockchains ensure Consensus throughout the voting process. Fully replicated, distributed, transparent, and secure blockchains ensure that everything is under control. Fourth, internal control mechanisms are applied to meet requirements such as nonreusability, coercion-resistance, etc. So that eligible voters can cast just one vote within the specified period. The system keeps every sensitive data encrypted so that no one manipulates the results before the vote ends.