Cryptography for Efficiency: New Directions in Authenticated Data Structures
Full Metadata
Overview
- Year:
- 2011
- Contributor:
- Papamanthou, Charalampos (creator)
- Tamassia, Roberto (Director)
- Lysyanskaya, Anna (Reader)
- Goodrich, Michael (Reader)
- Preparata, Franco (Reader)
- Brown University. Computer Science (sponsor)
- Genre:
- theses
- Subject:
- applied cryptography
- authenticated data structures
- Cloud computing
- Extent:
- xix, 215 p.
- DOI
- https://doi.org/10.7301/Z0Z60M99
Description
- 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.
- Notes:
- Thesis (Ph.D. -- Brown University (2011)
Access Conditions
- Rights
- In Copyright
- Restrictions on Use
- Collection is open for research.
Citation
Papamanthou, Charalampos,
"Cryptography for Efficiency: New Directions in Authenticated Data Structures"
(2011).
Computer Science Theses and Dissertations.
Brown Digital Repository. Brown University Library.
https://doi.org/10.7301/Z0Z60M99
Relations
Collection:
-
Computer Science Theses and Dissertations
Theses and Dissertations for the Computer Science department....