Results 1 
3 of
3
Practical symmetric online encryption
 In Lecture Notes in Computer Science. Advances in Cryptology— FSE’03
, 2003
"... Abstract. This paper addresses the security of symmetric cryptosystems in the blockwise adversarial model. At Crypto 2002, Joux, Martinet and Valette have proposed a new kind of attackers against several symmetric encryption schemes. In this paper, we first show a generic technique to thwart blockwi ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Abstract. This paper addresses the security of symmetric cryptosystems in the blockwise adversarial model. At Crypto 2002, Joux, Martinet and Valette have proposed a new kind of attackers against several symmetric encryption schemes. In this paper, we first show a generic technique to thwart blockwise adversaries for a specific class of encryption schemes. It consists in delaying the output of the ciphertext block. Then we provide the first security proof for the CFB encryption scheme, which is naturally immune against such attackers.
A Proof of security in 0(2n) for the Benes Scheme
"... Abstract. In [1], W. Aiello and R. Venkatesan have shown how to construct pseudorandom functions of 2n bits → 2n bits from pseudorandom functions of n bits → n bits. They claimed that their construction, called “Benes ” reaches the optimal bound (m 2n) of security against adversaries with unlimit ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In [1], W. Aiello and R. Venkatesan have shown how to construct pseudorandom functions of 2n bits → 2n bits from pseudorandom functions of n bits → n bits. They claimed that their construction, called “Benes ” reaches the optimal bound (m 2n) of security against adversaries with unlimited computing power but limited by m queries in an Adaptive Chosen Plaintext Attack (CPA2). This result may have many applications in Cryptography (cf [1, 19, 18] for example). However, as pointed out in [18] a complete proof of this result is not given in [1] since one of the assertions in [1] is wrong. It is not easy to fix the proof and in [18], only a weaker result was proved, i.e. that in the Benes Schemes we have security when m f() · 2n−, where f is a function such that lim→0 f() = + ∞ (f depends only of , not of n). Nevertheless, no attack better than in O(2n) was found. In this paper we will in fact present a complete proof of security whenm O(2n) for the Benes Scheme, with an explicit O function. Therefore it is possible to improve all the security bounds on the cryptographic constructions based on Benes (such as in [19]) by using our O(2n) instead of f() · 2n− of [18].
2DEncryption Mode AHMED A. BELAL*
, 2001
"... In this paper, a new encryption mode, which we call the 2DEncryption Mode, is presented It has good security and practical properties We first look at the type of problems it tries to solve, then describe the technique and its properties, and present a detailed mathematical analysis of its security ..."
Abstract
 Add to MetaCart
In this paper, a new encryption mode, which we call the 2DEncryption Mode, is presented It has good security and practical properties We first look at the type of problems it tries to solve, then describe the technique and its properties, and present a detailed mathematical analysis of its security, and finally