原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
tag t = h(m), and Bob checks that the pair (m, t) he receives indeed satisfies t = h(m).
Suppose that an adversary intercepts (m, t) en route and tries to fool Bob by replacing the pair (m, t) with a different pair (m′, t′). Argue that the probability that the adversary succeeds in fooling Bob into accepting (m′, t′) is at most 1/p, no matter how much computing power the adversary has, even if the adversary knows the family H of hash functions used.
Chapter notes The books by Knuth [261] and Gonnet and Baeza-Yates [193] are excellent ref
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea