Yehuda Lindell
Yehuda Lindell
Professor of Computer Science, Bar-Ilan University
Verified email at biu.ac.il - Homepage
TitleCited byYear
Privacy preserving data mining
Y Lindell, B Pinkas
Journal of cryptology 15 (3), 177-206, 2002
19552002
Introduction to modern cryptography
J Katz, Y Lindell
CRC PRESS, 2007
1876*2007
Universally composable two-party and multi-party secure computation
R Canetti, Y Lindell, R Ostrovsky, A Sahai
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
6582002
A proof of security of yao’s protocol for two-party computation
Y Lindell, B Pinkas
Journal of Cryptology 22 (2), 161-188, 2009
6012009
Secure multiparty computation for privacy preserving data mining
Y Lindell
Encyclopedia of Data Warehousing and Mining, 1005-1009, 2005
5672005
An efficient protocol for secure two-party computation in the presence of malicious adversaries
Y Lindell, B Pinkas
Journal of Cryptology 28 (2), 312-350, 2015
425*2015
A statistical theory for quantitative association rules
Y Aumann, Y Lindell
Proceedings of the fifth ACM SIGKDD international conference on Knowledge …, 1999
327*1999
A framework for password-based authenticated key exchange
R Gennaro, Y Lindell
International Conference on the Theory and Applications of Cryptographic …, 2003
3152003
Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
C Hazay, Y Lindell
Theory of Cryptography, 155-175, 2008
3112008
Session-key generation using human passwords only
O Goldreich, Y Lindell
Journal of Cryptology 19 (3), 241-340, 2006
300*2006
Security against covert adversaries: Efficient protocols for realistic adversaries
Y Aumann, Y Lindell
Journal of cryptology 23 (2), 281-343, 2010
2802010
Text mining at the term level
R Feldman, M Fresko, Y Kinar, Y Lindell, O Liphstat, M Rajman, Y Schler, ...
Principles of Data Mining and Knowledge Discovery, 65-73, 1998
2561998
On the limitations of universally composable two-party computation without set-up assumptions
R Canetti, E Kushilevitz, Y Lindell
Journal of Cryptology 19 (2), 135-167, 2006
2472006
Universally composable password-based key exchange
R Canetti, S Halevi, J Katz, Y Lindell, P MacKenzie
Advances in Cryptology–Eurocrypt 2005, 557-557, 2005
2472005
Secure two-party computation via cut-and-choose oblivious transfer
Y Lindell, B Pinkas
Theory of Cryptography, 329-346, 2011
2372011
More efficient oblivious transfer and extensions for faster secure computation
G Asharov, Y Lindell, T Schneider, M Zohner
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013
1912013
Efficient Secure Two-Party Protocols: Techniques and Constructions
C Hazay, Y Lindell
Springer-Verlag New York Inc, 2010
1892010
Parallel coin-tossing and constant-round secure two-party computation
Y Lindell
Journal of Cryptology 16 (3), 143-184, 2003
1752003
Fast cut-and-choose-based protocols for malicious and covert adversaries
Y Lindell
Journal of Cryptology 29 (2), 456-490, 2016
1712016
Secure multi-party computation without agreement
S Goldwasser, Y Lindell
Journal of Cryptology 18 (3), 247-287, 2005
160*2005
The system can't perform the operation now. Try again later.
Articles 1–20