TU1.R8.2

Perfect Subset Privacy in Polynomial Computation

Zirui (Ken) Deng, Washington University in St. Louis, United States; Vinayak Ramkumar, Tel Aviv University, Israel; Netanel Raviv, Washington University in St. Louis, United States
Session:
Privacy in Coded Computing
Track:
14: Secure Communication and Computation
Location:
Omega
Presentation Time:
Tue, 9 Jul, 10:05 - 10:25
Session Chair:
Athina Markopoulou, University of California, Irvine
Presentation
Not logged in.
Discussion
Not logged in.
Session TU1.R8
TU1.R8.1: Private Sum Computation: Trade-Off between Shared Randomness and Privacy
Remi Chou, University of Texas at Arlington, United States; Joerg Kliewer, NJIT, United States; Aylin Yener, OSU, United States
TU1.R8.2: Perfect Subset Privacy in Polynomial Computation
Zirui (Ken) Deng, Washington University in St. Louis, United States; Vinayak Ramkumar, Tel Aviv University, Israel; Netanel Raviv, Washington University in St. Louis, United States
TU1.R8.3: Private Multiple Linear Computation: A Flexible Communication-Computation Tradeoff
Jinbao Zhu, Lanping Li, Xiaohu Tang, Ping Deng, Southwest Jiaotong University, China
TU1.R8.4: On Multi-Message Private Computation
Ali Gholami, Technische Universitat Berlin, Germany; Kai Wan, Huazhong University of Science and Technology, China; Tayyebeh Jahani-Nezhad, Technische Universitat Berlin, Germany; Hua Sun, University of North Texas, United States; Mingyue Ji, University of Utah, United States; Giuseppe Caire, Technische Universitat Berlin, Germany
Resources
No resources available.