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

Affine Dispersers from Subspace Polynomials.E. Ben-Sasson, and S. Kopparty. SIAM J. Comput., 41 (4): 880-914 (2012)Towards lower bounds on locally testable codes via density arguments.E. Ben-Sasson, and M. Viderman. Computational Complexity, 21 (2): 267-309 (2012)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)SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge.E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza. CRYPTO (2), volume 8043 of Lecture Notes in Computer Science, page 90-108. Springer, (2013)Size space tradeoffs for resolution.E. Ben-Sasson. STOC, page 457-464. ACM, (2002)Zerocash: Decentralized Anonymous Payments from Bitcoin.E. Ben-Sasson, A. Chiesa, C. Garman, M. Green, I. Miers, E. Tromer, and M. Virza. IEEE Symposium on Security and Privacy, page 459-474. IEEE Computer Society, (2014)Short Proofs are Narrow - Resolution Made Simple.E. Ben-Sasson, and A. Wigderson. STOC, page 517-526. ACM, (1999)Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions.E. Ben-Sasson, and J. Nordström. ICS, page 401-416. Tsinghua University Press, (2011)Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack GamesE. Ben-Sasson, and P. Harsha. Electronic Colloquium on Computational Complexity (ECCC), (2003)Limits on the rate of locally testable affine-invariant codes.E. Ben-Sasson, and M. Sudan. Electronic Colloquium on Computational Complexity (ECCC), (2010)

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.