Non-interactive timestamping in the bounded storage model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3152, Issue , 2004, Pages 460-476

  Moran, Tal ^a   Shalticl, Ronen ^b   Ta Shma, Amnon ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Bounded storage model; Expander graphs; Extractors; Timestamping

Indexed keywords

INFORMATION THEORY; MOBILE SECURITY; POLYNOMIAL APPROXIMATION;

BOUNDED STORAGE MODEL; CRYPTOGRAPHIC ASSUMPTIONS; EFFICIENT CONSTRUCTION; EXPANDER GRAPHS; EXPLICIT CONSTRUCTIONS; EXTRACTORS; TIMESTAMPING; TIMESTAMPING SCHEME;

CRYPTOGRAPHY;

EID: 35048857905     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28628-8_28     Document Type: Article

References (25)

1. Y. Aumann, Y.Z. Ding, and M. O. Rabin. Everlasting security in the bounded storage model. IEEE Transactions on Information Theory, 48, 2002.
2. Y. Aumann and M. O. Rabin. Information theoretically secure communication in the limited storage space model. Advances in Crypology -CRYPTO '99, volume 1666, pages 65-79, 1999.
3. D. Bayer, S. Haber, and W. S. Stornetta. Improving the efficiency and reliability of digital time-stamping. In R. M. Capocelli et al., editor, Sequences II: Methods in Communication, Security and Computer Science, 329-334. Springer-Verlag, Berlin Germany , New York, 1992.
4. J. Benaloh and M. de Mare. Efficient broadcast time-stamping. Technical Report 1, Clarkson University Department of Mathematics and Computer Science, August 1991.
5. Josh Cohen Benaloh and Michael de Mare. One-way accumulators: A decentralized alternative to digital signatures. Lecture Notes in Computer Science, 765:274, 1994.
6. Ahto Buldas and Peeter Laud. New linking schemes for digital time-stamping. Information Security and Cryptology, 3-13, 1998.
7. Ahto Buldas, Peeter Laud, Helger Lipmaa, and Jan Villemson. Time-stamping with Binary Linking Schemes. In Hugo Krawczyk, editor, Advances on Cryptology - CRYPTO '98, volume 1462 of Lecture Notes in Computer Science, 486-501, Santa Barbara, USA, August 1998. Springer-Verlag.
8. Ahto Buldas, Helger Lipmaa, and Berry Schoenmakers. Optimally efficient accountable time-stamping. Public Key Cryptography, 293-305, 2000.
9. Christian Cachin, Claude Crepcau, and Julien Marcil. Oblivious transfer with a memory-bounded receiver. IEEE Symposium on Foundations of Computer Science, 493-502, 1998.
10. Christian Cachin and Ueli Maurer. Unconditional security against memorybounded adversaries. In Burton S. Kaliski Jr., editor, Advances in Cryptology CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, 292-306. Springer-Verlag, 1997.
11. I.B. Damgard. Collision free hash functions and public-key signature schemes. Advances in Cryptology - EUROCRYPT '87, Proceedings, volume 304, 203-216. Springer-Verlag, 1987.
12. Yan Zong Ding. Oblivious transfer in the bounded storage model. Lecture Notes in Computer Science, 2139:155, 2001.
13. Yan Zong Ding, Danny Harnik, Alon Rosen, and Ronen Shaltiel. Constant-round oblivious transfer in the bounded storage model. Theory of Cryptography TCC '04, volume 2951, Cambridge, MA, USA, February 2004. Springer-Verlag. To appear.
14. Y.Z. Ding and M.O. Rabin. Hyper-encryption and everlasting security. Annual Symposium on Theoretical Aspects of Computer Science (STACS), 1-26, 2002.
15. Stefan Dziembowski and Ueli Maurer. Tight security proofs for the boundedstorage model. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 341-350. ACM, May 2002.
16. Stuart Haber and W. Scott Stornetta. How to time-stamp a digital document. Lecture Notes in Computer Science, 537:437, 1991.
17. Stuart Haber and W. Scott Stornetta. Secure names for bit-strings. ACM Conference on Computer and Communications Security, 28-35, 1997.
18. C. Lu. Hyper-encryption against space-bounded adversaries from on-line strong extractors. Advances in Cryptology CRYPTO '02, volume 2442, 257271. Springer, 2002.
19. U. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(l):53-66, 1992.
20. Ralph C. Merkle. A certified digital signature. Proceedings on Advances in Cryptology, 218-238. Springer-Verlag New York, Inc., 1989.
21. R. Raz, O. Reingold, and S. Vadhan. Error reduction for extractor. 40th IEEE Symposium on Foundations of Computer Science, 191-201, 1999.
22. A. Srinivasan and D. Zuckerman. Computing with very weak random sources. SIAM Journal on Computing, 28:1433-1459, 1999.
23. Amnon Ta-Shma. Storing information with extractors. Information Processing Letters, 83(5):267-274, September 2002.
24. Amnon Ta-Shma, Christopher Umans, and David Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In ACM, editor, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing: Hersonissos, Crete, Greece, July 6-8, 2001, 143-152, New York, NY, USA, 2001. ACM Press.
25. S.P. Vadhan. On constructing locally computable extractors and cryptosystems in the bounded storage model. Advances in Cryptology CRYPTO '03. Springer, 2003.