A New Timestamping Scheme Based on Skip Lists

DOI10.1007/11751595_43MaRDI QIDQ3600115zbMATH OpenOpenAlexWikidataFDO

Authors Kaouthar Blibech, A. Gabillon

Publication date 10 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751595_43

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• A combined BIT and TIMESTAMP algorithm for the list update problem
• scientific article; zbMATH DE number 1979529
• scientific article; zbMATH DE number 1302867
• scientific article; zbMATH DE number 1756661
• scientific article; zbMATH DE number 1825103
• scientific article; zbMATH DE number 1941252

Cited in

(5)

• Property-driven timestamps encoding for timeprints-based tracing and monitoring
• Stamp and extend -- instant but undeniable timestamping based on lazy trees
• Distributed time-stamping with boomerang onions
• An everlasting secure non-interactive timestamping scheme in the bounded storage model
• A combined BIT and TIMESTAMP algorithm for the list update problem

This page was built for publication: A New Timestamping Scheme Based on Skip Lists

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600115)