Yehuda Lindell

Citeras av

	Alla	Sedan 2016
Citat	17916	8622
h-index	59	44
i10-index	108	101

2000

1000

500

1500

20012002200320042005200620072008200920102011201220132014201520162017201820192020202145 100 188 282 396 381 457 509 650 788 733 923 1050 1150 1378 1430 1639 1703 1796 1978 45

Medförfattare

Benny PinkasBar Ilan UniversityVerifierad e-postadress på biu.ac.il
Jonathan KatzProfessor of Computer Science, University of MarylandVerifierad e-postadress på cs.umd.edu
Carmit HazayBar-Ilan University, IsraelVerifierad e-postadress på biu.ac.il
Ran CanettiProfessor of Computer Science, Boston UniversityVerifierad e-postadress på bu.edu
Gilad AsharovDepartment of Computer Science, Bar-Ilan UniversityVerifierad e-postadress på biu.ac.il
Tal RabinIBM ResearchVerifierad e-postadress på us.ibm.com
Ariel NofTechnionVerifierad e-postadress på cs.technion.ac.il
Eyal KushilevitzComputer Science Department, TechnionVerifierad e-postadress på cs.technion.ac.il
Shay GueronProfessor, University of Haifa and Senior Principal Engineer, Amazon Web ServicesVerifierad e-postadress på math.haifa.ac.il
Yonatan AumannProfessor of Computer Science, Bar Ilan UniversityVerifierad e-postadress på cs.biu.ac.il
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceVerifierad e-postadress på weizmann.ac.il
Nigel SmartKU LeuvenVerifierad e-postadress på kuleuven.be
Eran OmriAriel UniversityVerifierad e-postadress på ariel.ac.il
Rafail OstrovskyProfessor of Computer Science and Professor of Mathematics, UCLAVerifierad e-postadress på cs.ucla.edu
Amit SahaiSymantec Chair Professor of Computer Science, UCLA; Director of Center for Encrypted FunctionalitiesVerifierad e-postadress på cs.ucla.edu
Yuval IshaiVerifierad e-postadress på cs.technion.ac.il
Shai HaleviResearch Fellow, Algorand FoundationVerifierad e-postadress på alum.mit.edu
Michael ZohnerContinental AGVerifierad e-postadress på cased.de
Thomas SchneiderTechnical University of DarmstadtVerifierad e-postadress på encrypto.cs.tu-darmstadt.de
Rosario GennaroProfessor of Computer Science, City College of New YorkVerifierad e-postadress på cs.ccny.cuny.edu

Yehuda Lindell

Professor of Computer Science, Bar-Ilan University

Verifierad e-postadress på biu.ac.il - Startsida

Cryptography


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Introduction to modern cryptography J Katz, Y Lindell CRC PRESS, 2007	2832*	2007
Privacy preserving data mining YLB Pinkas, Y Lindell Advances in Cryptology-CRYPTO, Santa Barbara, California, USA, 2000	2233*	2000
Privacy preserving data mining Y Lindell, B Pinkas Journal of cryptology 15 (3), 177-206, 2002	2232	2002
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	774	2002
Secure multiparty computation for privacy preserving data mining Y Lindell Encyclopedia of Data Warehousing and Mining, 1005-1009, 2005	758	2005
A proof of security of yao’s protocol for two-party computation Y Lindell, B Pinkas Journal of Cryptology 22 (2), 161-188, 2009	754	2009
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	508*	2015
A framework for password-based authenticated key exchange R Gennaro, Y Lindell International Conference on the Theory and Applications of Cryptographic …, 2003	374	2003
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	373	2008
A statistical theory for quantitative association rules Y Aumann, Y Lindell Journal of Intelligent Information Systems 20 (3), 255-283, 2003	356	2003
Security against covert adversaries: Efficient protocols for realistic adversaries Y Aumann, Y Lindell Journal of cryptology 23 (2), 281-343, 2010	352	2010
Session-key generation using human passwords only O Goldreich, Y Lindell Journal of Cryptology 19 (3), 241-340, 2006	329*	2006
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	318	2013
Universally composable password-based key exchange R Canetti, S Halevi, J Katz, Y Lindell, P MacKenzie Advances in Cryptology–Eurocrypt 2005, 557-557, 2005	296	2005
Efficient Secure Two-Party Protocols: Techniques and Constructions C Hazay, Y Lindell Springer-Verlag New York Inc, 2010	291	2010
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	285	1998
Secure two-party computation via cut-and-choose oblivious transfer Y Lindell, B Pinkas Theory of Cryptography, 329-346, 2011	281	2011
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	265	2006
Parallel coin-tossing and constant-round secure two-party computation Y Lindell Journal of Cryptology 16 (3), 143-184, 2003	215	2003
Fast cut-and-choose-based protocols for malicious and covert adversaries Y Lindell Journal of Cryptology 29 (2), 456-490, 2016	210	2016

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Ladda upp PDF

Följ den här författaren

Citeras av

Medförfattare