 Hi, my name is Sapir and I'm going to tell you about Statistically Center for Advertisement transfer from LPN and the Randomization. This is a joint work with Neobitansky. In this work, our goal is to expand the reach of the Learning Party with Noise Hardness Assumption or LPN in short. And we hope we can contribute to the ongoing research of this problem. It's a long-studied problem and it's highly related to the well-known problem of decoding random binary linear codes. It's one of the few candidates who are considered to be resilient to quantum attacks. And also we should keep in mind it's twin problem NWE. And generally speaking LPN is far behind NWE, both in terms of known applications. We know how to construct many more applications from NWE and also in terms of hardness results. So generally speaking we much better understand NWE, but we also want to understand better the problem of LPN. In this work we focus on two methods, Statistically Center for Advertisement transfer or SSPOT in short. This is an oblivious transfer protocol where we really take the round complexity and the security to the extreme. It's a two-message protocol meaning that each party is allowed to send only one message. And we consider the best possible security guarantees for such a protocol meaning that the receiver choice bit is kept computationally hidden while the sender second message is kept statistically hidden. This is a very short protocol and very secure and therefore it's not surprising that it found many applications in cryptography and especially towards reducing the round complexity of cryptographic protocols such as proof systems, pure computations, hard problems in statistical zero knowledge and more. So the question raises up here and that we try to answer in the paper is can we construct Statistically Center for Advertisement transfer from the learning party with noise assumption? And it turns out that generally the answer to this question is yes, we can. And in the paper we show the following two results. So first we show that we can construct a two-message Statistically Center for Advertisement transfer in the common random string model using just LPN. And then we show that we can actually remove the CRS using a standard Nissan Vignette on-style randomization assumption. So overall we get that we can have an SSPOT protocol in the plain model using LPN and the randomization. Now just let me tell you a bit more about the results. So first we should mention that there is a caveat to our work and it is that we rely on LPN in the so-called low-noise regime. But it aligns with our current understanding of the problem of LPN and I'm going to expand more about it in the talk. Still this is the first quantum secure SSPOT construction that is not based on LWE. And we use different proof techniques from LWE and we hope they can be useful in the future research of the problem of learning party with noise. Thank you very much for listening and hope to see you in the conference.