I study the communication and interaction costs of secure computation, especially non-interactive protocols. I am also interested in zero-knowledge proofs and applications of cryptography.
The ePrint is a major revision of the conference paper.
Conference abstract
We study the communication complexity of non-interactive secure computation (NISC) protocols with security against malicious adversaries. We give a general NISC protocol for any two-party function computed by a Boolean circuit C using only O(|C|λ) bits of communication, where λ is an exact security parameter. This protocol is unconditionally secure in the random oracle model, assuming a standard random OT correlations setup. Compared to Yao's semi-honest protocol, our protocol incurs only a constant communication overhead and achieves security against malicious parties with no additional interaction. Prior works achieved such constant overhead by either using a larger number of rounds or more structured correlations.
@misc{cryptoeprint:2026/1555,
author = {Yuval Ishai and Ziyang Jin and Naty Peter and Akshayaram Srinivasan},
title = {Non-Interactive Secure Computation with Constant Communication Overhead},
howpublished = {Cryptology ePrint Archive, Paper 2026/1555},
year = {2026},
doi = {10.1007/978-3-032-25324-8_5},
url = {https://eprint.iacr.org/2026/1555}
}
Master’s thesis · University of Toronto · 2023
Frugal Colouring of Graphs with Girth At Least Five
Supervisor: Michael Molloy
Thesis abstract
We proved that for any graph with girth at least five and maximum degree Δ, there exists a (1 + o(1))(Δ / ln Δ)-colouring such that for every vertex v, no colour appears more than polylog(Δ) times in the neighbourhood of v. Our work employs a technique called the semi-random method (a.k.a. the Rödl Nibble) and is based on the proof of [Kim95] for bounding the chromatic number of girth five graphs. We use a non-trivial lopsided Lovász Local Lemma to complete the colouring.
Previously, I completed my M.Sc. in computer science at UofT, under the supervision of Mike Molloy in graph theory. Before that, I worked as a software engineer. I obtained a B.Sc. in computer science at The University of British Columbia, where Will Evans and Nick Harvey inspired me to study theoretical computer science.
I have taught theory of computation and algorithms at UofT. As a lead TA for CSC 364, I have also helped develop assignments and course projects in computer security.
Course instructor · University of Toronto
CSC 236 · Introduction to the Theory of Computation
2023 Fall · LEC5101, 111 students
CSC 373 · Algorithm Design, Analysis, and Complexity
I was a student ambassador for 2025 Grad Visit Day and a current student panel speaker on Mar 18, 2025.
[GAAP 2024] The Toronto Graduate Application Assistance Program is a student-run, volunteer-led program to help students prepare applications to MSc and PhD programs in computer science at UofT. I was a mentor in 2024–2025, mainly for applicants who are interested in theoretical computer science.
