WEBVTT - This file was automatically generated by VIMEO

0
00:00:15.500 --> 00:00:19.000
We have finished all sections of our introductory course.

1
00:00:21.200 --> 00:00:24.400
Congratulations on making it to the end of this course

2
00:00:24.400 --> 00:00:26.900
 where you have learned a lot about cryptography.

3
00:00:27.700 --> 00:00:31.000
You went from simple Vernon Cipher to Modern

4
00:00:30.100 --> 00:00:33.500
 symmetry key and public key cryptographic

5
00:00:33.500 --> 00:00:34.000
 methods.

6
00:00:34.800 --> 00:00:38.100
That are used in almost all today's

7
00:00:37.100 --> 00:00:39.600
 devices and applications.

8
00:00:40.800 --> 00:00:44.100
You understood why and how this cryptographic

9
00:00:43.100 --> 00:00:46.500
 methods were constructed and you

10
00:00:46.500 --> 00:00:49.800
 have got also good understanding of the main attacks

11
00:00:49.800 --> 00:00:52.300
 that can Target these methods in the first section.

12
00:00:52.300 --> 00:00:55.600
 You learned about the core principles of cryptography

13
00:00:55.600 --> 00:00:58.900
 confidentiality integrity and Authentication.

14
00:01:00.100 --> 00:01:04.200
In the second section you understood how to achieve confidentiality

15
00:01:03.200 --> 00:01:07.100
 using symmetry encryption and

16
00:01:06.100 --> 00:01:10.000
 you studied in detail the ascriptive system.

17
00:01:10.500 --> 00:01:13.000
On the third section you understood how to

18
00:01:13.400 --> 00:01:17.100
 achieve integrity and authentication using cryptographic

19
00:01:16.100 --> 00:01:19.200
 hashing and message authentication codes.

20
00:01:20.900 --> 00:01:23.600
In section 4 you learned about the added

21
00:01:23.600 --> 00:01:26.700
 value of public key cryptography compared with

22
00:01:26.700 --> 00:01:28.100
 symmetric key cryptography.

23
00:01:29.100 --> 00:01:30.400
You studied in detail?

24
00:01:31.200 --> 00:01:34.800
Diffie-hellman key agreement protocol and our secretive

25
00:01:34.800 --> 00:01:38.200
 system. You learned how to achieve confidentiality using

26
00:01:37.200 --> 00:01:41.000
 public key crypto system in

27
00:01:40.200 --> 00:01:42.500
 particularly our secret system.

28
00:01:43.900 --> 00:01:46.600
Section 5 you acquired an advanced understanding

29
00:01:46.600 --> 00:01:49.500
 how to achieve integrity and

30
00:01:49.500 --> 00:01:52.700
 authentication using digital signatures and

31
00:01:52.700 --> 00:01:56.100
 how to construct digital signatures from RSA.

32
00:01:58.500 --> 00:02:01.500
You might be wondering what course or project

33
00:02:01.500 --> 00:02:02.900
 should you do next?

34
00:02:03.800 --> 00:02:06.400
Let me suggest to you two possible types

35
00:02:06.400 --> 00:02:10.400
 of courses, you can take in the future. First, of

36
00:02:09.400 --> 00:02:12.600
 course that you can have is

37
00:02:12.600 --> 00:02:15.300
 to consolidate the theoretical knowledge that

38
00:02:15.300 --> 00:02:18.900
 you acquired with a coding course for cryptography.

39
00:02:19.800 --> 00:02:22.500
So for instance a python is

40
00:02:22.500 --> 00:02:26.300
 very convenient programming language to implement cryptographic methods.

41
00:02:27.300 --> 00:02:31.100
And if you would like to implement the methods

42
00:02:30.100 --> 00:02:34.200
 that we have seen by yourself from the

43
00:02:33.200 --> 00:02:36.800
 lower arithmetic layer,

44
00:02:36.800 --> 00:02:39.600
 then maybe you can use a library

45
00:02:39.600 --> 00:02:43.000
 like Sage math which is a python-based

46
00:02:42.700 --> 00:02:45.700
 math library that is appropriate

47
00:02:45.700 --> 00:02:49.400
 to implement like definite

48
00:02:48.400 --> 00:02:51.200
 field arithmetic that you have.

49
00:02:51.200 --> 00:02:54.900
 We have seen that is required either for

50
00:02:54.900 --> 00:02:57.700
 a yes or say. So basically you

