Elette Boyle

Paper 2024/192 , Reichman University, NTT Research , Centrum Wiskunde & Informatica , Centrum Wiskunde & Informatica , Aarhus University Function secret sharing (FSS) for a class $\cal{F}$ allows to split a secret function $f \in \cal{F}$ into (succinct) secret shares $f_0,f_1$, such that for all $x\in \{0,1\}^n$ it holds $f_0(x)-f_1(x)=f(x)$.

Paper 2024/123 , Reichman University, NTT Research , Hebrew University, NTT Research , Massachusetts Institute of Technology We study the complexity of memory checkers with computational security and prove the first general tight lower bound. Memory checkers, first introduced over 30 years ago by Blum, Evans, Gemmel, Kannan, and Naor (FOCS '91, Algorithmica '94), allow a user to store and maintain a large memory on a remote and unreliable server by using small trusted local storage.

Paper 2023/1802 , Reichman University, NTT Research , Université Paris Cité, CNRS, IRIF , Reichman University, Université Paris Cité, CNRS, IRIF Secure computation enables mutually distrusting parties to jointly compute a function on their secret inputs, while revealing nothing beyond the function output.