CPI Talk - Simultaneous-Message and Succinct Secure Computation
CPI would like to extend an invitation to our CPI Talk on Thursday Nov. 21 from 2:30 - 4:00pm in SRADM EC5-1111 Enterprise Theatre , taking place in person.
Speaker: Akshayaram Srinivasan - Faculty member in the Department of Computer Science at the University of Toronto and the Department of Mathematical and Computational Sciences at the University of Toronto, Mississauga.
CPI Talks are free and open to everyone regardless of affiliation! High school students and non-Waterloo students/staff are also welcome to join.
No prior knowledge will be expected from the audience.
Please register here.
In this CPI Talk, Akshayaram Srinivasan will discuss:
CPI Talk - Privacy through Contextual Integrity: From Theory to Applications
Abstract:
Consider the following scenario: Alice has a large private input X, Bob holds a small private input y, and Charlie wants to learn the output f(X, y) of some public function f evaluated over the inputs of Alice and Bob. To achieve this with optimal communication cost, Bob can simply send his input to Alice, who then computes the output f(X, y), and sends it to Charlie. This simple, but clearly insecure protocol achieves the following communication complexity:
1. The communication between Alice and Bob is simply |y|, and in particular, independent of the length of Alice's input as well as the function output.
2. The total communication received by Charlie is simply the length of the function output (and otherwise, independent of Alice and Bob's input lengths).
Furthermore, this protocol requires only a single message from Bob to Alice, and then from Alice to Charlie. Is it possible to design a secure computation protocol that preserves---to the extent possible---the communication complexity and the communication pattern of the above insecure protocol? We give positive answer to this question under standard cryptographic assumptions.
Akshayaram Srinivasan is an Assistant Professor in the Department of Computer Science at University of Toronto. He obtained his Ph.D. from the University of California, Berkeley and his B.Tech from Indian Institute of Technology-Madras. Before joining U of T, he worked at the Tata Institute of Fundamental Research, Mumbai. His research interests lie in the theoretical and practical aspects of Cryptography. His research has been recognized with the best paper award at Eurocrypt 2018, invitation to the Journal of Cryptology for a paper in Crypto 2019, and Google India Research Award.