Secure names for bit-strings

Haber, Stephen; Stornetta, W. Scott

doi:10.1145/266420.266430

Cited by 102 publications

(54 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Bayer, Haber and Stornetta [3] improve upon the linking scheme, reducing the communication and storage requirements of the system and increasing its robustness, by replacing the linear list with a tree. Further work [17,7,6,8,5,4] is mainly focused on additional improvements in terms of storage, robustness and reducing the trust required in the timestamping server(s).…”

Section: Previous Workmentioning

confidence: 99%

Non-interactive Timestamping in the Bounded Storage Model

Moran

Shaltiel

Ta-Shma

2004

Advances in Cryptology – CRYPTO 2004

View full text Add to dashboard Cite

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. Unfortunately, no such scheme exists against polynomial time adversaries that have unbounded storage at their disposal. In this paper we show non-interactive timestamping is possible in the bounded storage model. In this model it is assumed that all parties participating in the protocol have small storage, and that in the beginning of the protocol a very long random string (which is too long to be stored by the players) is transmitted. 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 assuming 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.

show abstract

Section: Previous Workmentioning

confidence: 99%

Non-interactive Timestamping in the Bounded Storage Model

Moran

Shaltiel

Ta-Shma

2004

Advances in Cryptology – CRYPTO 2004

View full text Add to dashboard Cite

show abstract

“…We observe that the formal security condition stated in [5] is unreachably strong because it overlooks pre-computations of the adversary.…”

Section: Introductionmentioning

confidence: 97%

“…In this paper, we revisit the security analysis of hash-based time-stamping schemes [5]. We observe that the formal security condition stated in [5] is unreachably strong because it overlooks pre-computations of the adversary.…”

Section: Introductionmentioning

confidence: 99%

“…In [5], a formal security condition for hash-based time-stamping schemes was presented and an informal sketch of a security proof was outlined. Though no rigorous proofs were presented it has become almost a public myth that the security of hash-based time-stamping schemes can be reduced to the collision-resistance of underlying hash functions.…”

Section: Introductionmentioning

confidence: 99%

“…Inspired by a simplistic patent filing scenario, we present a new security condition for time-stamping schemes that leads to a new security condition for hash functions -chain-resistance -necessary for the scheme [5] to be secure. We show that additional checks in the verifying procedure render the conventional time-stamping schemes provably secure in the new sense, based on collisionresistance of the hash function.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On Provably Secure Time-Stamping Schemes

Buldas

Saarepera

2004

Advances in Cryptology - ASIACRYPT 2004

View full text Add to dashboard Cite

Abstract. It is almost a folklore-knowledge that hash-based time-stamping schemes are secure if the underlying hash function is collisionresistant but still no rigorous proofs have been published. We try to establish such proof and conclude that the existing security conditions are improper because they ignore precomputations by adversaries. After analyzing a simplistic patent filing scenario, we suggest a new security condition for time-stamping schemes that leads to a new security property of hash functions -chain-resistance. We observe that if the variety of possible shapes of hash-chains is polynomial (and the verification procedure is suitably improved), then the time-stamping scheme becomes provably secure, assuming that the underlying hash function is collisionresistant. Finally, we show that in some sense, the restrictions in the security definition are necessary -conventional black-box techniques are unable to prove that chain-resistance follows from collision-resistance.

show abstract

Bibliography

2020

Security Engineering

View full text Add to dashboard Cite

Secure names for bit-strings

Cited by 102 publications

References 21 publications

Non-interactive Timestamping in the Bounded Storage Model

Non-interactive Timestamping in the Bounded Storage Model

On Provably Secure Time-Stamping Schemes

Bibliography

Contact Info

Product

Resources

About