PPT-1 Secure Networks Cryptography

Access Control Firewalls Host Hardening Application Security Data Protection Protect Threat Environment Incident Response Planning amp Policy Plan Respond 2 Threat Defense 3 The Threats . edu Abstract In cryptography secure channels enable the con64257dential and authenticated message ex change between authorized users A generic approach of constructing such channels is by combining an encryption primitive with an authentication primi /CS594 . Computer and Network Security. Dr. . Jinyuan. (Stella) Sun. Dept. of Electrical Engineering and Computer Science. University of Tennessee . Fall . 2011. 1. Introduction to Cryptography. What is cryptography?. ®. Common Body of . Knowledge Review:. . Cryptography Domain – . Part 2. Version: . 5.9.2. - . 2. -. Learning Objective. Cryptography Domain. The Cryptography domain addresses the principles, means, and methods of applying mathematical algorithms and data transformations to information to ensure its integrity, confidentiality, and authentication.. Princeton University . Spring 2010. Boaz Barak. Please . stop me if you have questions!. 2. Cryptography. History of 2500- 4000 years.. Recurring theme: . (until 1970’s). Secret code invented. Typically claimed “unbreakable” by inventor. Network Security Basics. Definitions. Principles. Crypto. Defining Security. Policies. and . mechanisms. for preserving desirable protection . properties. over data and resources.. We reason about security in terms of properties. What is cryptography?. The study and practice of using encryption techniques for secure communication. Mainly about creation and analysis of protocols that keep private messages private. Utilizes mathematics, computer science and electrical engineering in its use. Joshua Davies. Director of Architecture – 2Xoffice. Author of “Implementing SSL/TLS Using Cryptography and PKI”. Outline. Cryptographic concepts. Symmetric Cryptography. Public-key cryptography. Cryptography Lecture 1 0 A fixed-length MAC Construction Let F be a length-preserving pseudorandom function (aka block cipher) Construct the following MAC  : Gen: choose a uniform key k for F Mac Cryptography Lecture 8 Pseudorandom functions Keyed functions Let F: {0,1} * x {0,1} *  {0,1} * be an efficient, deterministic algorithm Define F k (x) = F(k, x) The first input is called the Cryptography Lecture 9 Arpita Patra © Arpita Patra Recall Attack on cpa -secure scheme from PRF >> cpa -security to cca -security Definitions- cma , scma , cmva , scmva >> MAC Cryptography Lecture 7 Pseudorandom functions Keyed functions Let F: {0,1} * x {0,1} *  {0,1} * be an efficient, deterministic algorithm Define F k (x) = F(k, x) The first input is called the The . art and science of concealing the messages to introduce secrecy in . information security . is recognized as cryptography. .. The word ‘cryptography’ was coined by combining two Greek words, ‘Krypto’ . . Patra. Quick Recall and Today’s Roadmap. >> CPA & CPA-. mult. security. >> Equivalence of CPA and CPA-. mult. security. >> El . Gamal. Encryption Scheme. >> . Hybrid Encryption (PKE from PKE + SKE with almost the same efficiency of SKE) . Exam is 1 week from today. May try to find an overflow room. Will post information on Piazza. Covers material up to and including today’s lecture. Open book/notes. No electronic devices. Practice midterm posted.