CS 519/ECE 599 (Special Topic):  Applied Cryptography


Course Information Objectives and Syllabus | Prerequisites | Course Schedule and Materials | Announcements and Deadlines Research Projects |  In-class Presentations | Take-Homes   | Grading | 

Winter  2018
School of Electrical Engineering and Computer Science
Oregon State University


Course Information

Instructor:

Dr. Attila A. Yavuz

Office:

Kelley Engineering Center 3065

Email:

Attila.Yavuz@oregonstate.edu

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

Classroom:

STAG 112 

Time:

MW 2:00 – 3:50 PM

Office hours:

Tuesday 4:00 – 6:00 PM 


Course Objectives and Syllabus

This course covers essential concepts of cryptographic primitives, applied cryptography tools, specialized authentication methods and digital signatures. This course also focuses on the latest security and privacy issues in applied cryptography domain and their applications. Finally, this course explores the state-of-art applied cryptography research problems and solutions via literature survey and research projects. Remark that this is a research-oriented course, in which students are expected to read  research papers, conduct surveys on recently emerging topics in applied cryptography  domain, and finally develop original solutions to important problems. By the end of this course, successful students will have a good understanding of applied cryptography and network security essentials, which will help them as a differentiating factor to obtain competitive R&D positions in industry. Furthermore, the students will gain experience on conducting research and writing (preliminary) papers in applied cryptography  domain. The objective is to encourage/prepare interested students to purse advanced degrees in security and privacy fields.

PLEASE SEE  SYLLABUS.

Prerequisites

An Introduction-Level security course is recomended.   A good programming knowledge on C/C++ and/or Java is recommended. However, these prerequisites will not be enforced, and open to discussion.  Please contact with  the instructor if you have doubts. 


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.

Recommended Material to Recap:  Assuming you have already taken crypto/security classes, please recap on  cryptographic hash functions, block-ciphers, encryption modes, basic number theory including multiplicative inverse, cyclic-multiplicative groups, generators, totient-functions, RSA, DH, Elgamal, Schnorr signatures. These are the minimum background information you will need.

Recommended Books:  

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

Date Topics Research Papers and  Supplementary Materials Slides
01.08.2018
-
01.10.2018

 Objectives and Vision,
discussion on the course content and Syllabus

Start to Cryptographic Tools: Counter DoS-I

Slides


A. Juels and J. Brainard, "Client puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks." in: Proceedings of NDSS '99, 1999, pp. 151--165.

T. Aura, P. Nikander, and J. Leiwo, "DoS-Resistant Authentication with Client Puzzles." In Proceedings of the 8th International Workshop on Security Protocols, LNCS 2133, 170-177.
MAIN: Intro


CryptoTools_DoS

Bloomfilternotes

01.15.2018
-
01.17.2018
Continue Cryptographic Tools: Counter DoS I-II

Rabin IDA, Shamir Secret Sharing Bloom Filter

Start Broadcast Authentication Protocols





A. Shamir, "How to share a secret", Communications of the ACM, Vol. 22, No. 11, pages 612-613, 1970.

Secret Sharing on Wikipedia


Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance by Michael O. Rabin

https://en.wikipedia.org/wiki/Bloom_filter

A. Perrig, R. Canetti, D. Song, and D. Tygar, “Efficient Authentication and Signing of Multicast Streams over Lossy Channels,” in Proc. of IEEE Security and Privacy Symposium, May 2000.

A. Perrig, R. Canetti, D. Song, and D. Tygar, “Efficient and Secure Source Authentication for Multicast,” in Proceedings of Network and Distributed System Security Symposium, February 2001

CryptoTools_DoS

Broadcast Authentication


01.22.2018
-
01.24.2018
Finish Broadcast Authentication Protocols
TESLA
EMSS

Start Elliptic Curve Cryptography: Introduction



                                                    A comprehensive book on ECC
Broadcast Authentication

ECC_Guideline

ECC_Supplementary
01.29.2018
-
01.31.2018
Continue Elliptic Curve Cryptography

Basic Schemes
Cryptographic Pairing with applications
ECDSA Basics             
 https://en.wikipedia.org/wiki/Elliptic_Curve_Digital_Signature_Algorithm

ECMQV

