To overcome this problem, we introduce FlexList: Flexible Length-Based Authenticated Skip List. FlexList translates variable-size updates to O(u/B) 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 (DPDP with FlexList instead of RBASL) on the PlanetLab, demonstrating that FlexDPDP performs comparable to the most efficient static storage scheme (PDP), while providing dynamic data support.
Category / Keywords: implementation / cloud storage, skip list, authenticated dictionary, provable data possession, data integrity Date: received 8 Oct 2013, last revised 9 Feb 2015 Contact author: akupcu at ku edu tr Available format(s): PDF | BibTeX Citation Note: Extended version with full pseudocode and comparison with PDP and DPDP. Version: 20150210:064013 (All versions of this report) Short URL: ia.cr/2013/645 Discussion forum: Show discussion | Start new discussion