Changes between Version 29 and Version 30 of NewCaps/WhatCouldGoWrong


Ignore:
Timestamp:
2009-10-11T14:00:05Z (15 years ago)
Author:
davidsarah
Comment:

correction to effective hash length for accidental collisions

Legend:

Unmodified
Added
Removed
Modified

  • NewCaps/WhatCouldGoWrong

    v29 v30  
    28283. ''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
    2929
    30 4. See the probability table at http://en.wikipedia.org/wiki/Birthday_Paradox , for hash length ''s''+''t''.
     304. See the probability table at http://en.wikipedia.org/wiki/Birthday_Paradox . The effective hash length is approximately min(''s'',''r'')+''t'' bits.
    3131
    32325. 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 explicit formulae for this?)