ד"ר כרמית חזאי סמינר בנושאים מתקדמים בחישוב בטוח 83-864

Efficient secure two-party protocols : techniques and constructions
Carmit Hazay, Yehuda Lindell
Berlin : Springer, c2010..
005.8 HAZ e
   
   

 

 

 

 

 

 

 

 

Yao, Andrew C.; Yao, Andrew C.; Yao, Andrew C.; Yao, Andrew C., "Protocols for secure computations," Foundations of Computer Science, 1982. SFCS '08. 23rd Annual Symposium on , vol., no., pp.160,164, 3-5 Nov. 1982 doi: 10.1109/SFCS.1982.38

O. Goldreich, S. Micali, and A. Wigderson. 1987. How to play ANY mental game. In Proceedings of the nineteenth annual ACM symposium on Theory of computing (STOC '87), Alfred V. Aho (Ed.). ACM, New York, NY, USA, 218-229. DOI=10.1145/28395.28420  . 

Yehuda Lindell and Benny Pinkas. A Proof of Yao's Protocol for Secure Two-Party Computation. Journal of Cryptology. April 2009, Volume 22, Issue 2, pp 161-188

Dahlia Malkhi, Noam Nisan, Benny Pinkas and Yaron Sella. Fairplay - A Secure Two-Party Computation System.

Michael Freedman, Kobbi Nissim and Benny Pinkas. Efficient Private Matching and Set Intersection.
Advances in Cryptology - EUROCRYPT 2004 Lecture Notes in Computer Science Volume 3027, 2004, pp 1-19

Carmit Hazay and Tooft. Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. Advances in Cryptology - ASIACRYPT 2010 Lecture Notes in Computer Science Volume 6477, 2010, pp 195-212