Computer science | COMPLEMENTS OF NETWORK SECURITY

cod. 0512100030

COMPLEMENTS OF NETWORK SECURITY

	0512100030
	DIPARTIMENTO DI INFORMATICA

	COMPUTER SCIENCE
	2013/2014

CURRICULUM METODOLOGICO Cohort 2012/2013

	YEAR OF COURSE 2
	YEAR OF DIDACTIC SYSTEM 2008
	SECONDO SEMESTRE

TEACHING UNITS

SSD	CFU	HOURS	ACTIVITY	TYPE OF ACTIVITY
INF/01	2	16	LESSONS	OPTIONAL SUBJECTS
INF/01	1	12	LAB	OPTIONAL SUBJECTS

	Objectives
	KNOWLEDGE AND UNDERSTANDING: THE CLASS HAS TWO GOALS: A) INTRODUCE TO STUDENTS CRYPTOGRAPHIC TECHNIQUES WHICH ARE USED TO SOLVE SECURITY AND PRIVACY ISSUES IN SEVERAL APPLICATIVE SETTINGS (E.G, BROADCAST TRANSMISSION, RFID TECHNOLOGY, SECURE MULTI-PARTY COMPUTATION) B) DESCRIBE MATHEMATICAL TOOLS WHICH ENABLE AN EFFICIENT IMPLEMENTATION OF CRYPTOGRAPHIC PRIMITIVES NEEDED TO DESIGN SECURE PROTOCOLS (E.G. ELLIPTIC CURVES OVER FINITE FIELDS.) APPLYING KNOWLEDGE AND UNDERSTANDING: THE CLASS AIMS AT ENABLING THE STUDENT TO USE, IN THE APPLICATIVE DOMAINS ON WHICH THE ATTENTION IS FOCUSED, THE PRESENTED CRYPTOGRAPHIC TECHNIQUES. AT THE SAME TIME, THE CLASS AIMS AT ENABLING THE STUDENT TO APPLY THE CRYPTOGRAPHIC TECHNIQUES IN SIMILAR APPLICATIVE DOMAINS WHICH SHARE COMMON FEATURES WITH THE PRESENTED AND STUDIED ONES. MAKING JUDGEMENTS: STUDENTS ARE DRIVEN THROUGH A CRITICAL AND RESPONSIBLE APPROACH TO STUDY PROBLEMS, TOOLS AND TECHNIQUES PRESENTED IN CLASS, IN ORDER TO STRENGTHEN THEIR PREPARATION AND TO BUILD THEIR OWN OPINIONS ON A SOLID BACKGROUND. THE REFERENCES PROVIDED BY THE TEACHER WILL BE HELPFUL IN THAT RESPECT. MOREOVER, SOME LECTURES ARE CLOSED BY "CHALLENGES", IN ORDER TO PUSH THE STUDENTS TO GET AN IN-DEPTH UNDERSTANDING OF SPECIFIC TOPICS AND MAKE THEIR OWN OPINIONS ON THE WEAKNESSES AND THE SUITABILITY OF THE PRESENTED TECHNIQUES. COMMUNICATION SKILLS: THROUGH THE WORKING-GROUP ACTIVITIES, THE CLASS AIMS AT ENCOURAGING STUDENT COLLABORATION AND THE DEVELOPMENT OF TEAM-RELATION SKILLS. DURING EACH ACTIVITY, STUDENTS ARE INVITED TO SHARE THEIR SKILLS IN ORDER TO FORMULATE COMMON SOLVING STRATEGIES AND TO PRESENT TO THE REST OF THE CLASS THE MOST SUITABLE ONES IN TERMS OF ADVANTAGES AND WEAKNESSES AND COMPUTATIONAL EFFICIENCY. LEARNING ABILITIES ALL ACTIVITIES IN CLASS AND AT HOME CONTRIBUTE TO STIMULATE AND STRENGTHEN THE STUDENT LEARNING ABILITIES.

KNOWLEDGE AND UNDERSTANDING:

THE CLASS HAS TWO GOALS:

A) INTRODUCE TO STUDENTS CRYPTOGRAPHIC TECHNIQUES WHICH ARE USED TO SOLVE SECURITY AND PRIVACY ISSUES IN SEVERAL APPLICATIVE SETTINGS (E.G, BROADCAST TRANSMISSION, RFID TECHNOLOGY, SECURE MULTI-PARTY COMPUTATION)