51
00:02:57.700 --> 00:03:01.000
 can take like an applied cryptography. Of course

52
00:03:00.500 --> 00:03:03.700
 where either you code yourself the

53
00:03:03.700 --> 00:03:07.500
 cryptographic methods or you implement applications or

54
00:03:07.500 --> 00:03:11.400
 protocols that call existing cryptographic

55
00:03:10.400 --> 00:03:13.700
 methods like through apis cryptographic

56
00:03:13.700 --> 00:03:14.300
 apis.

57
00:03:15.400 --> 00:03:18.300
Or if you are interested interested in the attack

58
00:03:18.300 --> 00:03:22.000
 side, then you can try to implement the attacks that

59
00:03:21.400 --> 00:03:24.800
 exist on several cryptographic methods

60
00:03:24.800 --> 00:03:27.200
 or applications. So you will

61
00:03:27.200 --> 00:03:30.900
 implement the attack yourself. You see all the complexity

62
00:03:30.900 --> 00:03:33.100
 and optimization that we need to

63
00:03:33.100 --> 00:03:36.100
 make this attacks efficient. So this is

64
00:03:36.100 --> 00:03:39.700
 one possibility like to code to consolidate

65
00:03:39.700 --> 00:03:41.500
 your theoretical knowledge.

66
00:03:42.600 --> 00:03:43.600
another possibility

67
00:03:44.400 --> 00:03:47.900
is to start studying a privacy enhancing

68
00:03:47.900 --> 00:03:51.100
 techniques also abbreviated pets.

69
00:03:51.900 --> 00:03:55.200
Privacy enhancing techniques are cryptographic techniques

70
00:03:54.200 --> 00:03:58.200
 that go beyond the services

71
00:03:57.200 --> 00:04:00.800
 that we have seen in this course, the

72
00:04:00.800 --> 00:04:04.300
 classic Services of confidentiality integrity

73
00:04:03.300 --> 00:04:06.300
 and authentication. They go

74
00:04:06.300 --> 00:04:10.100
 beyond that to provide privacy

75
00:04:09.100 --> 00:04:12.200
 for users. Let me

76
00:04:12.200 --> 00:04:14.200
 give some examples of this techniques.

77
00:04:15.500 --> 00:04:18.700
The first would be homomorphic encryption almost encryption

78
00:04:18.700 --> 00:04:21.200
 is a type of encryption where you can

79
00:04:21.200 --> 00:04:24.400
 apply some processing on a ciphertext.

80
00:04:25.200 --> 00:04:28.400
This can be used for if for instance. I would

81
00:04:28.400 --> 00:04:31.300
 like to run some competition on my

82
00:04:31.300 --> 00:04:35.600
 data but my device has limited competitional

83
00:04:34.600 --> 00:04:37.200
 power. Then I can

84
00:04:37.200 --> 00:04:41.300
 delegate this competitional task to server

85
00:04:40.300 --> 00:04:44.100
 that has enough power, but I

86
00:04:43.100 --> 00:04:46.700
 care about my privacy. So what I

87
00:04:46.700 --> 00:04:49.300
 can do is that I will encrypt my data using

88
00:04:49.300 --> 00:04:50.800
 homomorphic encryption scheme.

89
00:04:51.300 --> 00:04:54.500
That data is now encrypted. It's

90
00:04:54.500 --> 00:04:57.000
 confidential and then I send it to

91
00:04:57.200 --> 00:05:00.900
 the server that will do the processing and obtains an

92
00:05:00.900 --> 00:05:03.400
 encrypted output and returns that

93
00:05:03.400 --> 00:05:06.300
 output back to me for decryption. And that's how

94
00:05:06.300 --> 00:05:09.900
 I will get the result. So it's privacy preserving

95
00:05:09.900 --> 00:05:12.600
 a delegation of computation.

96
00:05:14.200 --> 00:05:17.300
The second technique is I would like to mention here

97
00:05:17.300 --> 00:05:20.100
 is multi-part competition multi-party computation is

98
00:05:20.100 --> 00:05:24.000
 a technique where different parties can compute function

99
00:05:23.700 --> 00:05:26.800
 on their inputs without revealing

100
00:05:26.800 --> 00:05:27.600
 those inputs.

101
00:05:28.300 --> 00:05:32.500
For instance. Let's say we are doing a secret bidding

102
00:05:31.500 --> 00:05:33.700
 secret option.

