Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority.

E. Ben-Sasson, S. Fehr, and R. Ostrovsky. IACR Cryptology ePrint Archive, (2011)

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.

Prof. Dr. -Ing. Rudolf Eligehausen University of Stuttgart

Achim Benz University of Stuttgart

Sara Bender University of Stuttgart

Tobias Bens University of Stuttgart

Maximilian Benn University of Stuttgart

Other publications of authors with the same name

Towards lower bounds on locally testable codes via density arguments.E. Ben-Sasson, and M. Viderman. Computational Complexity, 21 (2): 267-309 (2012)Affine Dispersers from Subspace Polynomials.E. Ben-Sasson, and S. Kopparty. SIAM J. Comput., 41 (4): 880-914 (2012)Some 3CNF Properties Are Hard to Test.E. Ben-Sasson, P. Harsha, and S. Raskhodnikova. SIAM J. Comput., 35 (1): 1-21 (2005)Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding.E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan. SIAM J. Comput., 36 (4): 889-974 (2006)The Complexity of User Retention.E. Ben-Sasson, and E. Saig. ITCS, volume 124 of LIPIcs, page 12:1-12:30. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2019)Lower bounds for bounded depth Frege proofs via Pudlák-Buss games.E. Ben-Sasson, and P. Harsha. ACM Trans. Comput. Log., 11 (3): 19:1-19:17 (2010)Improved concrete efficiency and security analysis of Reed-Solomon PCPPs.E. Ben-Sasson, I. Bentov, A. Gabizon, and M. Riabzev. Electronic Colloquium on Computational Complexity (ECCC), (2016)Breaking local symmetries can dramatically reduce the length of propositional refutations.S. Ben-Israel, E. Ben-Sasson, and D. Karger. Electronic Colloquium on Computational Complexity (ECCC), (2010)3CNF Properties are Hard to TestE. Ben-Sasson, P. Harsha, and S. Raskhodnikova. Electronic Colloquium on Computational Complexity (ECCC), (2003)A security analysis of Probabilistically Checkable Proofs.E. Ben-Sasson, I. Bentov, A. Gabizon, and M. Riabzev. Electronic Colloquium on Computational Complexity (ECCC), (2016)

PUMA

Disambiguation of "Ben-Sasson, Eli"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority.

Please choose a person to relate this publication to

Prof. Dr. -Ing. Rudolf Eligehausen University of Stuttgart

Achim Benz University of Stuttgart

Sara Bender University of Stuttgart

Tobias Bens University of Stuttgart

Maximilian Benn University of Stuttgart

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Ben-Sasson, Eli"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority.

Please choose a person to relate this publication to

Prof. Dr. -Ing. Rudolf Eligehausen University of Stuttgart

Achim Benz University of Stuttgart

Sara Bender University of Stuttgart

Tobias Bens University of Stuttgart

Maximilian Benn University of Stuttgart

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority.