Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Incremental cryptography and application to virus protection
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fractal prefetching B+-Trees: optimizing both cache and disk performance
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
Passive NFS Tracing of Email and Research Workloads
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
CHRONOS: an authenticated dictionary based on skip lists for timestamping systems
Proceedings of the 2005 workshop on Secure web services
Strong accountability for network storage
ACM Transactions on Storage (TOS)
Avoiding the disk bottleneck in the data domain deduplication file system
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
The exact security of digital signatures-how to sign with RSA and Rabin
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A new paradigm for collision-free hashing: incrementality at reduced cost
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Certificate revocation and certificate update
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.