Sciweavers

Share
TIT
2010

Power of a public random permutation and its application to authenticated encryption

7 years 10 months ago
Power of a public random permutation and its application to authenticated encryption
In this paper, we first show that many independent pseudorandom permutations over {0, 1}n can be obtained from a single public random permutation and secret n bits. We next prove that a slightly modified IAPM is secure even if the underlying block cipher F is publicly accessible (as a blackbox). We derive a similar result for OCB mode, too. The security proofs are based on our first result and are extremely simple. We finally show that our security bound is tight within a constant factor.
Kaoru Kurosawa
Added 22 May 2011
Updated 22 May 2011
Type Journal
Year 2010
Where TIT
Authors Kaoru Kurosawa
Comments (0)
books