CS 578 / ECE 578:  Cyber-Security


Course Information Objectives and Syllabus | Prerequisites | Course Schedule and Materials | Announcements and Deadlines | Homeworks | Grading | 

Fall  2017
School of Electrical Engineering and Computer Science
Oregon State University


Course Information

Instructor:

Dr. Attila A. Yavuz

Office:

Kelley Engineering Center (KEC) 3065

Email:

Attila.Yavuz@oregonstate.edu

URL: http://web.engr.oregonstate.edu/~yavuza/

Classroom:

ROG 230

Time:

MW 2:00 PM -3:20  PM

Office hours:

Monday 4:30 PM – 6:00 PM at KEC 3065
TA:
Mr.  Muslum Ozgur Ozmen
TA Email:  ozmenmu@oregonstate.edu
TA Office hours:  Wednesday: 4:30 PM - 5:30 PM
Friday: 2:00 PM - 3:00 PM

Course Objectives and Syllabus

This course covers basic concepts and techniques incyber-security such as risks and vulnerabilities, applied cryptography and various network security protocols. This course focuses on essential security services such as authentication, confidentiality, integrity, and availability applied to networking systems. This course also explores fundamental techniques including authentication protocols, group key establishment, trusted intermediaries and public key infrastructures. This course aims providing a range of broad topics to incoming graduate students, with guest and advanced topic lectures from several OSU cyber-security experts. This will enable students to select a cyber-security path that is most suitable for their interest.  By the end of this course, successful students will have a good understanding of basic cryptographic tools, building blocks, their use in cyber-security protocols and various aspects of network security essentials. This course will prepare students for competitive R&D positions in the cybersecurity and network security field.

Please see syllabus

Prerequisites

A basic understanding of computer networks, algorithms and mathematical concepts are recommended. 

Course Schedule and Materials

The details of scheduling and course material (e.g., research papers, slides) will be provided as the course progresses. The material will be provided (generally) a few days advance. Students are strongly suggested to read research papers and slides before coming to the class. The material will be non-trivial and prior reading/familiarity will be very helpful.

No textbook is required. Handouts (i.e., lecture slides) and reading papers will be provided during the term (check the course website regularly for updates).  However, some optional books that may be useful, includes but are not limited to:

• Charlie Kaufman, Radia Perlman, and Mike Speciner, “Network Security: Private Communication in a Public World”, Second Edition, Prentice Hall.        

• Douglas R. Stinson, “Cryptography Theory and Practice, 3rd edition".

• Jonathan Katz & Yehuda Lindell , “Introduction to Modern Cryptography”.



Remark: The below schedule, topics and paper/presentations are tentative, it will be updated frequently, please check accordingly:
 

Date Topics  Materials/Slides

Week 1

 09.20.2017




Discussion on the course content and Syllabus

Basic security concepts and starting fundamental building blocks

Intro

Basics
Week 2

09.25.2017
-
09.27.2017
Fundamental Building Blocks

1) Cryptographic Hash Functions and Their Use
     I) Basics:
    a) Merkle-Damgard
    b) Essential properties
    c) Security requirements
    d)  Birthday paradox
   
     II) Use of Crypto Hashes
     a) Commitment
     b) Hash-based Message Authentication Code (HMAC)

Important  Hash-based Primitives
    
a) OTSs         
   
 b) Hash-chains and S/KEY
     c) Merkle-Hash tree

2) Block ciphers
    a) Design principles
    b) DES basics, AES
    

    



Basic Cont's

Cryptographic Hash Functions and Their Applications

Hash-based Authentication Primitives-I


Block Ciphers







Week 3

10.02.2017
-
10.04.2017



   Block cipher Cont'
    c) Selected Modes
    d)  Security Model: IND-CPA 



Block-cipher cont'

Block Ciphers

Slides are complementary to the board and provides further examples

Optional hash-based primitives

Hash-based Authentication Primitives-II

Hand Notes: Compromise-Resilient and Aggregate Symmetric MAC and DLP Basics

DiscreteLogBasics_FWSecProtocol.pdf



Week 4

10.09.2017
-
10.11.2017
Guest Lecture, Mike Rosulek
1)       RSA Encryption and Signatures

2)    Selected topics
Dr. Mike Rorulek Guest Lecture on RSA and RSA-based Techniques/Attacks

http://web.engr.oregonstate.edu/~rosulekm/crypto/chap13.pdf




Week 5
 
10.16.2017
-
10.18.2017

Public Key Cryptography and OTS-Variants

Number theory basics, Discrete Logarith Problem

Diffe-Hellman

Man-in-the-middle attack and PKI

Hand Notes: One-time Signature Variants

OTSVariants


Hand Notes: Little-Fermat (see also DiscreteBasics pdf in Week 3)

LittleFermat_RSA_KG

Hand Notes: DLP Basics

DLP_I

DLP_II

Hand Notes: Diffie-Hellman

DH_I

DH_II

Hand Notes: Elgamal

ElGamal_I

ElGamal_II

Supplementary Slides

DH_RSA_DSA:

RSA_DH_DSA


Basic Number Theory

BasicNumberTheory


             Week 6
 
            10.23.2017
                   -
            10.25.2017
                                  DLP-based Signatures (DSA, Schnorr, Elgamal Cont')


                                         10.25.2017 MIDTERM
                                                                           

                                                              Hand Notes:  Schnorr Signatures

                                                                Schnorr Signatures

                                                                DSA and Security of Signatures (EU-CMA Model)

                                                                 DSA_EUCMA


              Week 7
 
            10.30.2017
                   -
            11.01.2017
                                                 Secure Boot (HW and SW  Perspectives)                                               Dr. Jesse Walker Guest Lecture (2 lectures)
              Week 8
 
            11.06.2017
                   -
            11.08.2017
                                     Authentication Pittfalls

                                      Needham-Schroeder Protocol
                                       Otway-Rees Protocol
                                        Kerberos (Time Permitting)
                 
            Week 9
 
            11.13.2017
                   -
            11.15.2017
                                        Privacy Enhancing Technologies

                                         Dynamic Symmetric Searchable Encryption

                                         Oblivious Random Access Memory (ORAM)   
                                                 
                                           Mr. Hoang Thang (Guest Lecture on 11.15.2017)
          Week 10
 
            11.20.2017
                   -
            11.22.2017
Final Week Final
-


Unless otherwise specified, described  papers and presentations are given by the Instructor with the exceptions of "Selected Topics Presentations" and" Research Project Presentations", which are given by students. Responsible students and topics will be announced later (please see respective (prospective) deadlines).

How to obtain research papers
: Unless otherwise specified, you can obtain them from the ACM Digital Library or the IEEE Digital Library. OSU has subscriptions to both, so all you have to do is (1) be using an OSU IP# and you can just go to the ACM Digital Library or IEEE Xplore directly, or (2) if you're working from elsewhere, go to the OSU Library e-journals access page, make your way to the ACM Digital Library or the IEEE Digital Library, and be ready to type in your ONID username and password.

Announcements and Deadlines:



Homework Assignments

Students must work individually unless otherwise specified.

There will be potentially four homework assignments:

Homework 1 will be announced here.

Answer key(s) for Homework 1 will be  here.

Homework 2 will be announced here.

Answer key(s) for Homework 2 will be here.

Homework 3 will be announced here.

Answer key(s) for Homework 3 will be here.
 



Grading

The basic grading policy is as follows (subject to change):

    Homework assignments (45%)
    • Midterm (25%) 
    • Final  (25%)
    • Class attendance, participation/discussions (potential quizzes) (%5)
    • Optional extra-credit assigments are possible