 Hi, everyone. I'm Ron Rothblum, and I wanted to invite you to my talk on building collision-resistant hash functions from multi-collision-resistant hash functions, a joint work with Prashant Vasudevan. So as you can guess by the title, this work is about hash functions, specifically collision-resistant hash functions. So these are very prominent and widely studied notion in cryptography. It's basically hash functions that are shrinking, which means that there must be a lot of collisions around, but it is computationally hard to find collisions. So it's a very useful and powerful notion in crypto. And in recent years, there's been a study of a relaxation of this notion, which is called multi-collision-resistant hash functions, where, for example, you could have a situation in which maybe it's easy to find sort of pairwise collisions, but it's hard to find three-wise collisions. Okay, so that would be a three-way multi-collision-resistant hash functions. And it's sort of a weaker notion. It seems to be a weaker notion than collision-resistant hash functions. And in this work, we actually show how to transform, in some settings, multi-collision-resistant hash functions into collision-resistant hash functions, which I find to be pretty surprising that it's possible to do that. And in particular, the construction is pretty weird in an interesting way. And one of the interesting aspects is that it's non-blackbox. So the collision-resistant hash function that we end up constructing makes a non-blackbox use of the collision-resistant hash function. And it's also non-explicit in the sense that if you tell me, you know, here's an MCRH, give me back a collision-resistant hash function, I won't be able to do that. What I will be able to prove to you is that a collision-resistant hash function exists, but I can't really point out the algorithm. And if you'd like to hear more about it and learn why it's non-constructive and non-blackbox, then you are more than welcome to attend my talk at Crypto. So see you there. Bye, everyone.