Modes of Encryption Secure against Blockwise-Adaptive Chosen-Plaintext Attack (2006)
BibTeX
@MISC{Bard06modesof,
author = {Gregory V. Bard},
title = {Modes of Encryption Secure against Blockwise-Adaptive Chosen-Plaintext Attack},
year = {2006}
}
OpenURL
Abstract
Blockwise-adaptive chosen-plaintext and chosen-ciphertext attack are new models for cryptanalytic adversaries, first discovered by Joux, et al [JMV02], and describe a vulnerability in SSH discovered by Bellare, et al [BKN02]. Unlike traditional chosen-plaintext (CPA) or chosen-ciphertext (CCA) adversaries, the blockwise adversary can submit individual blocks for encryption or decryption rather than entire messages. This paper focuses on the search for on-line encryption schemes which are resistant to blockwise-adaptive chosen-plaintext attack. We prove that one oracle query with non-equal inputs is su#cient to win the blockwise-adaptive chosenplaintext game if the game can be won by any adversary in ppt with non-negligible advantage. In order to







