Publications

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

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

2008
C. Hazay and Y. Lindell.

In the Journal of Cryptology, 23(3):422-456, 2010. An extended abstract appeared in TCC 2008, Springer (LNCS 4948) pages 155-175, 2008.

Aggregate Message Authentication Codes

2008
J. Katz and Y. Lindell.

In CT-RSA, Springer (LNCS 4964), pages 155-169, 2008.

Legally Enforceable Fairness in Secure Two-Party Computation

2008
Y. Lindell.

In CT-RSA, Springer (LNCS 4964), pages 121-137, 2008.

Efficient Fully-Simulatable Oblivious Transfer

2008
Y. Lindell

In the Chicago Journal of Theoretical Computer Science, 2008. Preliminary version appeared in CT-RSA, Springer (LNCS 4964), pages 52-70, 2008.

Complete Fairness in Secure Two-Party Computation

2008
S.D. Gordon, C. Hazay, J. Katz and Y. Lindell.

In the 40th STOC, pages 413-422, 2008. In the Journal of the ACM, 58(6):24, 2011.

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

2008
Y. Lindell, B. Pinkas and N. Smart.

In the 6th Conference on Security and Cryptography for Networks, Springer (LNCS 5229), pages 2-20, 2008.

Constructions of Truly Practical Secure Protocols using Standard Smartcards

2008
C. Hazay and Y. Lindell.

In the 15th ACM Conference on Computer and Communications Security (ACM CCS), pages 491-500, 2008. Full version available.