Introduction to Modern Cryptography - Aggelos Kiayias [PDF]

Bitcoin slides by Giorgos Panagiotakos: [lectureIMC.pdf]. Course Work (Due 23rd November 2016) : [hw.pdf] Revised! Exam

2 downloads 20 Views 50KB Size

Recommend Stories


PdF Introduction to Modern Cryptography, Second Edition
Ask yourself: What do I need to change about myself? Next

Introduction to Quantum Cryptography
Seek knowledge from cradle to the grave. Prophet Muhammad (Peace be upon him)

Introduction to Cryptography
We must be willing to let go of the life we have planned, so as to have the life that is waiting for

Introduction to Cryptography (Math 465)
Ask yourself: Do I enjoy my own company? Can I be alone without feeling lonely? Next

Introduction to Cryptography Class Activities
In the end only three things matter: how much you loved, how gently you lived, and how gracefully you

Introduction to Modern Optics
Just as there is no loss of basic energy in the universe, so no thought or action is without its effects,

PDF Introduction to Modern Virology Full Online
Ask yourself: How am I mistreating my body or compromising my health? Next

[PDF] Download An Introduction to Modern Astrophysics
Ask yourself: Do I enjoy my own company? Can I be alone without feeling lonely? Next

Download Introduction to Modern Economic Growth PDF
Ask yourself: What kind of person do you enjoy spending time with? Next

[PDF] An Introduction to Modern Astrophysics
In the end only three things matter: how much you loved, how gently you lived, and how gracefully you

Idea Transcript


Introduction to Modern Cryptography - INFR11131

Lecturer: Aggelos Kiayias Meeting Time: Wednesday 9-10:50am Meeting Room: Old Infirmary 2.13 for October 19th, remaining of semester Hunter Building, Lecture Theatre O17, except last two classes (November 23, 30th) again in Old Infirmary 2.13 Class Notes: [Cryptograph_Primitives_and_Protocols.pdf] draft of 23rd November Bitcoin slides by Giorgos Panagiotakos: [lectureIMC.pdf] Course Work (Due 23rd November 2016) : [hw.pdf] Revised! Exam Structure. The exam has 3 problems from which you have to solve 2 of them. Each problem has a number of questions. You are supposed to answer all questions. Answering a question requires expressing a security model, a protocol or algorithm, or a security proof that a protocol or algorithm is secure based on a model that you either know or it is given in the statement. Sample question (1/2 of a problem) Useful References. 1 2 3

A Computational Introduction to Number Theory and Algebra by V. Shoup Mathematics of Public Key Cryptography by S. Galbraith Handbook of Applied Cryptography, by A. Menezes, P. van Oorschot, and S. A. Vanstone.

Class log. 21.09.2016 We met Alice and Bob and considered how they can flip a coin over the telephone. We discussed Manuel Blum’s coin flipping protocol using an underlying notion of an opaque box. We identified the properties that the box should satisfy in order to be useful in the protocol, hiding and binding. In the 2nd half of the hour we discussed the process that we use in modern cryptography to design and analyze algorithms and protocols. We also discussed the relation to P and NP. Section 1 from the notes. 28.09.2016 We discussed group operations and introduced modular arithmetic (Section 2.1 without the Chinese Remainder Theorem). We then discussed the exponentiation problem and we discussed how we can get an algorithmic solution that is efficient. This is not in the notes but you can read about it in e.g., Wikipedia, see this link. We introduced the inverse problem in the form of computing the logarithm of an element in the group for a given generator. This problem will be eventually identified as the discrete logarithm problem, see Definition 6.2.1 in Section 6.2). 5.10.2016 We studied probabilistic algorithms. We defined the output probability of a probabilistic algorithm and the events that may be defined with respect to this output. We explained the importance of using probabilistic algorithms when arguing about the hardness of problems that are relevant to Cryptography. We sketched a way to realize a commitment scheme which is the primitive that can implement the “box” used in the coin flipping protocol. Refer to Section 2.8. 12.10.2016 We defined formally the correctness and security of commitment schemes, in the properties of correctness, binding, hiding, cf. Section 3. We then recalled the construction of commitment schemes based on multiplicative groups (Pedersen commitment). We started the discussion on the security proof focusing on the binding property. 19.10.2016 We covered the properties for commitment schemes, hiding and binding in more detail and completed the proof for perfect hiding with malicious parameter generation and computational binding under the discrete logarithm problem. We introduced statistical distance as an important measure of similarity between random variables. We introduced the problem of key exchange and described the Diffie Hellman key exchange protocol. The lecture corresponds to Sections 2.6, 2.7, 3.3, 3, 6.1. 26.10.2016 Introduction to Bitcoin. Bernoulli trials, Binomial distribution, Chernoff bounds. Bitcoin, currencies, double spending attacks, transactions, blocks, proof of work, difficulty. Modeling Bitcoin, Random oracle. Successful rounds. Synchronous operation. [lectureIMC.pdf] Refer to Section 2.5 for the tail bounds. 2.11.2016 We completed the analysis for Diffie Hellman Key Exchange. Sections 6.4, 6.5 from the notes. 9.11.2016 Public-key encryption. The ElGamal scheme. Proof of security of ElGamal under the DDH Assumption. Refer to Section 9 from the notes. 16.11.2016 Digital Signature schemes and their significance. Trapdoor one-way functions. Applications of digital signatures. See Sections 6.8, 7.1, 7.2. 23.11.2016 The proof of security of digital signatures “full domain hash” assuming a one-way trapdoor function in the random oracle model. Section 7.5. 30.11.2016 Exercise discussion, farewell. For the exam you have to study all the above mentioned sections from the notes. Specifically, sections 1 2.1 without the Chinese Remainder Theorem, 2.5, 2.6, 2.7, 2.8, 3 6.1, Definition 6.2.1, 6.4, 6.5, 6.8,7.1,7.2.,7.5, 9.

[Home]

Smile Life

When life gives you a hundred reasons to cry, show life that you have a thousand reasons to smile

Get in touch

© Copyright 2015 - 2024 PDFFOX.COM - All rights reserved.