Publications

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

Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs

2011
D. Kidron and Y. Lindell

In the Journal of Cryptology, 24(3):517-544, 2011.

On the Black-Box Complexity of Optimally-Fair Coin Tossing

2011
D. Dachman-Soled, Y. Lindell, M. Mahmoody and T. Malkin

In the 8th TCC, Springer (LNCS 6597), pages 450-467, 2011.

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer

2011
Y. Lindell and B. Pinkas

In the 8th TCC, Springer (LNCS 6597), pages 329-346, 2011. In the Journal of Cryptology, 25(4):680-722,2012.

Highly-Efficient Universally Composable Commitments based on the DDH Assumption

2011
Y. Lindell.

In EUROCRYPT 2011, Springer (LNCS 6632), pages 446-466, 2011. Full version available.

A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation

2011
G. Asharov and Y. Lindell

In the Journal of Cryptology, 30(1):58-151, 2017.

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds

2011
A. Beimel, Y. Lindell, E. Omri and I. Orlov

In CRYPTO 2011, Springer (LNCS 6841), pages 277-296, 2011.

Secure Computation on the Web: Computing without Simultaneous Interaction

2011
S. Halevi, Y. Lindell, and B. Pinkas

In CRYPTO 2011, Springer (LNCS 6841), pages 132-150, 2011.

Perfectly-Secure Multiplication for any t<n/3

2011
G. Asharov, Y. Lindell and T. Rabin

In CRYPTO 2011, Springer (LNCS 6841), pages 240-258, 2011.

The IPS Compiler: Optimizations, Variants and Concrete Efficiency

2011
Y. Lindell, E. Oxman and B. Pinkas

In CRYPTO 2011, Springer (LNCS 6841), pages 259-276, 2011. This is the preliminary full version.