Computer Engineering / Bilgisayar Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/10
Browse
2 results
Search Results
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.Article Implementation and Evaluation of Improved Secure Index Scheme Using Standard and Counting Bloom Filters(Gazi Üniversitesi, 2017) Tekin, Leyla; Şahin, SerapThis 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.