Making data structures persistent
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Mapping the genome: some combinatorial problems arising in molecular biology
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Network security: private communication in a public world
Network security: private communication in a public world
The path length of random skip lists
Acta Informatica
Data collection for the Sloan digital sky survey—a network-flow heuristic
Journal of Algorithms
Generalized certificate revocation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Eliminating counterevidence with applications to accountable certificate management
Journal of Computer Security
Fast Digital Identity Revocation (Extended Abstract)
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
The Binomial Transform and its Application to the Analysis of Skip Lists
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
Efficient and Fresh Cerification
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Authentic data publication over the internet
Journal of Computer Security - IFIP 2000
Efficient Certificate Revocation
Efficient Certificate Revocation
Authenticating Query Results in Edge Computing
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A General Model for Authenticated Data Structures
Algorithmica
Data Structures and Algorithms in Java
Data Structures and Algorithms in Java
Certificate revocation and certificate update
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Authenticated data structures for graph and geometric searching
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Computational bounds on hierarchical data processing with applications to information security
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Verified query results from hybrid authentication trees
DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
Proceedings of the 15th ACM conference on Computer and communications security
Time and space efficient algorithms for two-party authenticated data structures
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Authentic time-stamps for archival storage
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Authenticated and persistent skip graph: a data structure for cloud based data-centric applications
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Authenticated data structures, generically
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures that allow us to study the performance overhead of authentication and persistence. We explore various design decisions and analyze the impact of garbage collection and virtual memory paging, as well. Our empirical study confirms the efficiency of authenticated skip lists and offers guidelines for incorporating them in various applications.