Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures

TitleTime and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Publication TypeBook Chapters
Year of Publication2007
AuthorsPapamanthou C, Tamassia R
EditorQing S, Imai H, Wang G
Book TitleInformation and Communications Security
Series TitleLecture Notes in Computer Science
Pagination1 - 15
PublisherSpringer Berlin Heidelberg
ISBN Number978-3-540-77047-3, 978-3-540-77048-0
KeywordsAlgorithm Analysis and Problem Complexity, Computer Communication Networks, computers and society, Data Encryption, Management of Computing and Information Systems, Systems and Data Security

Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in database outsourcing, a client’s database is stored and maintained by an untrusted server. Also, in simple storage systems, clients can store very large amounts of data but at the same time, they want to assure their integrity when they retrieve them. In this paper, we present a model and protocol for two-party authentication of data structures. Namely, a client outsources its data structure and verifies that the answers to the queries have not been tampered with. We provide efficient algorithms to securely outsource a skip list with logarithmic time overhead at the server and client and logarithmic communication cost, thus providing an efficient authentication primitive for outsourced data, both structured (e.g., relational databases) and semi-structured (e.g., XML documents). In our technique, the client stores only a constant amount of space, which is optimal. Our two-party authentication framework can be deployed on top of existing storage applications, thus providing an efficient authentication service. Finally, we present experimental results that demonstrate the practical efficiency and scalability of our scheme.