B) DESCRIBE MATHEMATICAL TOOLS WHICH ENABLE AN EFFICIENT IMPLEMENTATION OF CRYPTOGRAPHIC PRIMITIVES NEEDED TO DESIGN SECURE PROTOCOLS (E.G. ELLIPTIC CURVES OVER FINITE FIELDS.)

APPLYING KNOWLEDGE AND UNDERSTANDING:

THE CLASS AIMS AT ENABLING THE STUDENT TO USE, IN THE APPLICATIVE DOMAINS ON WHICH THE ATTENTION IS FOCUSED, THE PRESENTED CRYPTOGRAPHIC TECHNIQUES. AT THE SAME TIME, THE CLASS AIMS AT ENABLING THE STUDENT TO APPLY THE CRYPTOGRAPHIC TECHNIQUES IN SIMILAR APPLICATIVE DOMAINS WHICH SHARE COMMON FEATURES WITH THE PRESENTED AND STUDIED ONES.

MAKING JUDGEMENTS:

STUDENTS ARE DRIVEN THROUGH A CRITICAL AND RESPONSIBLE APPROACH TO STUDY PROBLEMS, TOOLS AND TECHNIQUES PRESENTED IN CLASS, IN ORDER TO STRENGTHEN THEIR PREPARATION AND TO BUILD THEIR OWN OPINIONS ON A SOLID BACKGROUND. THE REFERENCES PROVIDED BY THE TEACHER WILL BE HELPFUL IN THAT RESPECT. MOREOVER, SOME LECTURES ARE CLOSED BY "CHALLENGES", IN ORDER TO PUSH THE STUDENTS TO GET AN IN-DEPTH UNDERSTANDING OF SPECIFIC TOPICS AND MAKE THEIR OWN OPINIONS ON THE WEAKNESSES AND THE SUITABILITY OF THE PRESENTED TECHNIQUES.

COMMUNICATION SKILLS:

THROUGH THE WORKING-GROUP ACTIVITIES, THE CLASS AIMS AT ENCOURAGING STUDENT COLLABORATION AND THE DEVELOPMENT OF TEAM-RELATION SKILLS. DURING EACH ACTIVITY, STUDENTS ARE INVITED TO SHARE THEIR SKILLS IN ORDER TO FORMULATE COMMON SOLVING STRATEGIES AND TO PRESENT TO THE REST OF THE CLASS THE MOST SUITABLE ONES IN TERMS OF ADVANTAGES AND WEAKNESSES AND COMPUTATIONAL EFFICIENCY.

LEARNING ABILITIES
ALL ACTIVITIES IN CLASS AND AT HOME CONTRIBUTE TO STIMULATE AND STRENGTHEN THE STUDENT LEARNING ABILITIES.

	Prerequisites
	FAMILIARITY WITH THE CONTENTS OF THE NETWORK SECURITY CLASS

	Contents
	INTRODUCTION TO THE CLASS. CONTENT DESCRIPTION. MOTIVATIONS FOR STUDYING APPLICATIVE SETTINGS, CRYPTOGRAPHIC TECHNIQUES AND MATHEMATICAL TOOLS, IN ORDER TO GET SECURE AND EFFICIENT SOLUTIONS TO SECURITY AND PRIVACY ISSUES. (2 HOURS) BROADCAST ENCRYPTION. SETTING. NAIVE SOLUTIONS. SECURITY ANALYSIS. EVALUATION OF PROPOSED SOLUTIONS: PARAMETERS. DESCRIPTION AND ANALYSIS OF EFFICIENT PROTOCOLS: CS (COMPLETE SUBTREE), SD (SUBSET DIFFERENCE) AND LSD (LAYERED SUBSET DIFFERENCE). (7 HOURS) RFID TECHNOLOGY. APPLICATIONS. PHYSICAL FEATURES OF DEVICES. CLASSIFICATION. SECURITY AND PRIVACY ISSUES. AUTHENTICATION PROTOCOLS FOR PASSIVE TAGS. MOTIVATION, DESCRIPTION AND ANALYSIS OF THE HB, HB+ AND HB# PROTOCOLS. (6 HOURS) ELLIPTIC CURVE CRYPTOGRAPHY. ELLIPTIC CURVE ON REAL NUMBERS. POINT ADDITION. GEOMETRIC INTERPRETATION. ELLIPTIC CURVE OVER FINITE FIELDS. HASSE THEOREM AND SCHOOF ALGORITHM. ECIES CRYPTOSYSTEM (SIMPLIFIED VERSION). DH KEY-EXCHANGE. NAF REPRESENTATION. EFFICIENCY ANALYSIS. (7 ORE) TWO-PARTY COMPUTATION. MOTIVATION. APPLICATIVE SETTINGS. OVERVIEW OF EXISTING SOLUTIONS. YAO CONSTRUCTION. AD HOC CONSTRUCTIONS FOR SPECIFIC PROBLEMS. (6 HOURS)

