Media Summary: Chair: Eylon Yogev On the download rate of homomorphic secret sharing Ingerid Fosli (Stanford/Google); Yuval Ishai and Victor I. Chair: Gautam Kamath 13th Innovations in Theoretical Computer Science ( Chair: Xue Chen Probing to minimize Weina Wang, Anupam Gupta, and Jalani Williams (Carnegie Mellon University) Double ...
Itcs 2022 Session 14 - Detailed Analysis & Overview
Chair: Eylon Yogev On the download rate of homomorphic secret sharing Ingerid Fosli (Stanford/Google); Yuval Ishai and Victor I. Chair: Gautam Kamath 13th Innovations in Theoretical Computer Science ( Chair: Xue Chen Probing to minimize Weina Wang, Anupam Gupta, and Jalani Williams (Carnegie Mellon University) Double ... Chair: Igor Oliveira Small Circuits Imply Efficient Arthur-Merlin Protocols Michael Ezra and Ron Rothblum (Technion) Algorithms ... Chair: Omri Ben-Eliezer Noisy Boolean Hidden Matching with Applications Michael Kapralov (EPFL); Amulya Musipatla (CMU); ... Chair: Josh Alman Polynomial Identity Testing via Evaluation of Rational Functions Dieter van Melkebeek and Andrew Morgan ...
Chair: Nicole Wein A Unifying Framework for Characterizing and Computing Width Measures Eduard Eiben (Royal Holloway, ... Chair: Noga Ron-Zewi Nonlinear Repair Schemes of Reed-Solomon Codes Roni Con and Itzhak Tamo (Tel Aviv University) ... Chair: Yang Cai Maximizing revenue in the presence of intermediaries Gagan Aggarwal, Kshipra Bhawalkar Lane, Guru ... Chair: Lijie Chen On Hardness Assumptions Needed for ``Extreme High-End'' PRGs and Fast Derandomization Ronen Shaltiel ... Chair: Raghuvansh R. Saxena Keep That Card in Mind: Card Guessing with Limited Memory Boaz Menuhin and Moni Naor ... Chair: Karthik C. S. Improved Hardness of BDD and SVP Under Gap-(S)ETH Huck Bennett (Oregon State University); Chris ...
