Introduction to Computer Security 1

Course guarantor:

Petr Vokáč

Lecturer:

Petr Vokáč

Tutor:

Petr Vokáč

Supervisor:

Department of Mathematics

Synopsis:

1. Designing secure systems

2. Secure programming techniques, static code analysis

3. Buffer overflow

4. Securing operation systems

5. Running untrusted code (sandboxing)

Requirements:

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Acquired knowledge:

Get familiar with thread modeling, common attacks originating from insecure code and techniques for achieving security. Learn security features provided by operating system to run securely untrustworthy computer code.

Acquired skills:

Design, implement and operate secure computer systems.

Study materials:

Literature:

[1] Akritidis, Periklis, Manuel Costa, et al.: Baggy Bounds Checking: An Efficient and Backwards-Compatible Defense against Out-of-Bounds Errors, USENIX Security Symposium, August 2009

[2] Neuman B.C., Ts?o T.: Kerberos: An authentication service for computer networks, IEEE Communications Magazine, September 1994

[3] Loscocco P., Smalley S.: Integrating Flexible Support for Security Policies into the Linux Operating System, Proceedings of the FREENIX, June 2001

[4] Howard M., LeBlanc M.: Writing Secure Code (2nd Edition), Microsoft Press, 2002

[5] Wheeler D.: Secure Programming HOWTO, 2015

[6] Rosenberg J., Remy D.: Securing web service with WS-security, SAMS, May 2004

[7] Russinovich M., Solomon D., Ionescu A.: Windows Internals (6th Edition), Microsoft Press, 2012

Note:

Time-table for winter semester 2025/2026:

Time-table is not available yet

Time-table for summer semester 2025/2026:

Time-table is not available yet

The course is a part of the following study plans:

• Fyzikální inženýrství - Počítačová fyzika (elective course)
• Aplikovaná informatika (elective course)
• Matematické inženýrství - Matematická informatika (elective course)