Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Accountable certificate management using undeniable attestations
Proceedings of the 7th ACM conference on Computer and communications security
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Time-Stamping with Binary Linking Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
On Certificate Revocation and Validation
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
Optimally Efficient Accountable Time-Stamping
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Efficient Certificate Revocation
Efficient Certificate Revocation
Historic integrity in distributed systems
Historic integrity in distributed systems
Certificate revocation and certificate update
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Trustworthy keyword search for regulatory-compliant records retention
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Zerber: r-confidential indexing for distributed documents
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Advanced Internet Based Systems and Applications
FastAD: an authenticated directory for billions of objects
ACM SIGOPS Operating Systems Review
Authentic time-stamps for archival storage
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Efficient data structures for tamper-evident logging
SSYM'09 Proceedings of the 18th conference on USENIX security symposium
A new timestamping scheme based on skip lists
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 0.00 |
Skip Lists were first used as data structures for their simple implementation and optimal update and search time. Goodrich [7][8] was the first to propose an authenticated dictionary based on skip lists. More recently, Maniatis and Baker [10][11][12] have proposed an authenticated append only dictionary based on perfect skip lists. In this paper, we propose an authenticated append only dictionary which offers better performances than the previous proposals. Moreover this dictionary allows comparing the relative order of elements. Such a dictionary could be used for timestamping purposes.