Bar Alon

Paper 2024/419 , Ben Gurion University , Ben Gurion University , Ariel University , Ariel University , Ariel University Abstract Evolving secret-sharing schemes, defined by Komargodski, Naor, and Yogev [TCC 2016B, IEEE Trans. on Info. Theory 2018], are secret-sharing schemes in which there is no a-priory bound on the number of parties. In such schemes, parties arrive one by one; when a party arrives, the dealer gives it a share and cannot update this share in later stages.

Paper 2023/1608 , Ben-Gurion University of the Negev , Ariel University , Georgetown University In the setting of solitary output computations, only a single designated party learns the output of some function applied to the private inputs of all participating parties with the guarantee that nothing beyond the output is revealed.

Paper 2020/1170 On the Power of an Honest Majority in Three-Party Computation Without Broadcast Abstract Fully secure multiparty computation (MPC) allows a set of parties to compute some function of their inputs, while guaranteeing correctness, privacy, fairness, and output delivery. Understanding the necessary and sufficient assumptions that allow for fully secure MPC is an important goal. Cleve (STOC'86) showed that full security cannot be obtained in general without an honest majority.