Suivre
Yehuda Lindell
Yehuda Lindell
Cryptographer at Coinbase; Professor of Computer Science, Bar-Ilan University (on leave
Adresse e-mail validée de biu.ac.il - Page d'accueil
Titre
Citée par
Citée par
Année
Introduction to modern cryptography
J Katz, Y Lindell
CRC PRESS, 2007
4454*2007
Privacy preserving data mining
Y Lindell, B Pinkas
Journal of cryptology 15 (3), 177-206, 2002
24802002
A proof of security of yao’s protocol for two-party computation
Y Lindell, B Pinkas
Journal of Cryptology 22 (2), 161-188, 2009
9562009
Secure multiparty computation for privacy preserving data mining
Y Lindell
Encyclopedia of Data Warehousing and Mining, 1005-1009, 2005
9442005
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
9352002
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
617*2015
Security against covert adversaries: Efficient protocols for realistic adversaries
Y Aumann, Y Lindell
Journal of cryptology 23 (2), 281-343, 2010
4842010
How to simulate it–a tutorial on the simulation proof technique
Y Lindell
Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich …, 2017
4782017
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
4772013
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
4472008
A framework for password-based authenticated key exchange
R Gennaro, Y Lindell
International Conference on the Theory and Applications of Cryptographic …, 2003
4342003
Efficient Secure Two-Party Protocols: Techniques and Constructions
C Hazay, Y Lindell
Springer-Verlag New York Inc, 2010
4322010
High-throughput semi-honest secure three-party computation with an honest majority
T Araki, J Furukawa, Y Lindell, A Nof, K Ohara
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
4302016
A statistical theory for quantitative association rules
Y Aumann, Y Lindell
Proceedings of the fifth ACM SIGKDD international conference on Knowledge …, 1999
3941999
Universally composable password-based key exchange
R Canetti, S Halevi, J Katz, Y Lindell, P MacKenzie
Advances in Cryptology–Eurocrypt 2005, 557-557, 2005
3532005
Session-key generation using human passwords only
O Goldreich, Y Lindell
Journal of Cryptology 19 (3), 241-340, 2006
3502006
Aggregate message authentication codes
J Katz, AY Lindell
Cryptographers’ Track at the RSA Conference, 155-169, 2008
3452008
Secure two-party computation via cut-and-choose oblivious transfer
Y Lindell, B Pinkas
Theory of Cryptography, 329-346, 2011
3382011
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
3151998
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
2942006
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20