Publications

Note: the order of the papers here is according to the year of the conference in which the paper was presented.

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.

2017
G. Asharov, Y. Lindell, T. Schneider and M. Zohner.

The combined full version of this paper, and the ACM CCS 2013 paper on oblivious transfer extensions appeared in the Journal of Cryptology 30(3):805-858, 2017.

High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority.

2017
J. Furukawa, Y. Lindell, A. Nof and O. Weinstein

In EUROCRYPT 2017, Springer (LNCS 10211), pages 225-255, 2017.

Optimized Honest-Majority MPC for Malicious Adversaries – Breaking the 1 Billion-Gate Per Second Barrier.

2017
T. Araki, A. Barak, J. Furukawa, T. Lichter, Y. Lindell, A. Nof, K. Ohara, A. Watzman, and O. Weinstein.

In the 38th IEEE Security and Privacy Conference, pages 843-862, 2017.

Fast Secure Two-Party ECDSA Signing.

2017
Y. Lindell.

In CRYPTO 2017, Springer (LNCS 10402), pages 613-644, 2017.

Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation.

2017
S. Gueron and Y. Lindell.

In the 24th ACM CCS, pages 1019-1036, 2017. Recipient of the best-paper award.

A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority.

2017
Y. Lindell and A. Nof.

In the 24th ACM CCS, pages 259-276, 2017.

Efficient Scalable Constant-Round MPC via Garbled Circuits.

2017
A. Ben-Efraim, Y. Lindell and E. Omri.

In ASIACRYPT 2017, Springer (LNCS 10625), pages 471-498, 2017.

Secure Two-Party Computation with Fairness – A Necessary Design Principle.

2017
Y. Lindell and T. Rabin.

In TCC 2017, Springer (LNCS 10677), pages 565-580, 2017.