University of L'Aquila
    Department of Information Engineering Computer Science and Mathematics
    Academic Year 2016/2017



    (Click here) to get News

    Information Systems and Network Security (6 CREDITS). Link to the Computer Science Degree official website (click here).
    Description: This course provides an introduction to Information Systems and Network Security. Topics include:
  • Basics of Cryptology.
  • Information Systems Security: - Information Technology Security, Crime, Compliance, Continuity. - Threats, Vulnerabilities, and Risk Exposure. - Defense: Information Technology Defense.
  • Game Theory for Network Security (if there is time)
  • Introduction to Information Systems.
  • Algorithmic Issues arising in Information Systems: Revenue Maximization Envy-Free Pricing Problems.
  • Introduction to Cloud Computing. (if there is time)
  • Algorithmic Issues arising in Information Systems: Scheduling Algorithms; Envy-Free Scheduling.
    Timetable: First semester (September 19, 2016 - December 22, 2016), Wednesday: 11.30–13.30 (room A 1.2) and Thursday: 9.30–11.30 (room C1.16)
    Students’ reception: Given that I could be out of the office due to academic or research commitments, students are invited to arrange the day and time of the meeting by e-mail and therefore to send an e-mail preventively.
    Course Material: Lecture notes (slides) provided by the lecturer. Plus the extra didactic material (please do not hesitate to contact me if you have problems with finding them).
    Extra didactic material:
    - M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. H. Katz, A. Konwinski, G. Lee, D. A. Patterson, A. Rabkin, I. Stoica, M. Zaharia: A view of cloud computing. Commun. ACM 53(4): 50-58 (2010). The paper can be found (here)
    - Michael Armbrust, Armando Fox, Rean Griffith, Anthony D. Joseph, Randy Katz, Andy Konwinski, Gunho Lee, David Patterson, Ariel Rabkin, Ion Stoica, and Matei Zaharia: Above the Clouds: A Berkeley View of Cloud Computing. EECS Department, University of California, Berkeley Technical Report No. UCB/EECS-2009-28, February 10, 2009. The paper can be found (here)
    Additional didactic material:
    - Charlie Kaufman, Radia Perlman, Mike Speciner: “Network Security: Private Communication in a Public World (2nd Edition)”. Prentice Hall, 2002.
    - Peter Brucker: “Scheduling Algorithms”. Springer, 2007.
    Course Program:
    September 21, 2016: Presentation of the course.
    Basics of cryptology: introduction (first part). Slides (Click here).
    September 22, 2016: Basics of cryptology: introduction (second part). Slides (Click here).
    September 28, 2016: Basics of cryptology: introduction (third and last part). Slides (Click here).
    September 29, 2016: Symmetric cryptography: Stream ciphers (RC4), Block ciphers (Electronic codebooks(ECB), Cipher-block chaining (CBC), Cipher feedback (CFB), Output feedback (OFB), Counter (CTR)). Slides (Click here).
    October 4, 2016: Exercises on transposition ciphers, Vigenère cipher, One-Time pad (Vernam cipher), Electronic codebook (ECB), Cipher-block chaining (CBC): Exercises solutions have been proposed on the blackboard.
    October 5, 2016: Symmetric cryptography: Block ciphers (Substitution-permutation (SP) networks, Feistel ciphers, Data Encryption Standard (DES), 3DES). Slides (Click here)
    October 12, 2016: Symmetric cryptography: Block ciphers (Advanced Encryption Standard (AES): an overview). Slides (Click here)
    Message Authentication Code (MAC), Hash functions (first part). Slides (Click here)
    October 13, 2016: Hash functions (second part). MD5 (overview) and SHA1 (overview) Slides (Click here).
    Exercises on Feistel cipher, CBC Residue (MAC), Applications of hash functions: Exercises solutions have been proposed on the blackboard.
    October 19, 2016: Asymmetric cryptography, RSA (first part) Slides (Click here).
    October 20, 2016: Asymmetric cryptography, RSA (second part) Slides (Click here).
    October 26, 2016: Asymmetric cryptography, RSA (third and last part). Diffie-Hellman cipher. Slides (Click here).
    November 2, 2016: Exercises on RSA, Diffie-Hellmann, Fermat theorem, Feistel cipher, CBC residue, cryptography with hash functions. Exercises solutions have been proposed on the blackboard.
    November 3, 2016: Information systems nowadays. Slides (Click here).
    November 16, 2016: Mid-term exam exercises solutions (exercises solutions have been proposed on the blackboard).
    Cloud Computing. Slides (Click here).
    November 17, 2016: Scheduling Algorithms (Part I). Slides (Click here).
    November 23, 2016: Scheduling Algorithms (Part II). Slides (Click here).
    November 24, 2016: Scheduling Algorithms (Part III). Slides (Click here).
    November 30, 2016: Envy-free identical scheduling. Slides (Click here).
    December 1, 2016: Envy-free unrelated scheduling. Slides (Click here).
    December 14, 2016: Exercises on scheduling: Exercises have been proposed on the blackboard.
    December 15, 2016: Revenue Maximizing Envy-free Pricing Problem (first part). Slides (Click here).
    December 21, 2016: Revenue Maximizing Envy-free Pricing Problem (second part). Slides (Click here).
    December 22, 2016: Revenue Maximizing Envy-free Pricing Problem (last part). Slides have been already provided.
    Exercises on Envy-free Pricing: Exercises have been proposed on the blackboard.
    News:
    September 29, 2016: Only for the next week (October 3-7) the lectures are scheduled as follows:
    - Tuesday 4th October 9.30-11.30 am, room A.1.1 Alan Turing building.
    - Wednesday 5th October: 11.30 am -1.30 pm, room A.1.2 Alan Turing building.
    - Thursday 6th October, NO LECTURE.
    October 19, 2016: The Mid-term exam date is Wednesday November 9, 11.30-13.30, room A1.2 .
    November 13, 2016: Available the results of the Mid-term and full exam of November 9, 2016. (Click here)
    December 1, 2016: Wednesday December 7 and Thursday December 8, 2016, there will be no lecture. Next lecture will be Wednesday December 14.
    December 12, 2016: Final exams semester #1 A.Y. 2016/2017: (Period January 9, 2017 - February 24, 2017)
    1° Wednesday January 11, 2017. Time: 11.00 a.m.
    2° Wednesday January 25, 2017. Time: 11.00 a.m.
    3° Wednesday February 8, 2017. Time: 11.00 a.m.
    January 12, 2017: Available the results of the examination of January 11, 2017. (Click here). Exams recording and oral exams: Tuesday January 17, Time: 10:30 a.m.
    January 19, 2017: Click here to download the assignment of the examination of January 11, 2017.
    January 26, 2017: Available the results of the examination of January 25, 2017. (Click here). Exams recording and oral exams: Tuesday January 31, Time: 10:30 a.m.
    January 26, 2017: Click here to download the assignment of the examination of January 25, 2017.
    January 30, 2017: Exams recording and oral exams have been moved to Wednesday February 1, Time: 10:30 a.m.
    February 9, 2017: Available the results of the examination of February 8, 2017. (Click here). Exams recording and oral exams: Tuesday February 14, Time: 10:30 a.m.
    May 12, 2017: Final exams A.Y. 2016/2017: (Period June 12, 2017 - July 28, 2017)
    1° Tuesday June 20, 2017. Time: 2.30 p.m., room A1.1
    2° Tuesday July 18, 2017. Time: 2.30 p.m., room A1.2
    June 21, 2017: Available the results of the examination of June 20, 2017. (Click here). Exams recording and oral exams: Thursday June 22, Time: 11:00 a.m.
    June 27, 2017: Final exams A.Y. 2016/2017: (Period September 1, 2017 - September 15, 2017)
    1° Monday September 4, 2017. Time: 10.00 a.m.
    July 19, 2017: Available the results of the examination of July 18, 2017. (Click here). Exams recording and oral exams: Thursday July 20, Time: 10:30 a.m.
    September 5, 2017: Available the results of the examination of September 4, 2017. (Click here). Exams recording and oral exams: Monday September 11, Time: 10:30 a.m.