Formalization of Generic Authenticated Data Structures


Title: Formalization of Generic Authenticated Data Structures
Authors: Matthias Brun and Dmitriy Traytel
Submission date: 2019-05-14
Abstract: Authenticated data structures are a technique for outsourcing data storage and maintenance to an untrusted server. The server is required to produce an efficiently checkable and cryptographically secure proof that it carried out precisely the requested computation. Miller et al. introduced λ• (pronounced lambda auth)—a functional programming language with a built-in primitive authentication construct, which supports a wide range of user-specified authenticated data structures while guaranteeing certain correctness and security properties for all well-typed programs. We formalize λ• and prove its correctness and security properties. With Isabelle's help, we uncover and repair several mistakes in the informal proofs and lemma statements. Our findings are summarized in a paper draft.
  author  = {Matthias Brun and Dmitriy Traytel},
  title   = {Formalization of Generic Authenticated Data Structures},
  journal = {Archive of Formal Proofs},
  month   = may,
  year    = 2019,
  note    = {\url{},
            Formal proof development},
  ISSN    = {2150-914x},
License: BSD License
Depends on: Nominal2
Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.