consistent online connection / bank accounts / balanced search trees / communications costs / treap algorithm / public key cryptography systems / randomized search tree / search trees / public key infrastructure / search path / search-key order / binary search / binary search trees / balanced search tree / revision control systems / persistent search trees / search tree data structures / bank transactions / search tree / authenticated search trees / persistent redblack search trees / ordinary search tree / gossip protocols / version number use binary search / persistent binary search trees / ordinary search tree data structures / /
Organization
National Science Foundation / Rice University / /
Person
Scott A. Crosby / Dan S. Wallach / /
Position
author / trusted author / untrusted author / /
Technology
functional programming / cryptography / public key infrastructure / public key / PKI / gossip protocols / treap algorithm / cloning / caching / digital signature / /
Super-efficient Aggregating History-independent Persistent Authenticated Dictionaries? Scott A. Crosby and Dan S. Wallach Rice University, {scrosby,dwallach}@cs.rice.edu Abstract. Authenticated dictionaries allow users