1 CIS 5371 Cryptography 4. Message Authentication Codes B ased on: Jonathan Katz and Yehuda Lindell Introduction to Modern Cryptography.

Slides:

Advertisements

Similar presentations

CS555Spring 2012/Topic 171 Cryptography CS 555 Topic 17: Textbook RSA encryption.

Advertisements

Dan Boneh Using block ciphers Modes of operation: one time key Online Cryptography Course Dan Boneh example: encrypted , new key for every message.

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (3) Information Security.

Dan Boneh Public key encryption from Diffie-Hellman ElGamal Variants With Better Security Online Cryptography Course Dan Boneh.

CIS 5371 Cryptography 3b. Pseudorandomness.

1 CIS 5371 Cryptography 4. Collision Resistant Hash Functions B ased on: Jonathan Katz and Yehuda Lindell Introduction to Modern Cryptography.

TinySec: Security for TinyOS Chris Karlof Naveen Sastry David Wagner January 15, 2003

CMSC 456 Introduction to Cryptography

CMSC 414 Computer and Network Security Lecture 5 Jonathan Katz.

CMSC 414 Computer and Network Security Lecture 4 Jonathan Katz.

6. Practical Constructions of Symmetric-Key Primitives

1 CSE 5351: Introduction to Cryptography Ten H. Lai Spring 2015 MW 3:55-5:15 PM, CL133.

CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.

Dan Boneh Authenticated Encryption Definitions Online Cryptography Course Dan Boneh.

1 CIS 5371 Cryptography 3. Private-Key Encryption and Pseudorandomness B ased on: Jonathan Katz and Yehuda Lindel Introduction to Modern Cryptography.

CS 4/585: Cryptography Tom Shrimpton FAB

Cryptographic Hash Functions Message Authentication Digital Signatures.

Lecture 4.1: Hash Functions, and Message Authentication Codes CS 436/636/736 Spring 2015 Nitesh Saxena.

CS555Spring 2012/Topic 111 Cryptography CS 555 Topic 11: Encryption Modes and CCA Security.

Dan Boneh Using block ciphers Modes of operation: many time key (CTR) Online Cryptography Course Dan Boneh Example applications: 1. File systems: Same.

CMSC 414 Computer and Network Security Lecture 5 Jonathan Katz.

ISEP / Fakulta Elektrotecknika 1 Project Of Telecommunication Subject: Describe following “ MAC - Message Authentication Code " modes: Describe following.

1 CIS 5371 Cryptography 5a. Pseudorandom Objects in Practice Block Ciphers B ased on: Jonathan Katz and Yehuda Lindell Introduction to Modern Cryptography.

Integrity via Encryption with Redundancy  Question: Encryption is not ideal for authentication. But, can we gain security advantages if we add recognizable.

A Quick Tour of Cryptographic Primitives Anupam Datta CMU Fall A: Foundations of Security and Privacy.

Class 3 Cryptography Refresher II CIS 755: Advanced Computer Security Spring 2014 Eugene Vasserman

PKCS #5: Password-Based Cryptography Standard

1 Symmetric-Key Encryption CSE 5351: Introduction to Cryptography Reading assignment: Chapter 2 Chapter 3 (sections ) You may skip proofs, but are.

CS555Spring 2012/Topic 71 Cryptography CS 555 Topic 7: Stream Ciphers and CPA Security.

CS555Spring 2012/Topic 81 Cryptography CS 555 Topic 8: Pseudorandom Functions and CPA Security.

Ryan Henry I 538 /B 609 : Introduction to Cryptography.

Cryptography Lecture 9 Arpita Patra © Arpita Patra.

PKCS #5 v2.0: Password-Based Cryptography Standard

CS555Spring 2012/Topic 151 Cryptography CS 555 Topic 15: HMAC, Combining Encryption & Authentication.

Part 1  Cryptography 1 Integrity Part 1  Cryptography 2 Data Integrity  Integrity  detect unauthorized writing (i.e., modification of data)  Example:

Cryptography Lecture 10 Arpita Patra © Arpita Patra.

Cryptography Lecture 6 Arpita Patra. Quick Recall and Today’s Roadmap >> MAC for fixed-length messages >> Domain Extension for MAC >> Authenticated Encryption:

CS555Spring 2012/Topic 141 Cryptography CS 555 Topic 14: CBC-MAC & Hash Functions.

Understanding Cryptography by Christof Paar and Jan Pelzl These slides were prepared by Christof Paar and Jan Pelzl Chapter 12.

RSA Laboratories’ PKCS Series - a Tutorial

Message Authentication Codes

Homework 1 Due: Thursday at 9 AM (beginning of class)

Cryptography CS 555 Topic 15: Stream Ciphers.

Digital signatures.

Topic 11: Authenticated Encryption + CCA-Security

Cryptography Lecture 13.

Cryptography Lecture 12.

Topic 5: Constructing Secure Encryption Schemes

Cryptography Lecture 10.

Topic 7: Pseudorandom Functions and CPA-Security

Block cipher and modes of encryptions

Cryptography Lecture 11.

Symmetric-Key Encryption

Cryptography Lecture 12 Arpita Patra © Arpita Patra.

Cryptography Lecture 11.

Cryptography Lecture 9.

Cryptography Lecture 12.

Topic 13: Message Authentication Code

Cryptography Lecture 14.

Hashing Hash are the auxiliary values that are used in cryptography.

Cryptography Lecture 13.

Cryptography Lecture 10.

Cryptography Lecture 9.

Cryptography Lecture 11.

Cryptography Lecture 10.

Cryptography Lecture 13.

CIS 5371 Cryptography 2. Perfect Secret Encryption

Presentation transcript:

1 CIS 5371 Cryptography 4. Message Authentication Codes B ased on: Jonathan Katz and Yehuda Lindell Introduction to Modern Cryptography

2 Message Authentication Codes

3 Definition 4.1 Message Authentication Code

4

5 Definition Secure MAC

6 Construction 4.3 A fixed length MAC from any PRF

7 Theorem 4.4

8 A secure fixed length MAC Proof

9 Distinguisher D

10 Distinguisher D

11 Distinguisher D

12 Replay atta cks

13 Construction 4.5 A variable length MAC

14 Theorem 4.6

15 Construction 4.9 CBC- MAC

16 Theorem 4.10

17 CBC-MAC vs CBC-mode encryption 1.CBC-mode encryption uses a random IV. If we use a random IV for CBS-MAC then we lose security. 2.In CBC-mode encryption all encrypted blocks are output as part of the ciphertext. This is not the case with CBC-MAC. If we do so we loose security.

18 Secure CBC-MAC for variable length messages – three options

19 Variable length CBC-MAC 