Unformatted text preview: F such that for all a,b ∈ { , 1 } , for all public key K , if A and B are ciphertexts of a and b under public key K , respectively, then F ( A,B ) is a ciphertext of f ( a,b ) under public key K . 4 MAC based on Encryption We construct a MAC scheme based on a good block cipher E(). Suppose the block size is ‘ . For an ‘bit message m and an ‘bit MAC key k , the MAC is deﬁned as the ﬁrst ‘/n bits of E k ( m ), where n is a constant. Is the above MAC scheme secure? Why or why not? 1...
View
Full
Document
This note was uploaded on 09/27/2010 for the course CSE 664 taught by Professor Shengzhong during the Spring '10 term at SUNY Buffalo.
 Spring '10
 SHENGZHONG
 Computer Security

Click to edit the document details