<--- Back to Details
First PageDocument Content
Cryptography / Cryptographic hash functions / Search algorithms / Hashing / Revenue stamps / Error detection and correction / Hash function / Digital signature / Universal one-way hash function / Claw-free permutation / E-stamping
Date: 2014-05-12 07:16:17
Cryptography
Cryptographic hash functions
Search algorithms
Hashing
Revenue stamps
Error detection and correction
Hash function
Digital signature
Universal one-way hash function
Claw-free permutation
E-stamping

How to Time-Stamp a Digital Document Stuart Haber W. Scott Stornetta

Add to Reading List

Source URL: www.anf.es

Download Document from Source Website

File Size: 160,47 KB

Share Document on Facebook

Similar Documents

This article is the final version submitted by the authors to the IACR and to Springer-Verlag onThe version published by Springer-Verlag is available at http://dx.doi.orgNew Techn

This article is the final version submitted by the authors to the IACR and to Springer-Verlag onThe version published by Springer-Verlag is available at http://dx.doi.orgNew Techn

DocID: 1mzth - View Document

Very-efficient simulatable flipping of many coins into a well (and a new very-efficient extractable-and-equivocable commitment scheme) Luís T. A. N. Brandão∗ (Technical report – June 28, Abstract. Secure two

Very-efficient simulatable flipping of many coins into a well (and a new very-efficient extractable-and-equivocable commitment scheme) Luís T. A. N. Brandão∗ (Technical report – June 28, Abstract. Secure two

DocID: 1lbHc - View Document

Introduction  MD New Results I

Introduction MD New Results I

DocID: 1kOS7 - View Document

How to Time-Stamp a Digital Document Stuart Haber  W. Scott Stornetta

How to Time-Stamp a Digital Document Stuart Haber W. Scott Stornetta

DocID: 1kHPS - View Document

Proceedings of Selected Areas in Cryptography ’98 (August 17–18, 1998, Kingston, Ontario, Canada) S. Tavares and H. Meijer Eds. Springer-Verlag, LNCS 1556, pages 72–80. Computational Alternatives to Random Number G

Proceedings of Selected Areas in Cryptography ’98 (August 17–18, 1998, Kingston, Ontario, Canada) S. Tavares and H. Meijer Eds. Springer-Verlag, LNCS 1556, pages 72–80. Computational Alternatives to Random Number G

DocID: 19Nay - View Document