The security of the cipher block chaining message authentication code
Journal of Computer and System Sciences
OCB: a block-cipher mode of operation for efficient authenticated encryption
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Encryption Modes with Almost Free Message Integrity
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Minimalism in cryptography: the even-mansour scheme revisited
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 754.84 |
This paper shows that many independent pseudorandom permutations over {O, 1}n can be obtained from a single public random permutation and secret n bits. It is then proved that a slightly modified IAPM (an authenticated-encryption scheme) is secure even if the underlying block cipher F is publicly accessible (as a blackbox). A similar result is derived for DCB mode, too. The security proofs are based on our first result, and they are extremely simple. Finally, it is shown that our security bound is tight within a constant factor.