Optimally efficient accountable time-stamping

DOI10.1007/978-3-540-46588-1_20MaRDI QIDQ4950052zbMATH OpenFDO

Authors Ahto Buldas, Helger Lipmaa, Berry Schoenmakers

Publication date 7 May 2000

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

Full work available at URL https://doi.org/10.1007/978-3-540-46588-1_20

zbMATH Keywords

accountable time-stampinglong-term authentication of digital documentsrelative temporal authentication

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Stamp and extend -- instant but undeniable timestamping based on lazy trees
• Information Security
• scientific article; zbMATH DE number 1825103
• Time-stamping with binary linking schemes
• scientific article; zbMATH DE number 826064

Cited in

(6)

• Non-interactive timestamping in the bounded-storage model
• Stamp and extend -- instant but undeniable timestamping based on lazy trees
• scientific article; zbMATH DE number 1825103 (Why is no real title available?)
• Distributed time-stamping with boomerang onions
• scientific article; zbMATH DE number 826064 (Why is no real title available?)
• Information Security

This page was built for publication: Optimally efficient accountable time-stamping

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