Publications

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

Techniques for Efficient Secure Computation Based on Yao’s Protocol.

2013
Y. Lindell.

At PKC 2013, I gave an invited talk on Techniques for Efficient Secure Computation Based on Yao's Protocol.

A Note on Constant-Round Zero-Knowledge Proofs of Knowledge.

2013
Y. Lindell.

In the Journal of Cryptology, 26(4)638-654, 2013.

A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness

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

In the 10th TCC, Springer (LNCS 7785), pages 243-262, 2013.

On the Feasibility of Extending Oblivious Transfer

2013
Y. Lindell and H. Zarosim

In the 10th TCC, Springer (LNCS 7785), pages 519-538, 2013.

Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries

2013
Y. Lindell.

In CRYPTO 2013, Springer (LNCS 8043), pages 1-17, 2013. In the Journal of Cryptology, 29(2):456-490, 2016.

More Efficient Oblivious Transfer and Extensions for Faster Secure Computation

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

In the 20th ACM Conference on Computer and Communications Security (ACM CCS), pages 535-548, 2013.

Fair and Efficient Secure Multiparty Computation with Reputation Systems

2013
G. Asharov, Y. Lindell and H. Zarosim

In ASIACRYPT 2013, Springer (LNCS 8270), pages 201-220, 2013.

Hiding the Input-Size in Secure Two-Party Computation

2013
Y. Lindell, K. Nissim and C. Orlandi.

In ASIACRYPT 2013, Springer (LNCS 8270), pages 421-440, 2013.