Generic Authenticated Data Structures, Formally

Abstract

8 Authenticated data structures are a technique for outsourcing data storage and maintenance to an 9 untrusted server. The server is required to produce an efficiently checkable and cryptographically 10 secure proof that it carried out precisely the requested computation. Recently, Miller et al. [10] 11 demonstrated how to support a wide range of such data structures by integrating an authentication 12 construct as a first class citizen in a functional programming language. In this paper, we put this 13 work to the test of formalization in the Isabelle proof assistant. With Isabelle’s help, we uncover 14 and repair several mistakes and modify the small-step semantics to perform call-by-value evaluation 15 rather than requiring terms to be in administrative normal form. 16 2012 ACM Subject Classification Security and privacy → Logic and verification 17