Universal one-way hash function

Results: 16



#Item
1This 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

Add to Reading List

Source URL: www.normalesup.org

Language: English - Date: 2015-02-21 09:51:42
2Very-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

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-06-28 21:51:08
3Introduction  MD New Results I

Introduction MD New Results I

Add to Reading List

Source URL: www.hyperelliptic.org

Language: English - Date: 2008-09-27 14:59:29
4How to Time-Stamp a Digital Document Stuart Haber  W. Scott Stornetta

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

Add to Reading List

Source URL: www.anf.es

Language: English - Date: 2014-05-12 07:16:17
5Proceedings 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

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2002-06-27 15:00:00
6An abridged version of this paper appears in Advances in Cryptology { Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed., Springer-Verlag, 1997. A New Paradigm for Collision-free Hashing:

An abridged version of this paper appears in Advances in Cryptology { Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed., Springer-Verlag, 1997. A New Paradigm for Collision-free Hashing:

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 1998-07-30 12:00:14
7Cryptanalysis on a Merkle-Damgård Based MAC Almost Universal Forgery and Distinguishing-H Attacks Yu Sasaki (NTT Corporation[removed] @ Eurocrypt 2012

Cryptanalysis on a Merkle-Damgård Based MAC Almost Universal Forgery and Distinguishing-H Attacks Yu Sasaki (NTT Corporation[removed] @ Eurocrypt 2012

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2012-04-20 07:04:20
81  Q2S Edon-R, An Infinite Family of Cryptographic Hash Functions

1 Q2S Edon-R, An Infinite Family of Cryptographic Hash Functions

Add to Reading List

Source URL: csrc.nist.gov

Language: English - Date: 2012-06-20 08:38:20
9Classification of Hash Functions Suitable for Real-life Systems

Classification of Hash Functions Suitable for Real-life Systems

Add to Reading List

Source URL: csrc.nist.gov

Language: English - Date: 2012-06-20 09:53:32
10Cryptographic Hash Workshop[removed]Classification of Hash Functions Suitable for Real-life Systems Paper

Cryptographic Hash Workshop[removed]Classification of Hash Functions Suitable for Real-life Systems Paper

Add to Reading List

Source URL: csrc.nist.gov

Language: English - Date: 2012-06-20 09:54:18