Researcher:
Esiner, Ertem

Profile Picture
ORCID

Job Title

Master Student

First Name

Ertem

Last Name

Esiner

Name

Name Variants

Esiner, Ertem

Email Address

Birth Date

Filters

2012 - 20164

Advanced Search

Filter by

Settings

Researcher Of Publications: search.filters.isAuthorOfPublication.e502743d-3c15-4540-bcab-5e6861b08672

Search Results

Now showing 1 - 4 of 4
  • Placeholder
    PublicationMetadata only
    FlexDPDP: flexlist-based optimized dynamic provable data possession
    (assoc Computing Machinery, 2016) N/A; N/A; N/A; Department of Computer Engineering; Department of Computer Engineering; Department of Computer Engineering; Esiner, Ertem; Kachkeev, Adilet; Küpçü, Alptekin; Özkasap, Öznur; Master Student; Master Student; N/A; Faculty Member; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; Graduate School of Sciences and Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; N/A; N/A; N/A; 168060; 113507
    With increasing popularity of cloud storage, efficiently proving the integrity of data stored on an untrusted server has become significant. authenticated skip lists and rank-based authenticated skip lists (RBaSL) have been used to provide support for provable data update operations in cloud storage. However, in a dynamic file scenario, An RBaSL based on block indices falls short when updates are not proportional to a fixed block size; such an update to the file, even if small, may result in O(n) updates on the data structure for a file with n blocks. To overcome this problem, we introduce FlexList, A flexible length-based authenticated skip list. FlexList translates variable-size updates to O(inverted right perpendicularu/Binverted left perpendicular) insertions, removals, or modifications, where u is the size of the update and B is the (average) block size. We further present various optimizations on the four types of skip lists (regular, Authenticated, rank-based authenticated, and FlexList). We build such a structure in O(n) time and parallelize this operation for the first time. We compute one single proof to answer multiple (non) membership queries and obtain efficiency gains of 35%, 35%, and 40% in terms of proof time, energy, and size, respectively. We propose a method of handling multiple updates at once, Achieving efficiency gains of up to 60% at the server side and 90% at the client side. We also deployed our implementation of FlexDPDP (dynamic provable data possession (DPDP) with FlexList instead of RBaSL) on PlanetLab, demonstrating that FlexDPDP performs comparable to the most efficient static storage scheme (provable data possession (PDP)) while providing dynamic data support.
  • Placeholder
    PublicationMetadata only
    Energy cost model for frequent item set discovery in unstructured P2P networks
    (Springer, 2012) Demirkaya, Ender; N/A; N/A; N/A; Department of Computer Engineering; Çem, Emrah; Esiner, Ertem; Özaydın, Burak; Özkasap, Öznur; PhD Student; Master Student; Master Student; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; Graduate School of Sciences and Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; N/A; N/A; 113507
    For large scale distributed systems, designing energy efficient protocols and services has become as significant as considering conventional performance criteria like scalability, reliability, fault-tolerance and security. We consider frequent item set discovery problem in this context. Although it has attracted attention due to its extensive applicability in diverse areas, there is no prior work on energy cost model for such distributed protocols. In this paper, we develop an energy cost model for frequent item set discovery in unstructured P2P networks. To the best of our knowledge, this is the first study that proposes an energy cost model for a generic peer using gossip-based communication. As a case study protocol, we use our gossip-based approach ProFID for frequent item set discovery. After developing the energy cost model, we examine the effect of protocol parameters on energy consumption using our simulation model on PeerSim and compare push pull method of ProFID with the well-known push-based gossiping approach. Based on the analysis results, we reformulate the upper bound for the peer's energy cost.
  • Placeholder
    PublicationMetadata only
    Analysis and pptimization on FlexDPDP: a practical solution for dynamic provable data possession
    (Springer-Verlag Berlin, 2015) N/A; Department of Computer Engineering; Department of Computer Engineering; Esiner, Ertem; Küpçü, Alptekin; Özkasap, Öznur; Master Student; Faculty Member; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; N/A; 168060; 113507
    Security measures, such as proving data integrity, became more important with the increase in popularity of cloud data storage services. Dynamic Provable Data Possession (DPDP) was proposed in the literature to enable the cloud server to prove to the client that her data is kept intact, even in a dynamic setting where the client may update her files. Realizing that variable-sized updates are very inefficient in DPDP (in the worst case leading to uploading the whole file again), Flexible DPDP (FlexDPDP) was proposed. In this paper, we analyze FlexDPDP scheme and propose optimized algorithms. We show that the initial pre-processing phase at the client and server sides during the file upload (generally the most time-consuming operation) can be efficiently performed by parallelization techniques that result in a speed up of 6 with 8 cores. We propose a way of handling multiple updates at once both at the server and the client side, achieving an efficiency gain of 60% at the server side and 90% in terms of the client's update verification time. We deployed the optimized FlexDPDP on the large-scale network testbed PlanetLab and demonstrate the efficiency of our proposed optimizations on multi-client scenarios according to real workloads based on version control system traces.
  • Placeholder
    PublicationMetadata only
    Energy efficiency in secure and dynamic cloud storage
    (Springer-Verlag Berlin, 2013) N/A; N/A; N/A; Department of Computer Engineering; Department of Computer Engineering; Kachkeev, Adilet; Esiner, Ertem; Küpçü, Alptekin; Özkasap, Öznur; Master Student; Master Student; Faculty Member; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; Department of Computer Engineering; N/A; N/A; 168060; 113507
    The popularity of the cloud storage systems has brought a number of challenges. Two of them are data integrity and energy efficiency. There are many proposed static solutions to prove the integrity of a file. For the dynamic case, Rank-Based Authenticated Skip list (RBASL) has been presented. It provides the update operations with logarithmic complexity. However, an RBASL expects the block size to be fixed. In a realistic scenario, where the updates can be of variable size, an RBASL performs O(n) update operations on the data structure when a change in the file occurs, where n is the number of blocks. To overcome this problem, we propose Flexible-length based authenticated skip list (FlexList) to make O(u) update operations where u is the number of the update operations. Moreover, we developed an algorithm to carry out multiple challenges at once. We have tested our algorithm, and the results show time and energy efficiencies of 60%, 45%, 35% and 20% for file sizes 4MB, 40MB, 400MB, and 4GB respectively.