Midterm NS 23.04.2008 Note = Anzahl Pkte/48 x 5 + 1 1.4/4; 2. 4/4; 3. 4/4; 4. 4/4 5. 16/16; 6. 16/16 2.Durchschnitt: 4.5.

Slides:



Advertisements
Similar presentations
Chapter 10 Real world security protocols
Advertisements

Key distribution and certification In the case of public key encryption model the authenticity of the public key of each partner in the communication must.
Chapter 14 From Cryptography and Network Security Fourth Edition written by William Stallings, and Lecture slides by Lawrie Brown, the Australian Defence.
Implementation of a Two-way Authentication Protocol Using Shared Key with Hash CS265 Sec. 2 David Wang.
Public Key Infrastructure (PKI) Providing secure communications and authentication over an open network.
19.1 Silberschatz, Galvin and Gagne ©2003 Operating System Concepts with Java Chapter 19: Security The Security Problem Authentication Program Threats.
Security A system is secure if its resources are used and accessed as intended under all circumstances. It is not generally possible to achieve total security.
Kerberos Authenticating Over an Insecure Network.
CSI 400/500 Operating Systems Spring 2009 Lecture #20 – Security Measures Wednesday, April 29 th.
Chap 3: Key exchange protocols In most systems, we distinguish the short term keys from the long term ones: –A short term key (session key) is used to.
Security Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to: –Describe the reasons for having system.
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering.
Modelling and Analysing of Security Protocol: Lecture 1 Introductions to Modelling Protocols Tom Chothia CWI.
SSH : The Secure Shell By Rachana Maheswari CS265 Spring 2003.
Security Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to: –Describe the reasons for having system.
CSE331: Introduction to Networks and Security Lecture 24 Fall 2002.
More on AuthenticationCS-4513 D-term More on Authentication CS-4513 Distributed Computing Systems (Slides include materials from Operating System.
EEC 688/788 Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Security Module – Part 1 Spring 2006 V.T. Raja, Ph.D., Oregon State University.
Alexander Potapov.  Authentication definition  Protocol architectures  Cryptographic properties  Freshness  Types of attack on protocols  Two-way.
Designing Security In Web Applications Andrew Tomkowiak 10/8/2013 UW-Platteville Software Engineering Department
Lecture 9: Security via PGP CS 436/636/736 Spring 2012 Nitesh Saxena.
Computer Security Tran, Van Hoai Department of Systems & Networking Faculty of Computer Science & Engineering HCMC University of Technology.
Security. Cryptography Why Cryptography Symmetric Encryption – Key exchange Public-Key Cryptography – Key exchange – Certification.
Programming Satan’s Computer
Lecture 18 Page 1 CS 111 Online Design Principles for Secure Systems Economy Complete mediation Open design Separation of privileges Least privilege Least.
8-1Network Security Chapter 8 roadmap 8.1 What is network security? 8.2 Principles of cryptography 8.3 Message integrity, authentication.
Network Security – Part 2 (Continued) Lecture Notes for May 8, 2006 V.T. Raja, Ph.D., Oregon State University.
Dr. L. Christofi1 Local & Metropolitan Area Networks ACOE322 Lecture 8 Network Security.
Chapter 6 Electronic Mail Security MSc. NGUYEN CAO DAT Dr. TRAN VAN HOAI 1.
Kerberos Named after a mythological three-headed dog that guards the underworld of Hades, Kerberos is a network authentication protocol that was designed.
23-1 Last time □ P2P □ Security ♦ Intro ♦ Principles of cryptography.
Chapter 15: Electronic Mail Security
Week 4 - Wednesday.  What did we talk about last time?  RSA algorithm.
Authentication 3: On The Internet. 2 Readings URL attacks
Encryption Questions answered in this lecture: How does encryption provide privacy? How does encryption provide authentication? What is public key encryption?
CE Operating Systems Lecture 21 Operating Systems Protection with examples from Linux & Windows.
Privacy versus Authentication Confidentiality (Privacy) –Interceptors cannot read messages Authentication: proving the sender’s identity –The Problem of.
Lecture 16: Security CDK4: Chapter 7 CDK5: Chapter 11 TvS: Chapter 9.
Upper OSI Layers Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.
Security CS Introduction to Operating Systems.
1 Needham-Schroeder A --> S: A,B, N A S --> A: {N A,B,K AB,{K AB,A} KBS } KAS A --> B:{K AB,A} KBS B --> A:{N B } KAB A --> B:{N B -1} KAB.
6 June Lecture 2 1 TU Dresden - Ws on Proof Theory and Computation Formal Methods for Security Protocols Catuscia Palamidessi Penn State University,
X.509 Topics PGP S/MIME Kerberos. Directory Authentication Framework X.509 is part of the ISO X.500 directory standard. used by S/MIME, SSL, IPSec, and.
1 Day 2 Logging in, Passwords, Man, talk, write. 2 Logging in Unix is a multi user system –Many people can be using it at the same time. –Connections.
Project: Simulated Encrypted File System (SEFS) Omar Chowdhury Fall 2015CS526: Information Security1.
Electronic Mail Security Prepared by Dr. Lamiaa Elshenawy
Invitation to Computer Science 5 th Edition Chapter 8 Information Security.
Identify Friend or Foe (IFF) Chapter 9 Simple Authentication protocols Namibia Angola 1. N 2. E(N,K) SAAF Impala Russian MIG 1 Military needs many specialized.
Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
KERBEROS SYSTEM Kumar Madugula.
Pass data1 Passing data from an HTML page to a program Dr Jim Briggs.
9.2 SECURE CHANNELS JEJI RAMCHAND VEDULLAPALLI. Content Introduction Authentication Message Integrity and Confidentiality Secure Group Communications.
Pertemuan #8 Key Management Kuliah Pengaman Jaringan.
1 Example security systems n Kerberos n Secure shell.
Prof. Reuven Aviv, Nov 2013 Public Key Infrastructure1 Prof. Reuven Aviv Tel Hai Academic College Department of Computer Science Public Key Infrastructure.
SAMET KARTAL No one wants to share own information with unknown person. Sometimes while sharing something with someone people wants to keep.
Network Security and It’s Issues
Cryptographic Hash Function. A hash function H accepts a variable-length block of data as input and produces a fixed-size hash value h = H(M). The principal.
Secure Sockets Layer (SSL)
Cryptographic Hash Function
CE Operating Systems Lecture 21
CDK4: Chapter 7 CDK5: Chapter 11 TvS: Chapter 9
Security.
KERBEROS.
CDK: Chapter 7 TvS: Chapter 9
Operating System Concepts
Operating Systems Concepts
Presentation transcript:

Midterm NS Note = Anzahl Pkte/48 x /4; 2. 4/4; 3. 4/4; 4. 4/ /16; 6. 16/16 2.Durchschnitt: 4.5

Aufgabe 1a) und 1b) Compression algorithms work very efficiently if i) the plaintext contains lots of repetitive pattern and ii) it is encoded in ASCII. Encrypted text is implicitly non redundant and binary which would offer little chance to compression algorithms to do their work. You need to know after the decryption how many ASCII characters the plain but compressed text contains in order to check (admittedly at very low security level) its integrity. For this reason this number is not specially protected.

