On d-Multiplicative Secret Sharing von Barkol, Omer, Ishai, Yuval, Weinreb, Enav

Volltext

Characterizing Ideal Weighted Threshold Secret Sharing von Beimel, Amos, Tassa, Tamir, Weinreb, Enav

Volltext

How Should We Solve Search Problems Privately? von Beimel, Amos, Malkin, Tal, Nissim, Kobbi, Weinreb, Enav

Volltext

Communication Efficient Secure Linear Algebra von Nissim, Kobbi, Weinreb, Enav

Volltext

Partition arguments in multiparty communication complexity von Draisma, Jan, Kushilevitz, Eyal, Weinreb, Enav

Volltext

On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR von Barkol, Omer, Ishai, Yuval, Weinreb, Enav

Volltext

Choosing, Agreeing, and Eliminating in Communication Complexity von Beimel, Amos, Ben Daniel, Sebastian, Kushilevitz, Eyal, Weinreb, Enav

Volltext

Partition arguments in multiparty communication complexity: Selected Papers from 36th International Colloquium on Automata, Languages and Programming (ICALP 2009) von DRAISMA, Jan, KUSHILEVITZ, Eyal, WEINREB, Enav

Volltext

On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR : APPROX+RANDOM von BARKOL, Omer, ISHAI, Yuval, WEINREB, Enav

Volltext

Monotone circuits for monotone weighted threshold functions von Beimel, Amos, Weinreb, Enav

Volltext

PRIVATE APPROXIMATION OF SEARCH PROBLEMS von BEIMEL, Amos, CARMI, Paz, NISSIM, Kobbi, WEINREB, Enav

Volltext

CHARACTERIZING IDEAL WEIGHTED THRESHOLD SECRET SHARING von BEIMEL, Amos, TASSA, Tamir, WEINREB, Enav

Volltext

Separating the power of monotone span programs over different fields von BEIMEL, Amos, WEINREB, Enav

Volltext

Characterizing Ideal Weighted Threshold Secret Sharing von Beimel, Amos, Tassa, Tamir, Weinreb, Enav

Volltext

q2d: Turning Questions into Dialogs to Teach Models How to Search von Bitton, Yonatan, Cohen-Ganor, Shlomi, Hakimi, Ido, Lewenberg, Yoad, Aharoni, Roee, Weinreb, Enav

Volltext bestellen

Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries von Mohassel, Payman, Weinreb, Enav

Volltext

Partition Arguments in Multiparty Communication Complexity von Draisma, Jan, Kushilevitz, Eyal, Weinreb, Enav

Volltext

Choosing, Agreeing, and Eliminating in Communication Complexity von Beimel, Amos, Ben Daniel, Sebastian, Kushilevitz, Eyal, Weinreb, Enav

Volltext

q2d: Turning Questions into Dialogs to Teach Models How to Search von Bitton, Yonatan, Cohen-Ganor, Shlomi, Hakimi, Ido, Lewenberg, Yoad, Aharoni, Roee, Weinreb, Enav

Volltext

On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR von Barkol, Omer, Ishai, Yuval, Weinreb, Enav

Volltext