Contents

INTRODUCTION TO THE CLASS. CONTENT DESCRIPTION. MOTIVATIONS FOR STUDYING APPLICATIVE SETTINGS, CRYPTOGRAPHIC TECHNIQUES AND MATHEMATICAL TOOLS, IN ORDER TO GET SECURE AND EFFICIENT SOLUTIONS TO SECURITY AND PRIVACY ISSUES. (2 HOURS)

BROADCAST ENCRYPTION. SETTING. NAIVE SOLUTIONS. SECURITY ANALYSIS. EVALUATION OF PROPOSED SOLUTIONS: PARAMETERS. DESCRIPTION AND ANALYSIS OF EFFICIENT PROTOCOLS: CS (COMPLETE SUBTREE), SD (SUBSET DIFFERENCE) AND LSD (LAYERED SUBSET DIFFERENCE). (7 HOURS)

RFID TECHNOLOGY. APPLICATIONS. PHYSICAL FEATURES OF DEVICES. CLASSIFICATION. SECURITY AND PRIVACY ISSUES. AUTHENTICATION PROTOCOLS FOR PASSIVE TAGS. MOTIVATION, DESCRIPTION AND ANALYSIS OF THE HB, HB+ AND HB# PROTOCOLS. (6 HOURS)

ELLIPTIC CURVE CRYPTOGRAPHY. ELLIPTIC CURVE ON REAL NUMBERS. POINT ADDITION. GEOMETRIC INTERPRETATION. ELLIPTIC CURVE OVER FINITE FIELDS. HASSE THEOREM AND SCHOOF ALGORITHM. ECIES CRYPTOSYSTEM (SIMPLIFIED VERSION). DH KEY-EXCHANGE. NAF REPRESENTATION. EFFICIENCY ANALYSIS. (7 ORE)

TWO-PARTY COMPUTATION. MOTIVATION. APPLICATIVE SETTINGS. OVERVIEW OF EXISTING SOLUTIONS. YAO CONSTRUCTION. AD HOC CONSTRUCTIONS FOR SPECIFIC PROBLEMS. (6 HOURS)

	Teaching Methods
	THE NETWORK SECURITY COMPLEMENTS CLASS CONSISTS IN LECTURES, INTEGRATED WITH WORKING GROUPS AND HOMEWORKS, WHICH CAN BE EITHER AND IN-DEPTH LOOK AT SOME ASPECTS OF ISSUES PRESENTED IN CLASS, OR IMPLEMENTATIONS AND EVALUATIONS OF CRYPTOGRAPHIC PROTOCOLS. THE RESULTS ARE PRESENTED IN CLASS.

	Verification of learning
	EVALUATION AND GRADE: STUDENTS WHO ATTEND THE CLASS WITH GOOD MARKS IN ALL THE CLASS ACTIVITIES, ARE EVALUATED THOUGH A WRITTEN TEST AND A SHORT ORAL EXAMINATION WHICH TAKES INTO ACCOUNT ALL THE ACTIVITIES PERFORMED DURING THE TERM. STUDENTS WHO DO NOT ATTEND THE CLASS ARE EVALUATED THROUGH A TWO-PART EXAMINATION: A WRITTEN PART AND AN ORAL PART. SIX CALLS ARE PROVIDED EVERY YEAR.

	Texts
	BOOKS: D. STINSON, CRYPTOGRAPHY: THEORY AND PRACTICE, THIRD EDITION, NOVEMBER 2005, CRC PRESS. W. STALLING, CRITTOGRAFIA E SICUREZZA DELLE RETI, SECONDA EDIZIONE, 2007, MCGRAW-HILL. WEB SITE: WWW.DIA.UNISA.IT/PROFESSORI/PAODAR SLIDES AVAILABLE