( en | de | ru )

 

Disambiguation of "Beimel, Amos"

Author of the publication

copydeleteadd this publication to your clipboard
RT oblivious erasure correcting.

, , and . IEEE/ACM Trans. Netw., 15 (6): 1321-1332 (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gerhard Beimel

Gernot Amoser

Amos Winkler

Amos Weissmann

Amos Schmidt

 

Other publications of authors with the same name

Private Learning and Sanitization: Pure vs. Approximate Differential Privacy., , and . CoRR, (2014)Approximate belief updating in max-2-connected Bayes networks is NP-hard., , and . Artif. Intell., 173 (12-13): 1150-1153 (2009)Secure Multiparty Computation with Partial Fairness., , and . IACR Cryptology ePrint Archive, (2010)On Matroids and Non-ideal Secret Sharing., and . TCC, volume 3876 of Lecture Notes in Computer Science, page 482-501. Springer, (2006)Multi-linear Secret-Sharing Schemes., , , and . TCC, volume 8349 of Lecture Notes in Computer Science, page 394-418. Springer, (2014)Reliable Communication over Partially Authenticated Networks., and . WDAG, volume 1320 of Lecture Notes in Computer Science, page 245-259. Springer, (1997)Learning Boxes in High Dimension., and . EuroCOLT, volume 1208 of Lecture Notes in Computer Science, page 3-15. Springer, (1997)1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds., , , and . CRYPTO, volume 6841 of Lecture Notes in Computer Science, page 277-296. Springer, (2011)Robust Information-Theoretic Private Information Retrieval., and . J. Cryptol., 20 (3): 295-321 (2007)Secret-Sharing Schemes for Very Dense Graphs., , and . J. Cryptol., 29 (2): 336-362 (2016)