Do broken hash functions affect the security of time-stamping schemes (2006)

by Ahto Buldas , Sven Laur
Venue:In Proc. of ACNS’06, LNCS 3989
Citations:7 - 3 self

Documents Related by Co-Citation

8 On provably secure time-stamping schemes – Ahto Buldas, Märt Saarepera - 2004
23 Secure Names for Bit-Strings – Stuart Haber, W. Scott Stornetta - 1997
285 Protocols for public key cryptosystems – R Merkle - 1980
64 Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing – Shai Halevi, Silvio Micali - 1996
68 Improving the Efficiency and Reliability of Digital Time-Stamping – Dave Bayer, Stuart Haber, W. Scott Stornetta - 1993
11 Certifying Data from Multiple Sources – Glen Nuckolls, Chip Martel, Stuart G. Stubblebine - 2003
7 Universally Composable Time-Stamping Schemes with Audit – Ahto Buldas, Peeter Laud, Mart Saarepera, Jan Willemson - 2005
827 A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks – Shafi Goldwasser, Silvio Micali, Ronald L. Rivest - 1995
786 K-anonymity: a model for protecting privacy – Latanya Sweeney - 2002
2 exists c ∈ C such that Pr[r : W[r; c] �= 0] ≥ δ do (a) Choose c such that Pr[r : W[r; c] �= 0] ≥ δ and insert c into I. (b) For each row r ∈ R such that W[r; c] �= 0 do – Store w ← W[r; c]. – Remove w entries from the row. If W[r; c ′ ] = w then W[r, c ′ – While - 1997
4 Foundations of Cryptography: II Basic Applications – O Goldreich - 2004
27 Eliminating Counterevidence with Applications to Accountable Certificate Management – Ahto Buldas, Peeter Laud, Helger Lipmaa - 2002
9 Fast accumulated hashing – Kaisa Nyberg - 1996
15 Commitment schemes and zero-knowledge protocols – Ivan Damg˚ard - 1998
205 A guided tour of chernoff bounds – T Hagerup, C Rüb - 1990
113 Coin flipping by telephone: A protocol for solving impossible problems – M Blum - 1981
164 Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees – Niko Baric, Birgit Pfitzmann - 1997
114 One-way accumulators: A decentralized alternative to digital signatures – Josh Benaloh, Michael De Mare - 1993
300 Minimum disclosure proofs of knowledge – Gilles Brassard, David Chaum, Claude Crépeau - 1988