Time-stamping with binary linking schemes

DOI10.1007/BFB0055749MaRDI QIDQ4249353zbMATH OpenFDO

Authors Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Villemson

Publication date 17 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

time-stamping systems

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• How to Time-Stamp a Digital Document
• scientific article; zbMATH DE number 1808273
• scientific article; zbMATH DE number 826064
• scientific article; zbMATH DE number 1825103

Cited in

(17)

• Non-interactive timestamping in the bounded-storage model
• Designing a secure e-tender submission protocol
• Some combinatorial aspects of time-stamp systems
• Property-driven timestamps encoding for timeprints-based tracing and monitoring
• Security of the design of time-stamped signatures
• A time-stamping protocol for digital watermarking
• A signature scheme for a dynamic coalition defence environment without trusted third parties
• Stamp and extend -- instant but undeniable timestamping based on lazy trees
• scientific article; zbMATH DE number 1808273 (Why is no real title available?)
• scientific article; zbMATH DE number 1825103 (Why is no real title available?)
• A New Timestamping Scheme Based on Skip Lists
• How to Time-Stamp a Digital Document
• scientific article; zbMATH DE number 826064 (Why is no real title available?)
• Optimally efficient accountable time-stamping
• An everlasting secure non-interactive timestamping scheme in the bounded storage model
• Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
• On the design of time-stamped signatures

This page was built for publication: Time-stamping with binary linking schemes

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