Two Cryptographic Properties of Strong Security Tweakable Enciphering Scheme

This paper presents the concepts of sorted-attack security and generalized sorted-attack security of tweakable enciphering schemes under chosen-plaintext and chosen-ciphertext attacks. Firstly, it is proved that those two notions are equivalence. Secondly, it is proved that the basic distinguishing attack security and the left-or-right distinguishing attack security guarantee sorted-attack security and generalized sorted-attack security, therefore reveals that a strong tweakable enciphering scheme have those two cryptographic properties.