Advances in Cryptology – CRYPTO 2004

DOI10.1007/B99099zbMATH Open1104.94051DBLPconf/crypto/2004OpenAlexW2477011922MaRDI QIDQ5311550FDOQ5311550

Authors: Tal Moran, Ronen Shaltiel, Amnon Ta-Shma 

Publication date: 23 August 2005

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

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

Recommendations

• Non-interactive timestamping in the bounded-storage model
• An everlasting secure non-interactive timestamping scheme in the bounded storage model
• Bounded Concurrent Time-Stamping
• Proofs of replicated storage without timing assumptions
• scientific article; zbMATH DE number 1979529
• Non-interactive cryptographic timestamping based on verifiable delay functions
• Bounded time-stamping in message-passing systems
• Consistency in nondeterministic storage

zbMATH Keywords

expander graphsextractorsbounded storage modeltimestamping

Mathematics Subject Classification ID

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

Cited In (8)

• Knowledge-Binding Commitments with Applications in Time-Stamping
• Non-interactive timestamping in the bounded-storage model
• Distributed time-stamping with boomerang onions
• Incompressible cryptography
• An everlasting secure non-interactive timestamping scheme in the bounded storage model
• Non-interactive cryptographic timestamping based on verifiable delay functions
• Bounded time-stamps
• Disappearing cryptography in the bounded storage model

This page was built for publication: Advances in Cryptology – CRYPTO 2004

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