Question

In: Computer Science

Topic: Encrypt-then-authenticate scheme, Cryptography Let ΠE = (GenE, EncE, DecE) be an encryption scheme and ΠM...

Topic: Encrypt-then-authenticate scheme, Cryptography

Let ΠE = (GenE, EncE, DecE) be an encryption scheme and ΠM = (GenM, MacM, VrfyM) be a MAC scheme.

(b) Prove that Π is unforgeable for any encryption scheme ΠE (even if not CPA-secure) and any secure MAC scheme ΠM (even if not strongly secure).

Solutions

Expert Solution

SOLUTION-

(b) If ENC is a symmetric encryption scheme secure in the sense
of IND-CPA and MAC is a secure MAC family then method EtA(ENC, MAC)
implements secure channels.

  • Encryption then authenticate provides integrity of Ciphertext. Assuming the MAC shared secret has not been compromised, it is ble to deduce whether a given ciphertext is indeed authentic or has been forged; for example, in public-key cryptography anyone can send you messages. EtM ensures you only read valid messages.
  • Plaintext integrity.
  • If the cipher scheme is maliable we need not be so concerned since the MAC will filter out this invalid ciphertext.
  • The MAC does not provide any information on the plaintext since, assuming the output of the cipher appears random, so does the MAC. In other words, we haven't carried any structure from the plaintext into the MAC.

The function snd represents the operations and transformations applied
to a message by its sender in order to protect it from adversarial action over
the communication links. Namely, when a message m is to be transmitted from
party P to party Q under a session s established between these parties, the
function snd is applied to m and, possibly, to additional information such as a
message identifier. The definition of snd typically consists of the application of
some combination of a MAC and symmetric encryption keyed via the session
key. The function rcv describes the action at the receiving end for “decoding”
and verifying incoming messages, and it typically involves the verification of a
MAC and/or the decryption of an incoming ciphertext.

IF YOU HAVE ANY DOUBT PLEASE COMMENT DOWN BELOW I WILL SOLVE IT FOR YOU:)
----------------PLEASE RATE THE ANSWER-----------THANK YOU!!!!!!!!----------


Related Solutions

Topic: Encrypt-then-authenticate scheme, Cryptography Let ΠE = (GenE, EncE, DecE) be an encryption scheme and ΠM...
Topic: Encrypt-then-authenticate scheme, Cryptography Let ΠE = (GenE, EncE, DecE) be an encryption scheme and ΠM = (GenM, MacM, VrfyM) be a MAC scheme. (a) Formalize the construction of the “encrypt-then-authenticate” scheme Π = (Gen, Enc, Dec) given ΠE and ΠM
How do we encrypt? Explain modern symmetric cryptography. Explain the digital signature scheme. Explain the cryptography...
How do we encrypt? Explain modern symmetric cryptography. Explain the digital signature scheme. Explain the cryptography tools. What is digital signature? What is steganography? Explain the protocol for secure communications.
One research topic in cryptography is to create homomorphic encryption schemes. In such schemes, it is...
One research topic in cryptography is to create homomorphic encryption schemes. In such schemes, it is possible to do operations on the ciphertext without performing decryption. Give an example of where homomorphic encryption would be useful. You do not have to give a specific cryptographic method but describe a situation where you would want to do computations on ciphertext. Be specific: what is the information, what is encrypted, and what the computation is. Related concept: given an RSA scheme with...
These questions are about math cryptography 1) Encrypt the plaintext "this is a secret message" using...
These questions are about math cryptography 1) Encrypt the plaintext "this is a secret message" using the affine function f(x) = 5x + 7 mod 26. 2) Determine the number of divisors of 2n, where n is a positive integer.
what are the Vulnerabilites of honey encryption algorithm in cryptography? please give a detailed list with...
what are the Vulnerabilites of honey encryption algorithm in cryptography? please give a detailed list with descritpions.
All of the remaining questions involve the following toy encryption scheme. It encrypts plaintexts that consist...
All of the remaining questions involve the following toy encryption scheme. It encrypts plaintexts that consist of only uppercase letters and the underscore character (27 characters total): ABCDEFGHIJKLMNOPQRSTUVWXYZ_ Note that the underscore character is part of the alphabet and will also be encrypted. A key in this scheme consists of 4 digits, each from 0 to 9. Each digit tells how much to shift one character, that is, change it to the character that many positions later in the alphabet....
Cyber security Cryptography Homework Part 1: Find good encryption solutions Search the web for various commercial...
Cyber security Cryptography Homework Part 1: Find good encryption solutions Search the web for various commercial encryption algorithms. Find one that you feel may be “snake oil”. Write a report explaining the encryption algorithm and your opinion *in-text citations and references are required *written in at least 2~3 paragraphs
This is the Cryptography question . I wanted to know correct period with explanation Let the...
This is the Cryptography question . I wanted to know correct period with explanation Let the LFSR be xn+5 = xn + xn+3, where the initial values are x0=0, x1=1, x2=0, x3=0, x4=0. (a) Compute first 20 bits of the above LFSR. (b) What is the period?
Consider the following 3-person encryption scheme based on RSA. L (can be trusted in this case)...
Consider the following 3-person encryption scheme based on RSA. L (can be trusted in this case) generates two large primes p and q, calculates both n and φ(n). L also chooses k1, k2 and k3 such that GCD(ki,n) = 1 and k1k2k3 ≡ 1 mod φ(n). Keys are securely distributed to three others as follows: G: <n,k1,k2 > J: < n, k2, k3 > Z: < n, k3, k1 > Answer the following questions. (a) G has a message M1...
Topic is cryptography 10.increment the digits 858 of the ISBN of the text (ISBN13: 9780890068588) to...
Topic is cryptography 10.increment the digits 858 of the ISBN of the text (ISBN13: 9780890068588) to be 859. Then, by trial and error, change the check-sum (the last digit of the ISBN), to identify the title of the next book published by Artech House.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT