Abstract
A timestamping scheme is non-interactive if a stamper can stamp a document without communicating with any other player. The only communication done is at validation time. Non-Interactive timestamping has many advantages, such as information theoretic privacy and enhanced robustness. Non-Interactive timestamping, however, is not possible against polynomial-time adversaries that have unbounded storage at their disposal. As a result, no non-interactive timestamping schemes were constructed up to date.
In this paper we show that non-interactive timestamping is possible in the bounded-storage model, i.e., if the adversary has bounded storage, and a long random string is broadcast to all players. To the best of our knowledge, this is the first example of a cryptographic task that is possible in the bounded-storage model but is impossible in the “standard cryptographic setting,” even when assuming “standard” cryptographic assumptions.
We give an explicit construction that is secure against all bounded storage adversaries and a significantly more efficient construction secure against all bounded storage adversaries that run in polynomial time.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Y. Aumann, M.O. Rabin, Information theoretically secure communication in the limited storage space model, in Advances in Cryptology, Proceedings of the 19th Annual International Cryptology Conference (CRYPTO), vol. 1666 (1999), pp. 65–79
Y. Aumann, Y.Z. Ding, M.O. Rabin, Everlasting security in the bounded storage model. IEEE Trans. Inf. Theory 48, 1668–1680 (2002)
D. Bayer, S. Haber, W.S. Stornetta, Improving the efficiency and reliability of digital time-stamping, in Sequences II: Methods in Communication, Security and Computer Science, ed. by R.M. Capocelli et al. (Springer, New York, 1992), pp. 329–334
J. Benaloh, M. de Mare, Efficient broadcast time-stamping. Technical Report 1, Clarkson University Department of Mathematics and Computer Science, August 1991
J.C. Benaloh, M. de Mare, One-way accumulators: A decentralized alternative to digital signatures (extended abstract), in Advances in Cryptology, Proceedings of the 12th Annual International Conference on the Theory and Application of Cryptographic Techniques, 1993, pp. 274–285
A. Buldas, P. Laud, New linking schemes for digital time-stamping, in Information Security and Cryptology, 1998, pp. 3–13
A. Buldas, P. Laud, H. Lipmaa, J. Villemson, Time-stamping with binary linking schemes, in Advances in Cryptology, Proceedings of the 18th Annual International Cryptology Conference (CRYPTO), 1998, pp. 486–501
A. Buldas, H. Lipmaa, B. Schoenmakers, Optimally efficient accountable time-stamping, in Public Key Cryptography, 2000, pp. 293–305
C. Cachin, U. Maurer, Unconditional security against memory-bounded adversaries, in Advances in Cryptology, Proceedings of the 17th Annual International Cryptology Conference (CRYPTO), 1997, pp. 292–306
C. Cachin, C. Crepeau, J. Marcil, Oblivious transfer with a memory-bounded receiver, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 493–502
I. Damgård, Collision free hash functions and public key signature schemes, in EUROCRYPT, 2007, pp. 203–216
Y.Z. Ding, Oblivious transfer in the bounded storage model, in Advances in Cryptology, Proceedings of the 21st Annual International Cryptology Conference (CRYPTO), 2001, pp. 155–170
Y.Z. Ding, M.O. Rabin, Hyper-encryption and everlasting security, in Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2002, pp. 1–26
Y.Z. Ding, D. Harnik, A. Rosen, R. Shaltiel, Constant-round oblivious transfer in the bounded storage model, in Theory of Cryptography, First Theory of Cryptography Conference (TCC), 2004, pp. 446–472
S. Dziembowski, U. Maurer, Tight security proofs for the bounded-storage model, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 341–350
S. Goldwasser, S. Micali, R. Rivest, A “paradoxical” solution to the signature problem, in Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, 1984, pp. 441–448
V. Guruswami, C. Umans, S.P. Vadhan, Unbalanced expanders and randomness extractors from Parvaresh–Vardy codes, in IEEE Conference on Computational Complexity, 2007, pp. 96–108
S. Haber, W.S. Stornetta, How to time-stamp a digital document. J. Cryptol. 3(2), 99–111 (1991)
S. Haber, W.S. Stornetta, Secure names for bit-strings, in ACM Conference on Computer and Communications Security, 1997, pp. 28–35
J. Kilian, A note on efficient zero-knowledge proofs and arguments, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992, pp. 723–732
C. Lu, Hyper-encryption against space-bounded adversaries from on-line strong extractors, in Advances in Cryptology, Proceedings of the 22nd Annual International Cryptology Conference (CRYPTO), 2002, pp. 257–271
U. Maurer, Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptol. 5(1), 53–66 (1992)
R.C. Merkle, A certified digital signature, in Advances in Cryptology, Proceedings of the 18th Annual International Cryptology Conference (CRYPTO), 1989, pp. 218–238
T. Moran, R. Shaltiel, A. Ta-Shma, Non-interactive timestamping in the bounded storage model, in Advances in Cryptology, Proceedings of the 24th Annual International Cryptology Conference (CRYPTO), vol. 1666 (2004), pp. 460–476
N. Nisan, A. Ta-Shma, Extracting randomness: a survey and new constructions. J. Comput. Syst. Sci. 58, 148–173 (1999)
R. Raz, O. Reingold, On recycling the randomness of states in space bounded computation, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 159–168
R. Raz, O. Reingold, S. Vadhan, Extracting all the randomness and reducing the error in Trevisan’s extractors, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 149–158
R. Raz, O. Reingold, S. Vadhan, Extracting all the randomness and reducing the error in Trevisan’s extractors. J. Comput. Syst. Sci. 65(1), 97–128 (2002)
R. Shaltiel, Recent developments in explicit constructions of extractors. Bull. EATCS 77, 67–95 (2002)
A. Srinivasan, D. Zuckerman, Computing with very weak random sources. SIAM J. Comput. 28, 1433–1459 (1999)
A. Ta-Shma, Storing information with extractors. Inf. Process. Lett. 83(5), 267–274 (2002)
A. Ta-Shma, C. Umans, D. Zuckerman, Loss-less condensers, unbalanced expanders, and extractors, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 143–152
L. Trevisan, Extractors and pseudorandom generators. J. ACM 48(4), 860–879 (2001)
S.P. Vadhan, Constructing locally computable extractors and cryptosystems in the bounded storage model. J. Cryptol. 17(1), 43–77 (2004)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Cynthia Dwork
A preliminary version of this paper appeared in CRYPTO 2004 [24].
Tal Moran: Some of this work was done while at Tel-Aviv University.
Ronen Shaltiel: Some of this work was done while at the Weizmann Institute of Science and supported by the Koshland Scholarship. This research was also supported by Grant No 2004329 from the United States-Israel Binational Science Foundation (BSF) and by ISF grant 686/07.
Amnon Ta-Shma: Supported by the Binational Science Foundation, by the Israel Science Foundation, and by the EU Integrated Project QAP.
Rights and permissions
About this article
Cite this article
Moran, T., Shaltiel, R. & Ta-Shma, A. Non-interactive Timestamping in the Bounded-Storage Model. J Cryptol 22, 189–226 (2009). https://doi.org/10.1007/s00145-008-9035-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-008-9035-9