Non-interactive Timestamping in the Bounded-Storage Model
Open Access
- 10 January 2009
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 22 (2) , 189-226
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy CodesTwenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007
- Oblivious transfer with a memory-bounded receiver2002
- Everlasting security in the bounded storage modelIEEE Transactions on Information Theory, 2002
- Tight security proofs for the bounded-storage model2002
- Hyper-Encryption and Everlasting Security2002
- On recycling the randomness of states in space bounded computation1999
- Extracting Randomness: A Survey and New ConstructionsJournal of Computer and System Sciences, 1999
- Conditionally-perfect secrecy and a provably-secure randomized cipherJournal of Cryptology, 1992
- How to time-stamp a digital documentJournal of Cryptology, 1991
- A "Paradoxical" Solution To The Signature Problem1984