<h4 class="_04xlpA direction-ltr align-center para-style-body" style="text-align: center;"><span class="JsGRdQ"><img class="aligncenter wp-image-21900 size-full" src="https://ancient.cybermaterial.com/wp-content/uploads/2020/12/Vadim-Lyubashevsky.png" alt="post-quantum cryptography" width="1200" height="800" /></span></h4> <blockquote> <p class="_04xlpA direction-ltr align-center para-style-body" style="text-align: left;"><span class="JsGRdQ">"In some cases, it might already be too late when it comes to post-quantum <a href="https://ancient.cybermaterial.com/hands-on-cryptography-with-python/">cryptography</a>. Attackers could be intercepting all of our data and storing it all, waiting for a quantum computer to come along. We could've already been broken. The attacker just hasn't used the data yet." <strong>Vadim Lyubashevsky - Researcher in the Cryptography Group at IBM Research - Zurich</strong></span></p> </blockquote> <strong><em>Source:</em> <a href="https://www.zdnet.com/article/quantum-computers-could-one-day-reveal-all-of-our-secrets/">ZDNet</a> </strong>- <span class="JsGRdQ">Post-quantum <a href="https://ancient.cybermaterial.com/hands-on-cryptography-with-python/">cryptography</a></span> <strong>About Vadim Lyubashevsky:</strong> <p style="text-align: justify;">Cryptographer in the Security group at <a href="https://www.zurich.ibm.com/">IBM Research - Zurich </a>, where he has worked since 2015. From 2010-2015, he was an <a href="http://www.inria.fr/">Inria</a> researcher (chargé de recherche) in the <a href="https://crypto.di.ens.fr/web2py">crypto group</a> at the École Normale Supérieure in Paris, and prior to that, a post-doc in the Foundations of Computing group at Tel-Aviv University (hosted by Oded Regev) from 2008 - 2010. He received my Ph.D. from the University of California, San Diego (advised by Daniele Micciancio) in 2008.</p> <p style="text-align: justify;">His main research focus is on designing efficient cryptographic protocols based on the hardness of lattice problems. Part of this research is supported by an ERC starting research grant <a title="https://www.zurich.ibm.com/felicity/" href="https://www.zurich.ibm.com/felicity/">FELICITY (Foundations of Efficient Lattice Cryptography)</a>, the goal of which is to design practical public key cryptographic schemes that will remain secure even in the presence of quantum computers.</p> He serve(d) on the following conference program committees: <ul> <li>2021: PKC, TCC</li> <li>2020: Crypto, SCN</li> <li>2019: PQCrypto, Crypto, CCS, SAC</li> <li>2017: Crypto</li> <li>2016: PKC, Eurocrypt</li> <li>2014: PQCrypto, PKC</li> <li>2013: Crypto, Eurocrypt</li> <li>2012: Latincrypt, PKC, TCC</li> <li>2011: PQCrypto, Indocrypt, Eurocrypt, TCC</li> <li>2010: Asiacrypt, Latincrypt, PKC, PQCrypto</li> </ul>