From 659092e8dc8dcdeae56e5d2b94163630537678fe Mon Sep 17 00:00:00 2001 From: davidsarah <> Date: Sun, 11 Oct 2009 02:20:50 +0000 Subject: [PATCH] hash length for accidental collisions [Imported from Trac: page NewCaps/WhatCouldGoWrong, version 16] --- NewCaps/WhatCouldGoWrong.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/NewCaps/WhatCouldGoWrong.md b/NewCaps/WhatCouldGoWrong.md index 516df1a..6ae5e70 100644 --- a/NewCaps/WhatCouldGoWrong.md +++ b/NewCaps/WhatCouldGoWrong.md @@ -25,7 +25,7 @@ where *k* = bitlength(*K1*), *n* = bitlength(*R*), *t* = bitlength(*T*), *u* = b 3. *undeletion*: attacker makes a deleted file (for which it need not have had a read cap) accessible at its previous storage index, and readable by previous read caps -4. See the probability table at . +4. See the probability table at , for hash length *s*+*t*. 5. Brute force costs assume a single-target attack that is expected to succeed with high probability. Costs will be lower for attacking multiple targets or for a lower success probability. (Should we give give explicit formulae for this?)