Non-interactive timestamping in the bounded-storage model
From MaRDI portal
Publication:1015360
DOI10.1007/s00145-008-9035-9zbMath1159.94368OpenAlexW2019358670WikidataQ62398460 ScholiaQ62398460MaRDI QIDQ1015360
Ronen Shaltiel, Tal Moran, Amnon Ta-Shma
Publication date: 8 May 2009
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-008-9035-9
Related Items (3)
Secure multiparty computation in the bounded storage model ⋮ Speak much, remember little: cryptography in the bounded storage model, revisited ⋮ An Everlasting Secure Non-interactive Timestamping Scheme in the Bounded Storage Model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Extracting randomness: A survey and new constructions
- Storing information with extractors.
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- On recycling the randomness of states in space bounded computation
- A “Paradoxical” Solution to The Signature Problem
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Tight security proofs for the bounded-storage model
- Computing with Very Weak Random Sources
- How to Time-Stamp a Digital Document
- Everlasting security in the bounded storage model
- Loss-less condensers, unbalanced expanders, and extractors
- Advances in Cryptology – CRYPTO 2004
- Extractors and pseudorandom generators
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Theory of Cryptography
- Extracting all the randomness and reducing the error in Trevisan's extractors
This page was built for publication: Non-interactive timestamping in the bounded-storage model
