Cryptography for Efficiency: New Directions in Authenticated Data Structures
Name:
Personal
Name Part
Papamanthou, Charalampos
Role
Role Term:
Text
creator
Origin Information
Copyright Date
2011
Physical Description
Extent
xix, 215 p.
digitalOrigin
born digital
Note
Thesis (Ph.D. -- Brown University (2011)
Name:
Personal
Name Part
Tamassia, Roberto
Role
Role Term:
Text
Director
Name:
Personal
Name Part
Lysyanskaya, Anna
Role
Role Term:
Text
Reader
Name:
Personal
Name Part
Goodrich, Michael
Role
Role Term:
Text
Reader
Name:
Personal
Name Part
Preparata, Franco
Role
Role Term:
Text
Reader
Name:
Corporate
Name Part
Brown University. Computer Science
Role
Role Term:
Text
sponsor
Genre (aat)
theses
Abstract
Cloud computing has emerged as an important new computational andstorage medium and is increasingly being adopted both by companies and individuals as a means of reducingoperational and maintenance costs. However, remotely-stored sensitive datamay be lost or modified and third-party computations may not be performed correctly due toerrors, opportunistic behavior, or malicious attacks. Thus, while thecloud is an attractive alternative to local trusted computationalresources, users need integrity guarantees in order to fully adopt this new paradigm. Specifically, they need tobe assured that uploaded data has not been altered and outsourced computations have been performed correctly.Tackling the above problems requires the design of protocols that, on the one hand, are provably secureand at the same time remain highly efficient, otherwise the mainpurpose of adopting cloud computing, namely efficiency and scalability,is defeated. It is therefore essential that expertise in cryptography andefficient algorithmics be combined to achieve these goals.This thesis studies techniques allowing the efficient verification of data integrity and computations correctness in such adversarial environments. Towards this end, several new authenticated data structures for fundamental algorithmics and computation problems, e.g., hash table queries and set operations, are proposed. The main novelty of this work lies in employing advanced cryptography such as lattices and bilinear maps, towards achieving high efficiency, departing from traditional hash-based primitives. As such, the proposed techniques lead to efficient solutions that introduce minimal asymptotic overhead and at the same time enable highly-desirable features such as optimal verification mechanisms and parallel authenticated data structures algorithms. The small asymptotic overhead does translate into significant practical savings, yielding efficient protocols and system prototypes.