Aufgabe 2a und 2b) a)Forbid HTTP GET to perform non-query: IETF RFC 2616: “ The GET and HEAD methods should not have the significance of taking an action other than retrieval. Those methods ought to be considered safe. This allows user agents to represent other methods, such as POST, PUT and DELETE, in a special way, so that the user is made aware of the fact that a possibly unsafe action is being requested.” If look = 0 ! you delete data in the DB. b)PUT. The browser checks the repetition of a PUT-request, so the user is aware that something is going on ( Resend?).

Aufgabe 3a) and 3b) a)The #define keyword only substitute a ASCII-sequence with another one without checking anything. Use enum (it's a int type in C/C++) and can be verified at compile time. What happens if the function flushplay() does not work as intended? b)Use enum and check the return value of flushplay().

Aufgabe 4a) 4b) 4c) a)Sometimes, unprivileged users must be able to accomplish tasks that require privileges. An example is the passwd program, which allows you to change your password. Changing a user's password requires modifying the password field inthe /etc/passwd file. However, you should not give a user access to change thisfile directly - the user could change everybody else's password as well! b)Likewise, the mail program requires that you be able to insert a message into the mailbox of another user, yet you should not to give one user unrestricted access to another's mailbox.To get around these problems, UNIX allows programs to be endowed with privilege. Processes executing these programs can assume another UID or GID when they're running. A program that changes its UID is called a SUID program (set-UID); a program that changes its GID is called a SGID program (set-GID). A program can be both SUID and SGID at the same time. When a SUID program is run, its effective UID becomes that of the owner of the file, rather than of the user who is running it. This concept is so clever that AT&T patented it. c)Least privilege and separation (compartmentalization) of rights.

Aufgabe 5a) Message 1: A → S: A║B║N A A wishes to communicate with B via a TTP S. Message 2 : S → A: {N A ║B║K AB ║{K AB ║A}K BS }K AS S sends to A a session key K_{AB} and an encrypted version for B. Message 3 : A → B: {K AB ║A}K BS A sends to be the encrypted ticket (Kerberos!) she received from S. Message 4 : B → A: {N B }K AB B decrypts the session key and sends a nonce to A. Poor man authentication of B. Message 5 : A → B: {N B -1}K AB A decrypts the message and sends to B the (nonce -1). Poor man authentication of A.

Aufgabe 5b) 5c) 5d) 5e) b)Protocol to establish a symmetrical session key between two strangers using a TTP. Weak authentication of A in confront of B and vice versa. c)Many weak points: i.No time stamps are used : Oscar can try a replay attack with Message 4 anytime. ii.Oscar can play the role of S as long he owns K OS and A has K AO d)i. Replay, ii. Man-in-the-middle. e)Time stamps (see Kerberos) for i. and Message 1: A → S: {A║B║N A }K AS for ii.

Aufgabe 6a) and 6b) 1.Change the database, so that it contains the MD5 values of the modified files, rather than the original files. Defence: Physically separate the DB from your machine (simple: make a copy of the Tripwire-DB on a tape). 2.Change the function that calculates MD5, so that it returns the old values, rather than the new ones. Defence: JUnit test of MD5 on a separate standalone and protected machine with known vectors. 3.Hack the kernel so that the Tripwire program thinks it is reading the files in the /bin and /usr/bin directories, when it is in fact reading other files (presumably the original copies). Defence: Pretty difficult: use chroot or carefully observe the logfiles for suspect activity or use a secure OS-kernel. 4.Hack the Tripwire program, so that it says that nothing is wrong, when in fact something is. Defence: Use only an original tripwire executable from a personal memory sticker. 5.Hack Bob’s operating system, so that Bob sees the Tripwire program report that everything is okay, when in fact it is reporting something else. Defence: You are in a quite desperate situation.