Mathematical Conversations

In theoretical computer science, we often aim to prove lower bounds and demonstrate the computational hardness of solving certain problems. However, some of these "negative" results can be directly applied to cryptography, to base the security of protocols.
In this talk, we will introduce the fundamental building blocks of cryptography, such as encryption, key exchange, and digital signatures. We will explain how these techniques are used to secure online transactions and communications, and how their security relies on the computational hardness of certain problems.
Finally, we will mention recent results about the security concerns that arise when cryptography is used in the context of machine learning models. We will show how malicious entities can use cryptography to create undetectable, untrustworthy models.