http://mil-embedded.com/pdfs/Certicom.Spr06.pdf

Identity-Based Encryption from the Weil Pairing

https://crypto.stanford.edu/~dabo/papers/bfibe.pdf

Aggregate and Verifiably Encrypted Signatures from Bilinear Maps

https://crypto.stanford.edu/~dabo/pubs/papers/aggreg.pdf
Cryptographic Pairing

ECC_Recent Results
02.05.2018
-
02.07.2018
                      Advanced Authentication Techniques - I :
                     Embedded Digital Signatures 

ECC in Action for Embedded IoTs

Heterogeneous Digital Signatures

Compromise-Resilient and Compact Digital Signatures

Low Cost Standard Public Key Cryptography Services for Wireless IoT Systems

http://web.engr.oregonstate.edu/~yavuza/article/17/OzmenYavuz_iot10.pdf

ETA: Efficient and Tiny Authentication for Heterogeneous Wireless Systems

http://web.engr.oregonstate.edu/~yavuza/article/0613/Wisec2013.pdf

BAF and FI-BAF: Efficient and Publicly Verifiable Secure Audit Logging for Resource-Constrained Devices

http://web.engr.oregonstate.edu/~yavuza/article/0613/TISSEC2012.pdf



LowEnergySuite



AdvancedAuthentication-I
02.12.2018
-
02.14.2018

Continue Compromise-Resilient and Compact Digital Signatures
Proof  Methods and Principles

Student Presentations Begin


     
Student Slides TBA AdvancedAuthentication-I
                  TBA   Student presentations and schedule will be announced TBA
TBA Optional Guest Lectures will be announced  TBA

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. 

Announcements and Deadlines:


Research Projects and Survey/Scouting Topics

Discussed in detail in Introduction class and office hours.


In-class presentation assignments 

The objective of this assignment is twofold:

(i) To identify critical technology trends and innovation paths in network security, it is very important to know where to look for the state-of-art developments. This assignment will enable students to learn the top venues in security and privacy field and perform scouting activities on important topics.

(ii) Students will gain experience on presenting advanced  research topics and  papers, which is an invaluable skill for both industry and academia.

Paper Selection:
The Instructor will assign a topic to a student. The student then may select one or two papers of that they prefer from top cryptography or network security conferences/journals. The papers must be discussed with the Instructor beforehand:

Please look for Rank 1 or Rank 2 only. The selected paper(s) must  be recently (e.g., 2014-2018)  published, unless it is a fundamental paper.

http://faculty.cs.tamu.edu/guofei/sec_conf_stat.htm

Another  useful list is:

http://jianying.space/conference-ranking.html


In-class presentations are an essential part of this course and will be evaluated strictly. There are several aspects that will help  students to deliver a good presentation:

Evaluation Criteria: Responsibilities of the presenter (not just a presentation, but a lecture!): Note that 75-80 minutes is a plenty of time. Instead of presenting two papers independently, the presenter must follow a strategy that will turn these paper presentations into a cohesive lecture. That is, if needed, the presenter may present only one paper, but before that spend half hour on required preliminaries and math concepts, which are needed to fully understand the paper. In addition to this, the presenter must prepare the following: Note: Depending on the size of class, the students may give just one or two  presentations. The grades for such case will be adjusted fairly. 

Remark: Students must send their "selected paper" latest by TBA  to the instructor for consent and feedback. The slides of the presentation  must be provided to the instructor a week (or earlier) before from the actual presentation so that it will be made available in course website. 


Take-Home Assignments

Optional: Students must work individually unless otherwise specified. For the collaborative problems (if it is assigned), you may form a team of 2 person (only students in this class) to work together. After discussing the problems, please write up your answers individually. Indicate the names of the other members in your team.

Unless otherwise specified here, currently, no take-home will be assigned.

Grading

The basic grading policy is as follows:

    • In-class paper presentations (20% each presentation, total %40,  extra credit is possible)
    • Research project (50%) (extra credit is possible for successful deliveries, may supersede survey/scouting report for promising progress) --> Please see Syllabus
    • Class attendance, participation/discussions (%10)
    Take-home assignments (. %) (optional, late take-homes are not accepted)

Grading will work in favor of the student as long as she/he shows a full commitment, which is quantified by regular progress and deliveries.