Edit Profile (opens in new tab) Lindell, Yehuda Co-Author Distance Author ID: lindell.yehuda Published as: Lindell, Yehuda External Links: MGP · Wikidata · GND · IdRef Documents Indexed: 108 Publications since 2000, including 5 Books 2 Contributions as Editor Software Indexed: 1 Package Co-Authors: 64 Co-Authors with 86 Joint Publications 1,547 Co-Co-Authors all top 5 Co-Authors 24 single-authored 14 Pinkas, Benny 11 Katz, Jonathan N. 10 Rabin, Tal 8 Asharov, Gilad 8 Kushilevitz, Eyal 7 Canetti, Ran 7 Zarosim, Hila 6 Hazay, Carmit 5 Barak, Boaz 5 Nof, Ariel 5 Omri, Eran 5 Smart, Nigel Paul 4 Ishai, Yuval 4 Petrank, Erez 3 Lysyanskaya, Anna 3 Yanai, Avishay 2 Aumann, Yonatan 2 Beimel, Amos 2 Chida, Koji 2 Cohen, Ran 2 Furukawa, Jun 2 Genkin, Daniel 2 Goldreich, Oded 2 Goldwasser, Shafi 2 Gordon, S. Dov 2 Halevi, Shai 2 Hamada, Koki 2 Ikarashi, Dai 2 Kikuchi, Ryo 2 Orlov, Ilan 2 Osheter, Valery 2 Pass, Rafael 2 Prabhakaran, Manoj M. 2 Schneider, Thomas 2 Tauman Kalai, Yael 2 Weinstein, Or 2 Zohner, Michael 1 Alwen, Joël 1 Ben-Efraim, Aner 1 Carmit, Hazay 1 Dachman-Soled, Dana 1 Frederiksen, Tore Kasper 1 Gennaro, Rosario 1 Gueron, Shay 1 Haitner, Iftach 1 Kidron, Dafna 1 Koo, Chiu-Yuen 1 Kraitsberg, Michael 1 MacKenzie, Phil 1 Mahmoody, Mohammad 1 Malkin, Tal G. 1 Nissim, Kobbi 1 Orlandi, Claudio 1 Ostrovsky, Rafail 1 Oxman, Eli 1 Patra, Arpita 1 Persiano, Giuseppe 1 Riva, Ben 1 Sahai, Amit 1 Shelat, Abhi 1 Soria-Vazquez, Eduardo 1 Talibi Alaoui, Younes 1 Vadhan, Salil P. 1 Visconti, Ivan all top 5 Serials 32 Journal of Cryptology 4 SIAM Journal on Computing 3 Chicago Journal of Theoretical Computer Science 3 Chapman & Hall/CRC Cryptography and Network Security 2 Journal of the ACM 2 Lecture Notes in Computer Science 2 Information Security and Cryptography 1 Journal of Computer and System Sciences all top 5 Fields 100 Information and communication theory, circuits (94-XX) 53 Computer science (68-XX) 2 General and overarching topics; collections (00-XX) 2 Number theory (11-XX) 1 Mathematical logic and foundations (03-XX) 1 Quantum theory (81-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 106 Publications have been cited 2,213 times in 1,239 Documents Cited by ▼ Year ▼ Universally composable two-party and multi-party secure computation. Zbl 1192.94112 Canetti, Ran; Lindell, Yehuda; Ostrovsky, Rafail; Sahai, Amit 174 2002 A proof of security of Yao’s protocol for two-party computation. Zbl 1159.94364 Lindell, Yehuda; Pinkas, Benny 110 2009 Introduction to modern cryptography. Zbl 1143.94001 Katz, Jonathan; Lindell, Yehuda 76 2008 An efficient protocol for secure two-party computation in the presence of malicious adversaries. Zbl 1141.94362 Lindell, Yehuda; Pinkas, Benny 68 2007 Universally composable password-based key exchange. Zbl 1137.94367 Canetti, Ran; Halevi, Shai; Katz, Jonathan; Lindell, Yehuda; MacKenzie, Phil 61 2005 Efficient secure two-party protocols. Techniques and constructions. Zbl 1208.68005 Hazay, Carmit; Lindell, Yehuda 57 2010 A framework for password-based authenticated key exchange. Zbl 1038.94534 Gennaro, Rosario; Lindell, Yehuda 53 2003 Fast large-scale honest-majority MPC for malicious adversaries. Zbl 1446.94118 Chida, Koji; Genkin, Daniel; Hamada, Koki; Ikarashi, Dai; Kikuchi, Ryo; Lindell, Yehuda; Nof, Ariel 46 2018 Secure multi-party computation without agreement. Zbl 1102.68472 Goldwasser, Shafi; Lindell, Yehuda 42 2005 Privacy preserving data mining. Zbl 0989.68506 Lindell, Yehuda; Pinkas, Benny 41 2000 Secure computation on the web: computing without simultaneous interaction. Zbl 1287.94070 Halevi, Shai; Lindell, Yehuda; Pinkas, Benny 40 2011 Parallel coin-tossing and constant-round secure two-party computation. Zbl 1027.94011 Lindell, Yehuda 37 2003 Introduction to modern cryptography. 2nd ed. Zbl 1323.94001 Katz, Jonathan; Lindell, Yehuda 36 2015 Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Zbl 1162.94367 Hazay, Carmit; Lindell, Yehuda 35 2008 Privacy preserving data mining. Zbl 1010.94008 Lindell, Yehuda; Pinkas, Benny 35 2002 Efficient constant round multi-party computation combining BMR and SPDZ. Zbl 1352.94049 Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P.; Yanai, Avishay 35 2015 A full proof of the BGW protocol for perfectly secure multiparty computation. Zbl 1370.94480 Asharov, Gilad; Lindell, Yehuda 34 2017 High-throughput secure three-party computation for malicious adversaries and an honest majority. Zbl 1415.94431 Furukawa, Jun; Lindell, Yehuda; Nof, Ariel; Weinstein, Or 34 2017 Complete fairness in secure two-party computation. Zbl 1231.94062 Gordon, S. Dov; Carmit, Hazay; Katz, Jonathan; Lindell, Yehuda 33 2008 Secure two-party computation via cut-and-choose oblivious transfer. Zbl 1281.94037 Lindell, Yehuda; Pinkas, Benny 30 2011 Highly-efficient universally-composable commitments based on the DDH assumption. Zbl 1291.68037 Lindell, Yehuda 29 2011 An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle. Zbl 1354.94038 Lindell, Yehuda 29 2015 Security against covert adversaries: efficient protocols for realistic adversaries. Zbl 1129.94010 Aumann, Yonatan; Lindell, Yehuda 29 2007 On the limitations of universally composable two-party computation without set-up assumptions. Zbl 1038.94523 Canetti, Ran; Kushilevitz, Eyal; Lindell, Yehuda 29 2003 Fast cut-and-choose based protocols for malicious and covert adversaries. Zbl 1316.94082 Lindell, Yehuda 28 2013 Fast secure two-party ECDSA signing. Zbl 1410.94091 Lindell, Yehuda 28 2017 Lower bounds for non-black-box zero knowledge. Zbl 1094.68024 Barak, Boaz; Lindell, Yehuda; Vadhan, Salil 28 2006 On the black-box complexity of optimally-fair coin tossing. Zbl 1295.94044 Dachman-Soled, Dana; Lindell, Yehuda; Mahmoody, Mohammad; Malkin, Tal 27 2011 A simpler variant of universally composable security for standard multiparty computation. Zbl 1351.94031 Canetti, Ran; Cohen, Asaf; Lindell, Yehuda 27 2015 Bounded-concurrent secure two-party computation without setup assumptions. Zbl 1192.94123 Lindell, Yehuda 27 2003 Lower bounds for concurrent self composition. Zbl 1176.94069 Lindell, Yehuda 26 2004 How to simulate it – a tutorial on the simulation proof technique. Zbl 1481.94111 Lindell, Yehuda 24 2017 More efficient oblivious transfer extensions with security for malicious adversaries. Zbl 1370.94481 Asharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael 24 2015 Security against covert adversaries: Efficient protocols for realistic adversaries. Zbl 1181.94091 Aumann, Yonatan; Lindell, Yehuda 23 2010 Secure computation without authentication. Zbl 1145.94457 Barak, Boaz; Canetti, Ran; Lindell, Yehuda; Pass, Rafael; Rabin, Tal 22 2005 Fast garbling of circuits under standard assumptions. Zbl 1400.94146 Gueron, Shay; Lindell, Yehuda; Nof, Ariel; Pinkas, Benny 22 2018 On the limitations of universally composable two-party computation without set-up assumptions. Zbl 1101.68549 Canetti, Ran; Kushilevitz, Eyal; Lindell, Yehuda 22 2006 Black-box constructions of protocols for secure computation. Zbl 1236.94056 Haitner, Iftach; Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez 21 2011 Fairness versus guaranteed output delivery in secure multiparty computation. Zbl 1386.94067 Cohen, Ran; Lindell, Yehuda 20 2017 Secure two-party computation via cut-and-choose oblivious transfer. Zbl 1278.94056 Lindell, Yehuda; Pinkas, Benny 20 2012 Composition of secure multi-party protocols. A comprehensive study. Zbl 1041.68036 Lindell, Yehuda 20 2003 A simpler construction of CCA2-secure public-key encryption under general assumptions. Zbl 1037.68535 Lindell, Yehuda 20 2003 Black-box constructions for secure computation. Zbl 1301.94116 Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez 20 2006 \(1/p\)-secure multiparty computation without honest majority and the best of both worlds. Zbl 1287.94051 Beimel, Amos; Lindell, Yehuda; Omri, Eran; Orlov, Ilan 19 2011 Fairness versus guaranteed output delivery in secure multiparty computation. Zbl 1317.94099 Cohen, Ran; Lindell, Yehuda 18 2014 Information-theoretically secure protocols and security under composition. Zbl 1301.94119 Kushilevitz, Eyal; Lindell, Yehuda; Rabin, Tal 18 2006 Parallel coin-tossing and constant-round secure two-party computation. Zbl 1002.94521 Lindell, Yehuda 17 2001 Session-key generation using human passwords only. Zbl 1003.94527 Goldreich, Oded; Lindell, Yehuda 17 2001 Complete fairness in secure two-party computation. Zbl 1281.94081 Gordon, S. Dov; Hazay, Carmit; Katz, Jonathan; Lindell, Yehuda 17 2011 Cut-and-choose yao-based secure computation in the online/offline and batch settings. Zbl 1335.94067 Lindell, Yehuda; Riva, Ben 17 2014 Strict polynomial-time in simulation and extraction. Zbl 1192.68343 Barak, Boaz; Lindell, Yehuda 17 2002 Information-theoretically secure protocols and security under composition. Zbl 1202.94185 Kushilevitz, Eyal; Lindell, Yehuda; Rabin, Tal 16 2010 Sequential composition of protocols without simultaneous termination. Zbl 1292.68023 Lindell, Yehuda; Lysyanskaya, Anna; Rabin, Tal 16 2002 Secure computation without agreement. Zbl 1029.68511 Goldwasser, Shafi; Lindell, Yehuda 16 2002 The IPS compiler: optimizations, variants and concrete efficiency. Zbl 1288.68023 Lindell, Yehuda; Oxman, Eli; Pinkas, Benny 15 2011 Concurrently-secure blind signatures without random oracles or setup assumptions. Zbl 1129.94044 Hazay, Carmit; Katz, Jonathan; Koo, Chiu-Yuen; Lindell, Yehuda 15 2007 Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Zbl 1195.94058 Hazay, Carmit; Lindell, Yehuda 14 2010 On achieving the “best of both worlds” in secure multiparty computation. Zbl 1215.68035 Ishai, Yuval; Katz, Jonathan; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez 14 2011 On combining privacy with guaranteed output delivery in secure multiparty computation. Zbl 1161.94444 Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez 14 2006 More efficient constant-round multi-party computation from BMR and SHE. Zbl 1406.94071 Lindell, Yehuda; Smart, Nigel P.; Soria-Vazquez, Eduardo 13 2016 Strict polynomial-time in simulation and extraction. Zbl 1060.94014 Barak, Boaz; Lindell, Yehuda 12 2004 A note on constant-round zero-knowledge proofs of knowledge. Zbl 1283.94074 Lindell, Yehuda 12 2013 Fast distributed RSA key generation for semi-honest and malicious adversaries. Zbl 1436.94061 Frederiksen, Tore Kasper; Lindell, Yehuda; Osheter, Valery; Pinkas, Benny 12 2018 Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. Zbl 1251.94034 Lindell, Yehuda; Zarosim, Hila 11 2011 Utility dependence in correct and fair rational secret sharing. Zbl 1209.94034 Asharov, Gilad; Lindell, Yehuda 11 2011 Implementing two-party computation efficiently with security against malicious adversaries. Zbl 1180.68152 Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P. 11 2008 Hiding the input-size in secure two-party computation. Zbl 1326.94110 Lindell, Yehuda; Nissim, Kobbi; Orlandi, Claudio 11 2013 A full characterization of functions that imply fair coin tossing and ramifications to fairness. Zbl 1315.94051 Asharov, Gilad; Lindell, Yehuda; Rabin, Tal 11 2013 On the composition of authenticated Byzantine agreement. Zbl 1326.68041 Lindell, Yehuda; Lysyanskaya, Anna; Rabin, Tal 10 2006 A simpler construction of CCA2-secure public-key encryption under general assumptions. Zbl 1103.68528 Lindell, Yehuda 10 2006 Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24–26, 2014. Proceedings. Zbl 1280.94007 10 2014 On the composition of authenticated byzantine agreement. Zbl 1192.68084 Lindell, Yehuda; Lysyanskaya, Anna; Rabin, Tal 10 2002 Lower bounds and impossibility results for concurrent self composition. Zbl 1143.94012 Lindell, Yehuda 9 2008 Fast cut-and-choose-based protocols for malicious and covert adversaries. Zbl 1355.94068 Lindell, Yehuda 9 2016 Session-key generation using human passwords only. Zbl 1103.68513 Goldreich, Oded; Lindell, Yehuda 9 2006 Concurrent general composition of secure protocols in the timing model. Zbl 1192.94121 Kalai, Yael Tauman; Lindell, Yehuda; Prabhakaran, Manoj 9 2005 Concurrent composition of secure protocols in the timing model. Zbl 1130.68049 Kalai, Yael Tauman; Lindell, Yehuda; Prabhakaran, Manoj 8 2007 Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich. Zbl 1411.94003 8 2017 Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. Zbl 1213.68249 Lindell, Yehuda; Zarosim, Hila 7 2009 Introduction to modern cryptography. 3rd edition. Zbl 1479.94002 Katz, Jonathan; Lindell, Yehuda 7 2021 Efficient scalable constant-round MPC via garbled circuits. Zbl 1417.94042 Ben-Efraim, Aner; Lindell, Yehuda; Omri, Eran 7 2017 Impossibility results for universal composability in public-key models and with fixed inputs. Zbl 1258.94039 Kidron, Dafna; Lindell, Yehuda 6 2011 More efficient oblivious transfer extensions. Zbl 1377.94030 Asharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael 6 2017 Collusion-free multiparty computation in the mediated model. Zbl 1252.94042 Alwen, Joël; Katz, Jonathan; Lindell, Yehuda; Persiano, Giuseppe; Shelat, Abhi; Visconti, Ivan 6 2009 Utility dependence in correct and fair rational secret sharing. Zbl 1252.94105 Asharov, Gilad; Lindell, Yehuda 6 2009 On the feasibility of extending oblivious transfer. Zbl 1315.94086 Lindell, Yehuda; Zarosim, Hila 6 2013 Handling expected polynomial-time strategies in simulation-based security proofs. Zbl 1161.94410 Katz, Jonathan; Lindell, Yehuda 5 2008 Handling expected polynomial-time strategies in simulation-based security proofs. Zbl 1079.94555 Katz, Jonathan; Lindell, Yehuda 5 2005 Perfectly-secure multiplication for any \(t < n/3\). Zbl 1287.94045 Asharov, Gilad; Lindell, Yehuda; Rabin, Tal 5 2011 Adaptively secure computation with partial erasures. Zbl 1333.94038 Hazay, Carmit; Lindell, Yehuda; Patra, Arpita 5 2015 An efficient protocol for secure two-party computation in the presence of malicious adversaries. Zbl 1314.94086 Lindell, Yehuda; Pinkas, Benny 5 2015 General composition and universal composability in secure multiparty computation. Zbl 1184.94243 Lindell, Yehuda 5 2009 Secure two-party computation with fairness – a necessary design principle. Zbl 1410.94092 Lindell, Yehuda; Rabin, Tal 5 2017 \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds. Zbl 1453.94131 Beimel, Amos; Lindell, Yehuda; Omri, Eran; Orlov, Ilan 4 2020 Efficient fully-simulatable oblivious transfer. Zbl 1286.68020 Lindell, Yehuda 4 2008 Adding distributed decryption and key generation to a ring-LWE based CCA encryption scheme. Zbl 1457.94154 Kraitsberg, Michael; Lindell, Yehuda; Osheter, Valery; Smart, Nigel P.; Talibi Alaoui, Younes 4 2019 Secure computation without authentication. Zbl 1243.94024 Barak, Boaz; Canetti, Ran; Lindell, Yehuda; Pass, Rafael; Rabin, Tal 3 2011 High-throughput secure three-party computation with an honest majority. Zbl 07707563 Furukawa, Jun; Lindell, Yehuda; Nof, Ariel; Weinstein, Or 3 2023 Fast secure two-party ECDSA signing. Zbl 1479.94332 Lindell, Yehuda 2 2021 Fair and efficient secure multiparty computation with reputation systems. Zbl 1314.94052 Asharov, Gilad; Lindell, Yehuda; Zarosim, Hila 2 2013 High-throughput secure three-party computation with an honest majority. Zbl 07707563 Furukawa, Jun; Lindell, Yehuda; Nof, Ariel; Weinstein, Or 3 2023 Introduction to modern cryptography. 3rd edition. Zbl 1479.94002 Katz, Jonathan; Lindell, Yehuda 7 2021 Fast secure two-party ECDSA signing. Zbl 1479.94332 Lindell, Yehuda 2 2021 \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds. Zbl 1453.94131 Beimel, Amos; Lindell, Yehuda; Omri, Eran; Orlov, Ilan 4 2020 Adding distributed decryption and key generation to a ring-LWE based CCA encryption scheme. Zbl 1457.94154 Kraitsberg, Michael; Lindell, Yehuda; Osheter, Valery; Smart, Nigel P.; Talibi Alaoui, Younes 4 2019 Efficient constant-round multi-party computation combining BMR and SPDZ. Zbl 1466.94033 Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P.; Yanai, Avishay 1 2019 Fast large-scale honest-majority MPC for malicious adversaries. Zbl 1446.94118 Chida, Koji; Genkin, Daniel; Hamada, Koki; Ikarashi, Dai; Kikuchi, Ryo; Lindell, Yehuda; Nof, Ariel 46 2018 Fast garbling of circuits under standard assumptions. Zbl 1400.94146 Gueron, Shay; Lindell, Yehuda; Nof, Ariel; Pinkas, Benny 22 2018 Fast distributed RSA key generation for semi-honest and malicious adversaries. Zbl 1436.94061 Frederiksen, Tore Kasper; Lindell, Yehuda; Osheter, Valery; Pinkas, Benny 12 2018 On the feasibility of extending oblivious transfer. Zbl 1400.94164 Lindell, Yehuda; Zarosim, Hila 1 2018 Completeness for symmetric two-party functionalities: revisited. Zbl 1400.94163 Lindell, Yehuda; Omri, Eran; Zarosim, Hila 1 2018 Fast garbling of circuits over 3-valued logic. Zbl 1441.94085 Lindell, Yehuda; Yanai, Avishay 1 2018 A full proof of the BGW protocol for perfectly secure multiparty computation. Zbl 1370.94480 Asharov, Gilad; Lindell, Yehuda 34 2017 High-throughput secure three-party computation for malicious adversaries and an honest majority. Zbl 1415.94431 Furukawa, Jun; Lindell, Yehuda; Nof, Ariel; Weinstein, Or 34 2017 Fast secure two-party ECDSA signing. Zbl 1410.94091 Lindell, Yehuda 28 2017 How to simulate it – a tutorial on the simulation proof technique. Zbl 1481.94111 Lindell, Yehuda 24 2017 Fairness versus guaranteed output delivery in secure multiparty computation. Zbl 1386.94067 Cohen, Ran; Lindell, Yehuda 20 2017 Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich. Zbl 1411.94003 8 2017 Efficient scalable constant-round MPC via garbled circuits. Zbl 1417.94042 Ben-Efraim, Aner; Lindell, Yehuda; Omri, Eran 7 2017 More efficient oblivious transfer extensions. Zbl 1377.94030 Asharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael 6 2017 Secure two-party computation with fairness – a necessary design principle. Zbl 1410.94092 Lindell, Yehuda; Rabin, Tal 5 2017 More efficient constant-round multi-party computation from BMR and SHE. Zbl 1406.94071 Lindell, Yehuda; Smart, Nigel P.; Soria-Vazquez, Eduardo 13 2016 Fast cut-and-choose-based protocols for malicious and covert adversaries. Zbl 1355.94068 Lindell, Yehuda 9 2016 Introduction to modern cryptography. 2nd ed. Zbl 1323.94001 Katz, Jonathan; Lindell, Yehuda 36 2015 Efficient constant round multi-party computation combining BMR and SPDZ. Zbl 1352.94049 Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P.; Yanai, Avishay 35 2015 An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle. Zbl 1354.94038 Lindell, Yehuda 29 2015 A simpler variant of universally composable security for standard multiparty computation. Zbl 1351.94031 Canetti, Ran; Cohen, Asaf; Lindell, Yehuda 27 2015 More efficient oblivious transfer extensions with security for malicious adversaries. Zbl 1370.94481 Asharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael 24 2015 Adaptively secure computation with partial erasures. Zbl 1333.94038 Hazay, Carmit; Lindell, Yehuda; Patra, Arpita 5 2015 An efficient protocol for secure two-party computation in the presence of malicious adversaries. Zbl 1314.94086 Lindell, Yehuda; Pinkas, Benny 5 2015 Fairness versus guaranteed output delivery in secure multiparty computation. Zbl 1317.94099 Cohen, Ran; Lindell, Yehuda 18 2014 Cut-and-choose yao-based secure computation in the online/offline and batch settings. Zbl 1335.94067 Lindell, Yehuda; Riva, Ben 17 2014 Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24–26, 2014. Proceedings. Zbl 1280.94007 10 2014 Fast cut-and-choose based protocols for malicious and covert adversaries. Zbl 1316.94082 Lindell, Yehuda 28 2013 A note on constant-round zero-knowledge proofs of knowledge. Zbl 1283.94074 Lindell, Yehuda 12 2013 Hiding the input-size in secure two-party computation. Zbl 1326.94110 Lindell, Yehuda; Nissim, Kobbi; Orlandi, Claudio 11 2013 A full characterization of functions that imply fair coin tossing and ramifications to fairness. Zbl 1315.94051 Asharov, Gilad; Lindell, Yehuda; Rabin, Tal 11 2013 On the feasibility of extending oblivious transfer. Zbl 1315.94086 Lindell, Yehuda; Zarosim, Hila 6 2013 Fair and efficient secure multiparty computation with reputation systems. Zbl 1314.94052 Asharov, Gilad; Lindell, Yehuda; Zarosim, Hila 2 2013 Secure two-party computation via cut-and-choose oblivious transfer. Zbl 1278.94056 Lindell, Yehuda; Pinkas, Benny 20 2012 Completeness for symmetric two-party functionalities – revisited. Zbl 1292.94102 Lindell, Yehuda; Omri, Eran; Zarosim, Hila 2 2012 Secure computation on the web: computing without simultaneous interaction. Zbl 1287.94070 Halevi, Shai; Lindell, Yehuda; Pinkas, Benny 40 2011 Secure two-party computation via cut-and-choose oblivious transfer. Zbl 1281.94037 Lindell, Yehuda; Pinkas, Benny 30 2011 Highly-efficient universally-composable commitments based on the DDH assumption. Zbl 1291.68037 Lindell, Yehuda 29 2011 On the black-box complexity of optimally-fair coin tossing. Zbl 1295.94044 Dachman-Soled, Dana; Lindell, Yehuda; Mahmoody, Mohammad; Malkin, Tal 27 2011 Black-box constructions of protocols for secure computation. Zbl 1236.94056 Haitner, Iftach; Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez 21 2011 \(1/p\)-secure multiparty computation without honest majority and the best of both worlds. Zbl 1287.94051 Beimel, Amos; Lindell, Yehuda; Omri, Eran; Orlov, Ilan 19 2011 Complete fairness in secure two-party computation. Zbl 1281.94081 Gordon, S. Dov; Hazay, Carmit; Katz, Jonathan; Lindell, Yehuda 17 2011 The IPS compiler: optimizations, variants and concrete efficiency. Zbl 1288.68023 Lindell, Yehuda; Oxman, Eli; Pinkas, Benny 15 2011 On achieving the “best of both worlds” in secure multiparty computation. Zbl 1215.68035 Ishai, Yuval; Katz, Jonathan; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez 14 2011 Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. Zbl 1251.94034 Lindell, Yehuda; Zarosim, Hila 11 2011 Utility dependence in correct and fair rational secret sharing. Zbl 1209.94034 Asharov, Gilad; Lindell, Yehuda 11 2011 Impossibility results for universal composability in public-key models and with fixed inputs. Zbl 1258.94039 Kidron, Dafna; Lindell, Yehuda 6 2011 Perfectly-secure multiplication for any \(t < n/3\). Zbl 1287.94045 Asharov, Gilad; Lindell, Yehuda; Rabin, Tal 5 2011 Secure computation without authentication. Zbl 1243.94024 Barak, Boaz; Canetti, Ran; Lindell, Yehuda; Pass, Rafael; Rabin, Tal 3 2011 Efficient secure two-party protocols. Techniques and constructions. Zbl 1208.68005 Hazay, Carmit; Lindell, Yehuda 57 2010 Security against covert adversaries: Efficient protocols for realistic adversaries. Zbl 1181.94091 Aumann, Yonatan; Lindell, Yehuda 23 2010 Information-theoretically secure protocols and security under composition. Zbl 1202.94185 Kushilevitz, Eyal; Lindell, Yehuda; Rabin, Tal 16 2010 Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Zbl 1195.94058 Hazay, Carmit; Lindell, Yehuda 14 2010 A proof of security of Yao’s protocol for two-party computation. Zbl 1159.94364 Lindell, Yehuda; Pinkas, Benny 110 2009 Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. Zbl 1213.68249 Lindell, Yehuda; Zarosim, Hila 7 2009 Collusion-free multiparty computation in the mediated model. Zbl 1252.94042 Alwen, Joël; Katz, Jonathan; Lindell, Yehuda; Persiano, Giuseppe; Shelat, Abhi; Visconti, Ivan 6 2009 Utility dependence in correct and fair rational secret sharing. Zbl 1252.94105 Asharov, Gilad; Lindell, Yehuda 6 2009 General composition and universal composability in secure multiparty computation. Zbl 1184.94243 Lindell, Yehuda 5 2009 Introduction to modern cryptography. Zbl 1143.94001 Katz, Jonathan; Lindell, Yehuda 76 2008 Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Zbl 1162.94367 Hazay, Carmit; Lindell, Yehuda 35 2008 Complete fairness in secure two-party computation. Zbl 1231.94062 Gordon, S. Dov; Carmit, Hazay; Katz, Jonathan; Lindell, Yehuda 33 2008 Implementing two-party computation efficiently with security against malicious adversaries. Zbl 1180.68152 Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P. 11 2008 Lower bounds and impossibility results for concurrent self composition. Zbl 1143.94012 Lindell, Yehuda 9 2008 Handling expected polynomial-time strategies in simulation-based security proofs. Zbl 1161.94410 Katz, Jonathan; Lindell, Yehuda 5 2008 Efficient fully-simulatable oblivious transfer. Zbl 1286.68020 Lindell, Yehuda 4 2008 An efficient protocol for secure two-party computation in the presence of malicious adversaries. Zbl 1141.94362 Lindell, Yehuda; Pinkas, Benny 68 2007 Security against covert adversaries: efficient protocols for realistic adversaries. Zbl 1129.94010 Aumann, Yonatan; Lindell, Yehuda 29 2007 Concurrently-secure blind signatures without random oracles or setup assumptions. Zbl 1129.94044 Hazay, Carmit; Katz, Jonathan; Koo, Chiu-Yuen; Lindell, Yehuda 15 2007 Concurrent composition of secure protocols in the timing model. Zbl 1130.68049 Kalai, Yael Tauman; Lindell, Yehuda; Prabhakaran, Manoj 8 2007 Lower bounds for non-black-box zero knowledge. Zbl 1094.68024 Barak, Boaz; Lindell, Yehuda; Vadhan, Salil 28 2006 On the limitations of universally composable two-party computation without set-up assumptions. Zbl 1101.68549 Canetti, Ran; Kushilevitz, Eyal; Lindell, Yehuda 22 2006 Black-box constructions for secure computation. Zbl 1301.94116 Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez 20 2006 Information-theoretically secure protocols and security under composition. Zbl 1301.94119 Kushilevitz, Eyal; Lindell, Yehuda; Rabin, Tal 18 2006 On combining privacy with guaranteed output delivery in secure multiparty computation. Zbl 1161.94444 Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez 14 2006 On the composition of authenticated Byzantine agreement. Zbl 1326.68041 Lindell, Yehuda; Lysyanskaya, Anna; Rabin, Tal 10 2006 A simpler construction of CCA2-secure public-key encryption under general assumptions. Zbl 1103.68528 Lindell, Yehuda 10 2006 Session-key generation using human passwords only. Zbl 1103.68513 Goldreich, Oded; Lindell, Yehuda 9 2006 Protocols for bounded-concurrent secure two-party computation in the plain model. Zbl 1176.94068 Lindell, Yehuda 1 2006 Universally composable password-based key exchange. Zbl 1137.94367 Canetti, Ran; Halevi, Shai; Katz, Jonathan; Lindell, Yehuda; MacKenzie, Phil 61 2005 Secure multi-party computation without agreement. Zbl 1102.68472 Goldwasser, Shafi; Lindell, Yehuda 42 2005 Secure computation without authentication. Zbl 1145.94457 Barak, Boaz; Canetti, Ran; Lindell, Yehuda; Pass, Rafael; Rabin, Tal 22 2005 Concurrent general composition of secure protocols in the timing model. Zbl 1192.94121 Kalai, Yael Tauman; Lindell, Yehuda; Prabhakaran, Manoj 9 2005 Handling expected polynomial-time strategies in simulation-based security proofs. Zbl 1079.94555 Katz, Jonathan; Lindell, Yehuda 5 2005 Lower bounds for concurrent self composition. Zbl 1176.94069 Lindell, Yehuda 26 2004 Strict polynomial-time in simulation and extraction. Zbl 1060.94014 Barak, Boaz; Lindell, Yehuda 12 2004 A framework for password-based authenticated key exchange. Zbl 1038.94534 Gennaro, Rosario; Lindell, Yehuda 53 2003 Parallel coin-tossing and constant-round secure two-party computation. Zbl 1027.94011 Lindell, Yehuda 37 2003 On the limitations of universally composable two-party computation without set-up assumptions. Zbl 1038.94523 Canetti, Ran; Kushilevitz, Eyal; Lindell, Yehuda 29 2003 Bounded-concurrent secure two-party computation without setup assumptions. Zbl 1192.94123 Lindell, Yehuda 27 2003 Composition of secure multi-party protocols. A comprehensive study. Zbl 1041.68036 Lindell, Yehuda 20 2003 A simpler construction of CCA2-secure public-key encryption under general assumptions. Zbl 1037.68535 Lindell, Yehuda 20 2003 Universally composable two-party and multi-party secure computation. Zbl 1192.94112 Canetti, Ran; Lindell, Yehuda; Ostrovsky, Rafail; Sahai, Amit 174 2002 Privacy preserving data mining. Zbl 1010.94008 Lindell, Yehuda; Pinkas, Benny 35 2002 Strict polynomial-time in simulation and extraction. Zbl 1192.68343 Barak, Boaz; Lindell, Yehuda 17 2002 ...and 6 more Documents all cited Publications top 5 cited Publications all top 5 Cited by 1,782 Authors 46 Hazay, Carmit 41 Lindell, Yehuda 33 Ishai, Yuval 32 Ostrovsky, Rafail 28 Venkitasubramaniam, Muthuramakrishnan 27 Katz, Jonathan N. 26 Cohen, Ran 25 Goyal, Vipul 25 Omri, Eran 21 Canetti, Ran 21 Damgård, Ivan Bjerre 21 Garg, Sanjam 19 Patra, Arpita 18 Kolesnikov, Vladimir 18 Pass, Rafael 18 Sahai, Amit 17 Haitner, Iftach 17 Smart, Nigel Paul 16 Asharov, Gilad 16 Nielsen, Jesper Buus 16 Scholl, Peter 15 Jain, Abhishek 15 Orlandi, Claudio 15 Srinivasan, Akshayaram 14 Garay, Juan A. 14 Zikas, Vassilis 13 Couteau, Geoffroy 13 Ravi, Divya 13 Tanaka, Keisuke 13 Visconti, Ivan 12 Applebaum, Benny 12 Chevalier, Céline 12 David, Bernardo Machado 12 Orsini, Emmanuela 12 Pinkas, Benny 12 Pointcheval, David 12 Polychroniadou, Antigoni 12 Venturi, Daniele 12 Zhou, Hong-Sheng 11 Alon, Bar 11 Bitansky, Nir 11 Boyle, Elette 11 Goel, Aarushi 11 Khurana, Dakshita 11 Liu-Zhang, Chen-Da 11 Malavolta, Giulio 11 Müller-Quade, Jörn 11 Rosen, Alon 11 Yanai, Avishay 10 Baum, Carsten 10 Ciampi, Michele 10 Hofheinz, Dennis 10 Jarecki, Stanisław 10 Komargodski, Ilan 10 Kushilevitz, Eyal 10 Loss, Julian 10 Moran, Tal 10 Rosulek, Mike 10 Segev, Gil 10 Wang, Xiao 10 Wichs, Daniel 10 Xu, Jiayu 9 Blazy, Olivier 9 Döttling, Nico 9 Halevi, Shai 9 Kiayias, Aggelos 9 Lipmaa, Helger 9 Maurer, Ueli M. 9 Mohassel, Payman 9 Patranabis, Sikhar 9 Shelat, Abhi 8 Abdalla, Michel 8 Attema, Thomas 8 Baghery, Karim 8 Escudero, Daniel E. 8 Gu, Dawu 8 Heath, David G. 8 Kondi, Yashvanth 8 Malkin, Tal G. 8 Naor, Moni 8 Pandey, Omkant 8 Prabhakaran, Manoj M. 8 Shi, Elaine 8 Siniscalchi, Luisa 8 Song, Yifan 8 Vaikuntanathan, Vinod 7 Abe, Masayuki 7 Badrinarayanan, Saikrishna 7 Benhamouda, Fabrice 7 Catalano, Dario 7 Chung, Kai-Min 7 Dachman-Soled, Dana 7 D’Arco, Paolo 7 Dodis, Yevgeniy 7 Dowsley, Rafael 7 Fuchsbauer, Georg 7 Guo, Fuchun 7 Kitagawa, Fuyuki 7 Klooß, Michael 7 Lin, Huijia ...and 1,682 more Authors all top 5 Cited in 79 Serials 127 Journal of Cryptology 35 Theoretical Computer Science 27 Information Sciences 21 Designs, Codes and Cryptography 18 SIAM Journal on Computing 14 Quantum Information Processing 6 Distributed Computing 6 Advances in Mathematics of Communications 5 Journal of Computer and System Sciences 5 Information and Computation 4 Theory of Computing Systems 4 Science in China. Series F 4 Journal of Mathematical Cryptology 4 Science China. Information Sciences 4 Prikladnaya Diskretnaya Matematika 3 Information Processing Letters 3 Computing 3 Algorithmica 3 International Journal of Foundations of Computer Science 3 Soft Computing 3 Matematicheskie Voprosy Kriptografii 2 Artificial Intelligence 2 Automatica 2 Applicable Algebra in Engineering, Communication and Computing 2 Cybernetics and Systems Analysis 2 Formal Methods in System Design 2 Data Mining and Knowledge Discovery 2 Journal of Discrete Mathematical Sciences & Cryptography 2 International Journal of Applied Mathematics and Computer Science 2 Sādhanā 2 Mediterranean Journal of Mathematics 2 Mathematical Biosciences and Engineering 2 Mathematics in Computer Science 2 Statistical Analysis and Data Mining 1 Discrete Applied Mathematics 1 International Journal of Theoretical Physics 1 International Statistical Review 1 Systems & Control Letters 1 Combinatorica 1 Journal of Automated Reasoning 1 Mathematical and Computer Modelling 1 SIAM Journal on Discrete Mathematics 1 Machine Learning 1 Mathematical Structures in Computer Science 1 Discrete Event Dynamic Systems 1 European Journal of Operational Research 1 International Journal of Computer Mathematics 1 Computational Statistics and Data Analysis 1 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering 1 Rad Hrvatske Akademije Znanosti i Umjetnosti. Matematičke Znanosti 1 Finite Fields and their Applications 1 The Journal of Artificial Intelligence Research (JAIR) 1 Monte Carlo Methods and Applications 1 Annals of Mathematics and Artificial Intelligence 1 Mathematical Problems in Engineering 1 Nonlinear Dynamics 1 Wuhan University Journal of Natural Sciences (WUJNS) 1 The Journal of Logic and Algebraic Programming 1 International Journal of Wavelets, Multiresolution and Information Processing 1 International Journal of Quantum Information 1 Online Journal of Analytic Combinatorics 1 Optimization Letters 1 Computational & Mathematical Methods in Medicine 1 Journal of Physics A: Mathematical and Theoretical 1 Logical Methods in Computer Science 1 The Annals of Applied Statistics 1 Foundations and Trends in Networking 1 Advances and Applications in Discrete Mathematics 1 Cryptography and Communications 1 Statistics Surveys 1 Symmetry 1 Quantitative Economics 1 Arabian Journal for Science and Engineering 1 Statistics and Computing 1 International Journal of Group Theory 1 Mathematical Foundations of Computing 1 Japanese Journal of Statistics and Data Science 1 La Matematica 1 INFOR: Information Systems and Operational Research all top 5 Cited in 25 Fields 1,136 Information and communication theory, circuits (94-XX) 546 Computer science (68-XX) 60 Quantum theory (81-XX) 39 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 17 Number theory (11-XX) 14 Statistics (62-XX) 13 Algebraic geometry (14-XX) 11 Combinatorics (05-XX) 10 Operations research, mathematical programming (90-XX) 5 Numerical analysis (65-XX) 4 Dynamical systems and ergodic theory (37-XX) 4 Biology and other natural sciences (92-XX) 3 Mathematical logic and foundations (03-XX) 3 Field theory and polynomials (12-XX) 2 Harmonic analysis on Euclidean spaces (42-XX) 2 Probability theory and stochastic processes (60-XX) 2 Systems theory; control (93-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Commutative algebra (13-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Associative rings and algebras (16-XX) 1 Category theory; homological algebra (18-XX) 1 Group theory and generalizations (20-XX) 1 Mechanics of particles and systems (70-XX) 1 Geophysics (86-XX) Citations by Year Wikidata Timeline The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.