Non-interactive timestamping in the bounded storage model

DOI10.1007/978-3-540-28628-8_28MaRDI QIDQ5311550zbMATH OpenOpenAlexDBLPFDO

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

zbMATH Keywords

bounded storage modelexpander graphsextractorstimestamping

Mathematics Subject Classification ID

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

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
• A simple, memory-efficient bounded concurrent timestamping algorithm
• Non-interactive cryptographic timestamping based on verifiable delay functions
• Bounded time-stamping in message-passing systems
• Consistency in nondeterministic storage

Cited in

(9)

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

This page was built for publication: Non-interactive timestamping in the bounded storage model

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