FastAD: an authenticated directory for billions of objects

We develop techniques that make authenticated directories efficient and scalable toward the goal of managing tens of billions of objects in a single directory. Internet storage services have already realized this scale: Amazon's S3 contained more than 52 billion objects as of April 2009 [1]. Our contributions include defining on-disk, block-oriented data structures and algorithms for authenticated directories that exceed memory capacity and optimizations that reduce the I/O required to insert and access entries in the directory.

[1]  Randy H. Katz,et al.  Above the Clouds: A Berkeley View of Cloud Computing , 2009 .

[2]  Jeffrey S. Chase,et al.  Strong accountability for network storage , 2007, TOS.

[3]  Roberto Tamassia,et al.  On the Cost of Authenticated Data Structures , 2005 .

[4]  Gary Valentin,et al.  Fractal prefetching B+-Trees: optimizing both cache and disk performance , 2002, SIGMOD '02.

[5]  Kai Li,et al.  Avoiding the Disk Bottleneck in the Data Domain Deduplication File System , 2008, FAST.

[6]  Michael T. Goodrich,et al.  Persistent Authenticated Dictionaries and Their Applications , 2001, ISC.

[7]  Mihir Bellare,et al.  A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost , 1997, EUROCRYPT.

[8]  Alban Gabillon,et al.  CHRONOS: an authenticated dictionary based on skip lists for timestamping systems , 2005, SWS '05.

[9]  Ralph C. Merkle,et al.  A Certified Digital Signature , 1989, CRYPTO.

[10]  Gaëtan Leurent,et al.  How Risky Is the Random-Oracle Model? , 2009, CRYPTO.

[11]  Margo I. Seltzer,et al.  Passive NFS Tracing of Email and Research Workloads , 2003, FAST.

[12]  Mihir Bellare,et al.  Incremental cryptography and application to virus protection , 1995, STOC '95.

[13]  Moni Naor,et al.  Certificate revocation and certificate update , 1998, IEEE Journal on Selected Areas in Communications.

[14]  Michael T. Goodrich,et al.  Athos: Efficient Authentication of Outsourced File Systems , 2008, ISC.

[15]  Mihir Bellare,et al.  The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin , 1996, EUROCRYPT.

[16]  William Pugh,et al.  Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.

[17]  Michael T. Goodrich,et al.  Implementation of an Authenticated Dictionary , 2001 .

[18]  David A. Wagner,et al.  A Generalized Birthday Problem , 2002, CRYPTO.

[19]  William Pugh,et al.  Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.

[20]  Mary Baker,et al.  Authenticated Append-only Skip Lists , 2003, ArXiv.