Authenticated data structures, generically
Authors:
Open Access
- 8 January 2014
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 49 (1) , 411-423
Abstract
An authenticated data structure (ADS) is a data structure whose operations can be carried out by an untrusted prover , the results of which a verifier can efficiently check as authentic. This is done by having the prover produce a compact proof that the verifier can check along with each operation's result. ADSs thus support outsourcing data maintenance and processing tasks to untrusted servers without loss of integrity. Past work on ADSs has focused on particular data structures (or limited classes of data structures), one at a time, often with support only for particular operations. This paper presents a generic method, using a simple extension to a ML-like functional programming language we call λ• (lambda-auth), with which one can program authenticated operations over any data structure defined by standard type constructors, including recursive types, sums, and products. The programmer writes the data structure largely as usual and it is compiled to code to be run by the prover and verifier. Using a formalization of λ• we prove that all well-typed λ• programs result in code that is secure under the standard cryptographic assumption of collision-resistant hash functions. We have implemented λ• as an extension to the OCaml compiler, and have used it to produce authenticated versions of many interesting data structures including binary search trees, red-black+ trees, skip lists, and more. Performance experiments show that our approach is efficient, giving up little compared to the hand-optimized data structures developed previously.Keywords
This publication has 16 references indexed in Scilit:
- Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search ProblemsAlgorithmica, 2009
- Optimal trade-off for Merkle tree traversalTheoretical Computer Science, 2007
- First-class nonstandard interpretations by opening closures2007
- Authentication and integrity in outsourced databasesACM Transactions on Storage, 2006
- An Invariant Cost Model for the Lambda Calculus2006
- A General Model for Authenticated Data StructuresAlgorithmica, 2004
- Authenticated Data Structures2003
- Intensional polymorphism in type-erasure semanticsJournal of Functional Programming, 2002
- Skip lists: a probabilistic alternative to balanced treesCommunications of the ACM, 1990
- Secure communications over insecure channelsCommunications of the ACM, 1978