CS Events

Faculty Candidate Talk

Towards post-quantum cryptography: complexity and protocols


Download as iCal file

Thursday, March 10, 2022, 10:30am - 12:00pm


Join Zoom Meeting <br />
<br />

Join by SIP This email address is being protected from spambots. You need JavaScript enabled to view it.

Meeting ID: 998 8713 1299 Password: 383902

One tap mobile +16465588656,,99887131299# US (New York) +13126266799,,99887131299# US (Chicago) Join By Phone +1 646 558 8656 US (New York) +1 312 626 6799 US (Chicago) +1 301 715 8592 US (Washington DC) +1 253 215 8782 US (Tacoma) +1 346 248 7799 US (Houston) +1 669 900 9128 US (San Jose) Meeting ID: 998 8713 1299 Find your local number: https://rutgers.zoom.us/u/aeDtF4gsru

Join by Skype for Business https://rutgers.zoom.us/skype/99887131299 If you have any questions, please contact the Office of Information Technology Help Desk

Speaker: Katerina Sotiraki


Katerina Sotiraki is currently a post-doctoral researcher
at the EECS Department of UC Berkeley working with Alessandro Chiesa
and Raluca Ada Popa. She received her PhD from the EECS Department at
MIT where she was advised by Vinod Vaikuntanathan. She works on
cryptography, complexity theory, and secure computation, with focus on
cryptography based on lattices.

Location : Via Zoom

Event Type: Faculty Candidate Talk

Abstract: The advent of quantum computers places many widely usedcryptographic protocols at risk. In response to this threat, thefield of post-quantum cryptography has emerged. The most broadlyrecognized post-quantum protocols are related to lattices. Beyondtheir resistance to quantum attacks, lattices are instrumental toolsin cryptography due to their rich mathematical structure. In thistalk, I will present my work on understanding the complexity oflattice problems and on constructing lattice-based cryptographicprotocols useful in practical scenarios. First, I will present anoptimal construction for worst-case collision-resistant hash functionsbased on a lattice problem. Second, I will show the firstlattice-based construction of cryptographic proofs with minimalcommunication and zero-knowledge for any language in NP.


Rutgers University School of Arts and Sciences

Contact  Martin Farach-Colton