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:8 - 3 self

Documents Related by Co-Citation

10 On provably secure time-stamping schemes – - 2004
23 Secure Names for Bit-Strings – - 1997
287 Protocols for public-key cryptosystems – - 1980
66 Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing – - 1996
69 Improving the Efficiency and Reliability of Digital Time-Stamping – - 1993
10 Certifying Data from Multiple Sources – - 2003
7 Universally Composable Time-Stamping Schemes with Audit – - 2005
835 A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks – - 1995
804 k-anonymity: A model for protecting privacy – - 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 ′ – - 1997
27 Eliminating Counterevidence with Applications to Accountable Certificate Management – - 2002
9 Fast accumulated hashing – - 1996
163 Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees – - 1997
16 Commitment schemes and zero-knowledge protocols – - 1999
203 A guided tour of Chernoff bounds – - 1990
113 Coin flipping by telephone: a protocol for solving impossible problems – - 1982
115 One-way accumulators: A decentralized alternative to digital signatures – - 1993
306 Minimum disclosure proofs of knowledge – - 1988
5 Foundations of Cryptography: II Basic Applications – - 2004