Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...