Provable-Security Analysis of Authenticated Encryption Based on Lesamnta-LW in the Ideal Cipher Model

Provable-Security Analysis of Authenticated Encryption in Kerberos∗

Kerberos is a widely-deployed network authentication protocol that is being considered for standardization. Many works have analyzed its security, identifying flaws and often suggesting fixes, thus helping the protocol’s evolution. Several recent results present successful formalmethods-based verification of a significant portion of the current version 5, and some even imply security in the com...

The Security of Multiple Encryption in the Ideal Cipher Model

Multiple encryption—the practice of composing a blockcipher several times with itself under independent keys—has received considerable attention of late from the standpoint of provable security. Despite these efforts proving definitive security bounds (i.e., with matching attacks) has remained elusive even for the special case of triple encryption. In this paper we close the gap by improving bo...

Improved convertible authenticated encryption scheme with provable security

Article history: Received 26 August 2010 Received in revised form 22 November 2010 Accepted 25 March 2011 Available online 14 April 2011 Communicated by L. Viganò

Analysis of One-pass Block Cipher Based Authenticated Encryption Schemes

Analysis of Stream Cipher Based Authenticated Encryption Schemes

Authenticated Encryption (AE) is the cryptographic process of providing simultaneous confidentiality and integrity protection to messages. This approach is more efficient than applying a two-step process of providing confidentiality for a message by encrypting the message, and in a separate pass providing integrity protection by generating a Message Authentication Code (MAC). AE using symmetric...