103
00:05:34.300 --> 00:05:37.500
Then the bidders they can submit their their

104
00:05:37.500 --> 00:05:41.100
 bits and we can compute

105
00:05:40.100 --> 00:05:43.600
 function that finds the

106
00:05:43.600 --> 00:05:46.600
 highest bit in a privacy present manner

107
00:05:46.600 --> 00:05:50.000
 without revealing the initial bits.

108
00:05:49.500 --> 00:05:52.300
 So multiple competition

109
00:05:52.300 --> 00:05:56.000
 can be used for this kind of use cases where different parties

110
00:05:55.500 --> 00:05:58.100
 they care about their privacy, but they would

111
00:05:58.100 --> 00:06:01.200
 like to compute some functionality on their inputs.

112
00:06:02.500 --> 00:06:06.000
Third technique is zero knowledge proofs generals proofs

113
00:06:05.100 --> 00:06:08.800
 is very important technique. It's very

114
00:06:08.800 --> 00:06:10.000
 hot research topic.

115
00:06:10.800 --> 00:06:13.400
especially in the area of blockchain

116
00:06:14.100 --> 00:06:15.200
so your knowledge proofs.

117
00:06:15.900 --> 00:06:19.300
Allows a party to prove

118
00:06:18.300 --> 00:06:21.700
 to verifier that

119
00:06:21.700 --> 00:06:24.800
 he has some secret or that he did some competition.

120
00:06:26.300 --> 00:06:29.300
Without revealing. What was

121
00:06:29.300 --> 00:06:32.300
 that secret or the inputs to that competition?

122
00:06:33.200 --> 00:06:37.100
And this so that party can provide a

123
00:06:36.100 --> 00:06:39.600
 proof and a cryptographic proof

124
00:06:39.600 --> 00:06:43.000
 and this proof can be verified by the

125
00:06:42.000 --> 00:06:43.400
 verifier.

126
00:06:44.300 --> 00:06:48.200
So zero knowledge proves that KP is used

127
00:06:47.200 --> 00:06:50.900
 for instance in the blockchain to bring

128
00:06:50.900 --> 00:06:53.600
 more privacy, but also to solve this

129
00:06:53.600 --> 00:06:56.200
 scalability like layer 2 techniques that

130
00:06:56.200 --> 00:06:59.200
 fix the scalability issue of

131
00:06:59.200 --> 00:07:03.300
 ethereum, for example, they rely on zkp to

132
00:07:02.300 --> 00:07:04.400
 achieve that

133
00:07:05.400 --> 00:07:08.400
Less technique that I would like to mention here is Federated learning

134
00:07:08.400 --> 00:07:11.600
 Federated learning is a type of machine learning

135
00:07:11.600 --> 00:07:14.900
 where data of user is not

136
00:07:14.900 --> 00:07:17.500
 does not leave. The user's device.

137
00:07:17.500 --> 00:07:20.400
 It's rather the model that

138
00:07:20.400 --> 00:07:23.700
 gets goes to the to users device

139
00:07:23.700 --> 00:07:25.800
 gets drained there and then back to the server.

140
00:07:27.500 --> 00:07:30.800
Google introduced this technique to train their Google

141
00:07:30.800 --> 00:07:33.600
 gboard in privacy preserving manner

142
00:07:33.600 --> 00:07:36.600
 without moving users data outside

143
00:07:36.600 --> 00:07:38.900
 from their mobile forms.

144
00:07:39.900 --> 00:07:43.000
So these are very powerful techniques.

145
00:07:43.800 --> 00:07:46.200
They are relatively recent compared to

146
00:07:47.200 --> 00:07:49.200
the techniques that we have seen here.

147
00:07:50.100 --> 00:07:53.100
They were mostly developed in the last decade or two

148
00:07:53.100 --> 00:07:57.000
 decades and they are currently getting deployed in different

149
00:07:56.300 --> 00:08:00.800
 applications and systems from

150
00:08:00.800 --> 00:08:04.100
 AI to machine learning to also blockchain.

151
00:08:03.100 --> 00:08:07.100
 So I think it would be also interesting to

152
00:08:06.100 --> 00:08:10.600
 have a look at this side

153
00:08:09.600 --> 00:08:12.000
 of cryptography.

154
00:08:12.900 --> 00:08:15.400
So thank you for joining this course

155
00:08:15.400 --> 00:08:18.900
 and all the best on your cryptography Journey.
