Skip to main content

Recently Updated Pages

Chosen Plaintext Attacks (CPAs)

CS Computer Security Cryptography

Our attacker knows a set of plaintexts which can be encrypted and he wants to understand which on...

Updated 2 years ago by Paolo Basso

Computationally secure ciphers and pseudorandom number generators

CS Computer Security Cryptography

A modern practical assumption is to build ciphers such that a successful attack is carried only i...

Updated 2 years ago by Paolo Basso

Exercises on web security

CS Computer Security Web security

2021-2022 Demo exam exercise 4 (6 points) LetsComplain is a new website for students and profs. S...

Updated 2 years ago by Paolo Basso

Cross Site Scripting (XSS)

CS Computer Security Web security

Cross site scripting is a vulnerability by means of which client-side code can be injected in a p...

Updated 2 years ago by Paolo Basso

Cross-Site Requests Forgery (CSRF)

CS Computer Security Web security

Cross-site request forgery (also known as CSRF) is a web security vulnerability that allows an at...

Updated 2 years ago by Paolo Basso

Other vulnerabilities

CS Computer Security Web security

Freudian slips (information leaks) Dettailed error messages Display user-supplied data in errors...

Updated 2 years ago by Paolo Basso

Cookies and sessions

CS Computer Security Web security

HTTP is stateless and almost uniderectionl. Web application, on the other hand, need to keep a st...

Updated 2 years ago by Paolo Basso

SQL injection

CS Computer Security Web security

SQL injection is a web security vulnerability that allows an attacker to interfere with the queri...

Updated 2 years ago by Paolo Basso

Introduction to web security

CS Computer Security Web security

Web application are built on top of HTTP, which is a stateless protocol that has only weak authe...

Updated 2 years ago by Paolo Basso

Exercises on malwares

CS Computer Security Malwares

2021-2022 Demo exam exercise 6 Our systems have been compromised by very powerful malware. Luckil...

Updated 2 years ago by Paolo Basso

Defending againts malware and stealth techniques

CS Computer Security Malwares

Patches: most worms exploit known vulnerabilities Signatures: must be developed automatically ...

Updated 2 years ago by Paolo Basso

Access control

CS Computer Security Introduction, authentication and access...

Reference monitor The reference motior enforces access control policies ("who does what on which ...

Updated 2 years ago by Paolo Basso

Exercises on authentication and access control

CS Computer Security Introduction, authentication and access...

2021-2022 Demo exam exercise 1 (4 points) In a company, each employee works in an open space. We ...

Updated 2 years ago by Paolo Basso

Authentication

CS Computer Security Introduction, authentication and access...

Identification is when an entity declares its identity ("I am Stefano", "I am Michele", ...) whil...

Updated 2 years ago by Paolo Basso

Exercises on introduction

CS Computer Security Introduction, authentication and access...

Question 0 Consider the phenomenon of identity stealing in social networks (e.g., Facebook, Twitt...

Updated 2 years ago by Paolo Basso

Malwares introduction

CS Computer Security Malwares

"Malware" is a portmanteau of "malicious software": code that is intentionally written to violate...

Updated 2 years ago by Paolo Basso

Introduction to computer security

CS Computer Security Introduction, authentication and access...

CIA Paradigm The CIA paradigm for information security states three desiderata: Confidentiality...

Updated 2 years ago by Paolo Basso

Course information

CS Computer Security

Complete course name: 055633 - COMPUTER SECURITY - UIC 587 (ZANERO STEFANO) Profesor: Stefano ...

Updated 2 years ago by Paolo Basso

Tomasulo Algorithm

ACA Advanced Computer Architectures

Tomasulo introduces the Implicit Register Renaming to avoid WAR & WAW hazards. In the Tomasulo ar...

Updated 2 years ago by Paolo Basso

Instruction level parallelism

ACA Advanced Computer Architectures

Multi-cycle pipelining We make the following basic assumptions: single-issue processors: one in...

Updated 2 years ago by Paolo Basso