COURSE UNIT TITLE

: SECURITY AND PRIVACY ENGINEERING

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
ELECTIVE

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

ASSOCIATE PROFESSOR GÖKHAN DALKILIÇ

Offered to

Ph.D. in Computer Science (English)
Computer Science
Computer Engineering (Non-Thesis-Evening) (English)
Computer Engineering Non-Thesis (English)
Computer Engineering (English)
Computer Engineering (English)
COMPUTER ENGINEERING (ENGLISH)

Course Objective

The course intends to introduce students to principles of engineering secure systems and to equip students with working knowledge of Mathematics of security algorithms, privacy issues, computer network security and ancryption algorithms

Learning Outcomes of the Course Unit

1   Identify and apply number theory techniques to data encryption and security problems
2   Present a functional knowledge of privacy.
3   Specify, analyze and prove correctness for security and privacy algorithms
4   Design secure systems that respect privacy laws.
5   Identify security and privacy threats

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction to Security and Privacy Issues
2 Elementary Number Theory
3 Prime Numbers and Primality Testing
4 Symmetric Ciphers, DES
5 Discrete Logarithm Problem, PKI, RSA
6 Authentication, Hashing, Digital Signatures
7 Risks and threats to security and protection of personal data
8 Secret Sharing Algorithms
9 Privacy Related Algorithms
10 Protection of personal data: Legal principles and computer security
11 Security at Systems Level
12 Secure Electronic Voting Example
13 Protection of health data, other examples
14 Review

Recomended or Required Reading

Textbook(s):
Stallings, W., Network Security Essentials 4th Edition, Prentice Hall, New Jersey, 2010, ISBN 0137067925
Edited by G. Goos, J. Hartmanis and J. van Leeuwen, IT-Security And Privacy, Design and Useof Privacy-Enhancing Security Systems, Lecture Notes in Computer Science, Springer, 2001.
Supplementary Book(s): Eynden, Charles, V. Elementary Number Theory, Mc Graw Hill, 2001.
References: Schneier, Bruce. Applied Cryptography, John Wiley and Sons, 1996.
Anderson Ross J., Security Engineering: A Guide to Building Dependable Distributed Systems, Wiley Publishing, 2008, ISBN: 978-0-470-06852-6
Materials: Lecture Notes,problem sets.

Planned Learning Activities and Teaching Methods

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 ASG ASSIGNMENT
3 FIN FINAL EXAM
4 FCG FINAL COURSE GRADE MTE * 0.30 +ASG * 0.20 +FIN * 0.50
5 RST RESIT
6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + ASG * 0.20 + RST * 0.50


Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

Dokuz Eylul University
Department of Computer Engineering
Tinaztepe Campus 35160 BUCA/IZMIR
Tel: +90 (232) 301 74 01

Office Hours

TBA in the first lecture

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 3 42
Preparations before/after weekly lectures 13 5 65
Preparation for midterm exam 2 10 20
Preparation for final exam 1 15 15
Preparation for quiz etc. 3 3 9
Preparing assignments 4 4 16
Reading 3 7 21
Final 1 2 2
Midterm 2 2 4
Quiz etc. 3 3 9
TOTAL WORKLOAD (hours) 203

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.1445
LO.2345
LO.3445
LO.4434
LO.5434

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS