Seminars

View all Seminars  |  Download ICal for this event

Two-party cryptography beyond computational assumptions: Some old and new results

Series: Department Seminar

Speaker: Akshay Bansal, Final year Ph.D. student,Computer Science at Virginia Tech

Date/Time: Nov 05 11:00:00

Location: CSA Auditorium, (Room No. 104, Ground Floor)

Abstract:
The impossibility of information-theoretic or unconditional security under classical communication is already established for many two-party cryptographic primitives, including but not limited to coin flipping, bit commitment, and oblivious transfer. In this talk, we first discuss the known limits of information-theoretic security using quantum communication and propose the novel framework of stochastic switching that uses stochastic semidefinite programming to develop simple protocols for tasks such as Rabin oblivious transfer [1]. We also discuss some of the reductions that can be used to develop secure Rabin oblivious transfer and propose some lower bounds on its overall security [2]. We conclude by briefly discussing the insufficiency of standalone security from the perspective of (in)composability of weak coin flipping [3].

[1] Akshay Bansal and Jamie Sikora.

Speaker Bio:
Akshay Bansal is a final year Ph.D. candidate in Computer Science at Virginia Tech advised by Jamie Sikora, with a research focus on quantum algorithms, learning theory, and convex optimization. He holds a Bachelors from IIT Kanpur and Masters from ISI Kolkata. He has previously worked at the Centre for Quantum Technologies in Singapore and the Institute for Quantum Computing at University of Waterloo. His current work delves into the mathematical foundations of quantum cryptography, classical and quantum machine learning, and convex analysis.

Host Faculty: Prof. Bhavana Kanukurthi