Loading...
Please wait, while we are loading the content...
Similar Documents
Stronger security bounds for permutations
| Content Provider | Semantic Scholar |
|---|---|
| Author | Bernstein, Daniel J. |
| Abstract | It is well known that, inside any cryptographic protocol, a uniform random function can be safely replaced with a uniform random injective function: as long as the number of function queries is small, the attacker’s success probability does not noticeably increase. This paper presents a quantitatively stronger theorem that handles a larger number of function queries. This quantitative improvement can be viewed as a generalization of the author’s recent improvement in security bounds for Wegman-Carter-Shoup authenticators. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://cr.yp.to/antiforgery/permutations-20050323.pdf |
| Alternate Webpage(s) | https://cr.yp.to/antiforgery/permutations-20050323.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
