×
Compute Distance To:
Author ID: lindell.yehuda Recent zbMATH articles by "Lindell, Yehuda"
Published as: Lindell, Yehuda
External Links: MGP

Publications by Year

Citations contained in zbMATH Open

96 Publications have been cited 1,194 times in 622 Documents Cited by Year
Universally composable two-party and multi-party secure computation. Zbl 1192.94112
Canetti, Ran; Lindell, Yehuda; Ostrovsky, Rafail; Sahai, Amit
104
2002
A proof of security of Yao’s protocol for two-party computation. Zbl 1159.94364
Lindell, Yehuda; Pinkas, Benny
63
2009
An efficient protocol for secure two-party computation in the presence of malicious adversaries. Zbl 1141.94362
Lindell, Yehuda; Pinkas, Benny
42
2007
Introduction to modern cryptography. Zbl 1143.94001
Katz, Jonathan; Lindell, Yehuda
41
2008
Efficient secure two-party protocols. Techniques and constructions. Zbl 1208.68005
Hazay, Carmit; Lindell, Yehuda
33
2010
A framework for password-based authenticated key exchange. Zbl 1038.94534
Gennaro, Rosario; Lindell, Yehuda
31
2003
Introduction to modern cryptography. 2nd ed. Zbl 1323.94001
Katz, Jonathan; Lindell, Yehuda
29
2015
Privacy preserving data mining. Zbl 1010.94008
Lindell, Yehuda; Pinkas, Benny
28
2002
Secure multi-party computation without agreement. Zbl 1102.68472
Goldwasser, Shafi; Lindell, Yehuda
26
2005
Privacy preserving data mining. Zbl 0989.68506
Lindell, Yehuda; Pinkas, Benny
24
2000
Secure two-party computation via cut-and-choose oblivious transfer. Zbl 1281.94037
Lindell, Yehuda; Pinkas, Benny
23
2011
Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Zbl 1162.94367
Hazay, Carmit; Lindell, Yehuda
22
2008
Universally composable password-based key exchange. Zbl 1137.94367
Canetti, Ran; Halevi, Shai; Katz, Jonathan; Lindell, Yehuda; MacKenzie, Phil
22
2005
Parallel coin-tossing and constant-round secure two-party computation. Zbl 1027.94011
Lindell, Yehuda
21
2003
Fast cut-and-choose based protocols for malicious and covert adversaries. Zbl 1316.94082
Lindell, Yehuda
21
2013
Efficient constant round multi-party computation combining BMR and SPDZ. Zbl 1352.94049
Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P.; Yanai, Avishay
21
2015
Lower bounds for non-black-box zero knowledge. Zbl 1094.68024
Barak, Boaz; Lindell, Yehuda; Vadhan, Salil
20
2006
Complete fairness in secure two-party computation. Zbl 1231.94062
Gordon, S. Dov; Carmit, Hazay; Katz, Jonathan; Lindell, Yehuda
19
2008
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
18
2018
Highly-efficient universally-composable commitments based on the DDH assumption. Zbl 1291.68037
Lindell, Yehuda
16
2011
High-throughput secure three-party computation for malicious adversaries and an honest majority. Zbl 1415.94431
Furukawa, Jun; Lindell, Yehuda; Nof, Ariel; Weinstein, Or
15
2017
On the limitations of universally composable two-party computation without set-up assumptions. Zbl 1038.94523
Canetti, Ran; Kushilevitz, Eyal; Lindell, Yehuda
15
2003
Bounded-concurrent secure two-party computation without setup assumptions. Zbl 1192.94123
Lindell, Yehuda
15
2003
Lower bounds for concurrent self composition. Zbl 1176.94069
Lindell, Yehuda
15
2004
A simpler variant of universally composable security for standard multiparty computation. Zbl 1351.94031
Canetti, Ran; Cohen, Asaf; Lindell, Yehuda
15
2015
More efficient oblivious transfer extensions with security for malicious adversaries. Zbl 1370.94481
Asharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael
15
2015
Security against covert adversaries: efficient protocols for realistic adversaries. Zbl 1129.94010
Aumann, Yonatan; Lindell, Yehuda
15
2007
On the black-box complexity of optimally-fair coin tossing. Zbl 1295.94044
Dachman-Soled, Dana; Lindell, Yehuda; Mahmoody, Mohammad; Malkin, Tal
15
2011
Secure computation on the web: computing without simultaneous interaction. Zbl 1287.94070
Halevi, Shai; Lindell, Yehuda; Pinkas, Benny
15
2011
Security against covert adversaries: Efficient protocols for realistic adversaries. Zbl 1181.94091
Aumann, Yonatan; Lindell, Yehuda
15
2010
On the limitations of universally composable two-party computation without set-up assumptions. Zbl 1101.68549
Canetti, Ran; Kushilevitz, Eyal; Lindell, Yehuda
14
2006
Black-box constructions for secure computation. Zbl 1301.94116
Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez
13
2006
A simpler construction of CCA2-secure public-key encryption under general assumptions. Zbl 1037.68535
Lindell, Yehuda
13
2003
Fast garbling of circuits under standard assumptions. Zbl 1400.94146
Gueron, Shay; Lindell, Yehuda; Nof, Ariel; Pinkas, Benny
13
2018
Secure computation without authentication. Zbl 1145.94457
Barak, Boaz; Canetti, Ran; Lindell, Yehuda; Pass, Rafael; Rabin, Tal
13
2005
A full proof of the BGW protocol for perfectly secure multiparty computation. Zbl 1370.94480
Asharov, Gilad; Lindell, Yehuda
13
2017
Fairness versus guaranteed output delivery in secure multiparty computation. Zbl 1317.94099
Cohen, Ran; Lindell, Yehuda
12
2014
Fast secure two-party ECDSA signing. Zbl 1410.94091
Lindell, Yehuda
12
2017
The IPS compiler: optimizations, variants and concrete efficiency. Zbl 1288.68023
Lindell, Yehuda; Oxman, Eli; Pinkas, Benny
12
2011
Cut-and-choose yao-based secure computation in the online/offline and batch settings. Zbl 1335.94067
Lindell, Yehuda; Riva, Ben
11
2014
Parallel coin-tossing and constant-round secure two-party computation. Zbl 1002.94521
Lindell, Yehuda
11
2001
Black-box constructions of protocols for secure computation. Zbl 1236.94056
Haitner, Iftach; Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez
11
2011
Session-key generation using human passwords only. Zbl 1003.94527
Goldreich, Oded; Lindell, Yehuda
10
2001
Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Zbl 1195.94058
Hazay, Carmit; Lindell, Yehuda
10
2010
Secure two-party computation via cut-and-choose oblivious transfer. Zbl 1278.94056
Lindell, Yehuda; Pinkas, Benny
10
2012
\(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
10
2011
Sequential composition of protocols without simultaneous termination. Zbl 1292.68023
Lindell, Yehuda; Lysyanskaya, Anna; Rabin, Tal
9
2002
Implementing two-party computation efficiently with security against malicious adversaries. Zbl 1180.68152
Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P.
9
2008
An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle. Zbl 1354.94038
Lindell, Yehuda
9
2015
Information-theoretically secure protocols and security under composition. Zbl 1301.94119
Kushilevitz, Eyal; Lindell, Yehuda; Rabin, Tal
8
2006
Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. Zbl 1251.94034
Lindell, Yehuda; Zarosim, Hila
8
2011
Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24–26, 2014. Proceedings. Zbl 1280.94007
8
2014
Utility dependence in correct and fair rational secret sharing. Zbl 1209.94034
Asharov, Gilad; Lindell, Yehuda
7
2011
Strict polynomial-time in simulation and extraction. Zbl 1060.94014
Barak, Boaz; Lindell, Yehuda
7
2004
Concurrent composition of secure protocols in the timing model. Zbl 1130.68049
Kalai, Yael Tauman; Lindell, Yehuda; Prabhakaran, Manoj
7
2007
Concurrently-secure blind signatures without random oracles or setup assumptions. Zbl 1129.94044
Hazay, Carmit; Katz, Jonathan; Koo, Chiu-Yuen; Lindell, Yehuda
7
2007
Complete fairness in secure two-party computation. Zbl 1281.94081
Gordon, S. Dov; Hazay, Carmit; Katz, Jonathan; Lindell, Yehuda
7
2011
Secure computation without agreement. Zbl 1029.68511
Goldwasser, Shafi; Lindell, Yehuda
6
2002
A simpler construction of CCA2-secure public-key encryption under general assumptions. Zbl 1103.68528
Lindell, Yehuda
6
2006
Session-key generation using human passwords only. Zbl 1103.68513
Goldreich, Oded; Lindell, Yehuda
6
2006
Strict polynomial-time in simulation and extraction. Zbl 1192.68343
Barak, Boaz; Lindell, Yehuda
6
2002
More efficient constant-round multi-party computation from BMR and SHE. Zbl 1406.94071
Lindell, Yehuda; Smart, Nigel P.; Soria-Vazquez, Eduardo
6
2016
Information-theoretically secure protocols and security under composition. Zbl 1202.94185
Kushilevitz, Eyal; Lindell, Yehuda; Rabin, Tal
5
2010
On the composition of authenticated byzantine agreement. Zbl 1192.68084
Lindell, Yehuda; Lysyanskaya, Anna; Rabin, Tal
5
2002
On combining privacy with guaranteed output delivery in secure multiparty computation. Zbl 1161.94444
Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez
5
2006
Hiding the input-size in secure two-party computation. Zbl 1326.94110
Lindell, Yehuda; Nissim, Kobbi; Orlandi, Claudio
5
2013
Lower bounds and impossibility results for concurrent self composition. Zbl 1143.94012
Lindell, Yehuda
5
2008
Utility dependence in correct and fair rational secret sharing. Zbl 1252.94105
Asharov, Gilad; Lindell, Yehuda
5
2009
A full characterization of functions that imply fair coin tossing and ramifications to fairness. Zbl 1315.94051
Asharov, Gilad; Lindell, Yehuda; Rabin, Tal
5
2013
More efficient oblivious transfer extensions. Zbl 1377.94030
Asharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael
5
2017
Fairness versus guaranteed output delivery in secure multiparty computation. Zbl 1386.94067
Cohen, Ran; Lindell, Yehuda
4
2017
Fast distributed RSA key generation for semi-honest and malicious adversaries. Zbl 1436.94061
Frederiksen, Tore Kasper; Lindell, Yehuda; Osheter, Valery; Pinkas, Benny
4
2018
Efficient scalable constant-round MPC via garbled circuits. Zbl 1417.94042
Ben-Efraim, Aner; Lindell, Yehuda; Omri, Eran
4
2017
Concurrent general composition of secure protocols in the timing model. Zbl 1192.94121
Kalai, Yael Tauman; Lindell, Yehuda; Prabhakaran, Manoj
4
2005
On the composition of authenticated Byzantine agreement. Zbl 1326.68041
Lindell, Yehuda; Lysyanskaya, Anna; Rabin, Tal
4
2006
Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. Zbl 1213.68249
Lindell, Yehuda; Zarosim, Hila
4
2009
A note on constant-round zero-knowledge proofs of knowledge. Zbl 1283.94074
Lindell, Yehuda
4
2013
On the feasibility of extending oblivious transfer. Zbl 1315.94086
Lindell, Yehuda; Zarosim, Hila
4
2013
General composition and universal composability in secure multiparty computation. Zbl 1184.94243
Lindell, Yehuda
4
2009
How to simulate it – a tutorial on the simulation proof technique. Zbl 1481.94111
Lindell, Yehuda
4
2017
Composition of secure multi-party protocols. A comprehensive study. Zbl 1041.68036
Lindell, Yehuda
3
2003
Fast cut-and-choose-based protocols for malicious and covert adversaries. Zbl 1355.94068
Lindell, Yehuda
3
2016
Handling expected polynomial-time strategies in simulation-based security proofs. Zbl 1079.94555
Katz, Jonathan; Lindell, Yehuda
3
2005
An efficient protocol for secure two-party computation in the presence of malicious adversaries. Zbl 1314.94086
Lindell, Yehuda; Pinkas, Benny
3
2015
Impossibility results for universal composability in public-key models and with fixed inputs. Zbl 1258.94039
Kidron, Dafna; Lindell, Yehuda
3
2011
Collusion-free multiparty computation in the mediated model. Zbl 1252.94042
Alwen, Joël; Katz, Jonathan; Lindell, Yehuda; Persiano, Giuseppe; Shelat, Abhi; Visconti, Ivan
3
2009
Efficient fully-simulatable oblivious transfer. Zbl 1286.68020
Lindell, Yehuda
2
2008
Secure computation without authentication. Zbl 1243.94024
Barak, Boaz; Canetti, Ran; Lindell, Yehuda; Pass, Rafael; Rabin, Tal
2
2011
Introduction to modern cryptography. 3rd edition. Zbl 1479.94002
Katz, Jonathan; Lindell, Yehuda
2
2021
Secure two-party computation with fairness – a necessary design principle. Zbl 1410.94092
Lindell, Yehuda; Rabin, Tal
2
2017
On achieving the “best of both worlds” in secure multiparty computation. Zbl 1215.68035
Ishai, Yuval; Katz, Jonathan; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez
2
2011
Perfectly-secure multiplication for any \(t < n/3\). Zbl 1287.94045
Asharov, Gilad; Lindell, Yehuda; Rabin, Tal
2
2011
Completeness for symmetric two-party functionalities – revisited. Zbl 1292.94102
Lindell, Yehuda; Omri, Eran; Zarosim, Hila
2
2012
Handling expected polynomial-time strategies in simulation-based security proofs. Zbl 1161.94410
Katz, Jonathan; Lindell, Yehuda
2
2008
Adaptively secure computation with partial erasures. Zbl 1333.94038
Hazay, Carmit; Lindell, Yehuda; Patra, Arpita
1
2015
Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich. Zbl 1411.94003
1
2017
Introduction to modern cryptography. 3rd edition. Zbl 1479.94002
Katz, Jonathan; Lindell, Yehuda
2
2021
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
18
2018
Fast garbling of circuits under standard assumptions. Zbl 1400.94146
Gueron, Shay; Lindell, Yehuda; Nof, Ariel; Pinkas, Benny
13
2018
Fast distributed RSA key generation for semi-honest and malicious adversaries. Zbl 1436.94061
Frederiksen, Tore Kasper; Lindell, Yehuda; Osheter, Valery; Pinkas, Benny
4
2018
High-throughput secure three-party computation for malicious adversaries and an honest majority. Zbl 1415.94431
Furukawa, Jun; Lindell, Yehuda; Nof, Ariel; Weinstein, Or
15
2017
A full proof of the BGW protocol for perfectly secure multiparty computation. Zbl 1370.94480
Asharov, Gilad; Lindell, Yehuda
13
2017
Fast secure two-party ECDSA signing. Zbl 1410.94091
Lindell, Yehuda
12
2017
More efficient oblivious transfer extensions. Zbl 1377.94030
Asharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael
5
2017
Fairness versus guaranteed output delivery in secure multiparty computation. Zbl 1386.94067
Cohen, Ran; Lindell, Yehuda
4
2017
Efficient scalable constant-round MPC via garbled circuits. Zbl 1417.94042
Ben-Efraim, Aner; Lindell, Yehuda; Omri, Eran
4
2017
How to simulate it – a tutorial on the simulation proof technique. Zbl 1481.94111
Lindell, Yehuda
4
2017
Secure two-party computation with fairness – a necessary design principle. Zbl 1410.94092
Lindell, Yehuda; Rabin, Tal
2
2017
Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich. Zbl 1411.94003
1
2017
More efficient constant-round multi-party computation from BMR and SHE. Zbl 1406.94071
Lindell, Yehuda; Smart, Nigel P.; Soria-Vazquez, Eduardo
6
2016
Fast cut-and-choose-based protocols for malicious and covert adversaries. Zbl 1355.94068
Lindell, Yehuda
3
2016
Introduction to modern cryptography. 2nd ed. Zbl 1323.94001
Katz, Jonathan; Lindell, Yehuda
29
2015
Efficient constant round multi-party computation combining BMR and SPDZ. Zbl 1352.94049
Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P.; Yanai, Avishay
21
2015
A simpler variant of universally composable security for standard multiparty computation. Zbl 1351.94031
Canetti, Ran; Cohen, Asaf; Lindell, Yehuda
15
2015
More efficient oblivious transfer extensions with security for malicious adversaries. Zbl 1370.94481
Asharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael
15
2015
An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle. Zbl 1354.94038
Lindell, Yehuda
9
2015
An efficient protocol for secure two-party computation in the presence of malicious adversaries. Zbl 1314.94086
Lindell, Yehuda; Pinkas, Benny
3
2015
Adaptively secure computation with partial erasures. Zbl 1333.94038
Hazay, Carmit; Lindell, Yehuda; Patra, Arpita
1
2015
Fairness versus guaranteed output delivery in secure multiparty computation. Zbl 1317.94099
Cohen, Ran; Lindell, Yehuda
12
2014
Cut-and-choose yao-based secure computation in the online/offline and batch settings. Zbl 1335.94067
Lindell, Yehuda; Riva, Ben
11
2014
Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24–26, 2014. Proceedings. Zbl 1280.94007
8
2014
Fast cut-and-choose based protocols for malicious and covert adversaries. Zbl 1316.94082
Lindell, Yehuda
21
2013
Hiding the input-size in secure two-party computation. Zbl 1326.94110
Lindell, Yehuda; Nissim, Kobbi; Orlandi, Claudio
5
2013
A full characterization of functions that imply fair coin tossing and ramifications to fairness. Zbl 1315.94051
Asharov, Gilad; Lindell, Yehuda; Rabin, Tal
5
2013
A note on constant-round zero-knowledge proofs of knowledge. Zbl 1283.94074
Lindell, Yehuda
4
2013
On the feasibility of extending oblivious transfer. Zbl 1315.94086
Lindell, Yehuda; Zarosim, Hila
4
2013
Secure two-party computation via cut-and-choose oblivious transfer. Zbl 1278.94056
Lindell, Yehuda; Pinkas, Benny
10
2012
Completeness for symmetric two-party functionalities – revisited. Zbl 1292.94102
Lindell, Yehuda; Omri, Eran; Zarosim, Hila
2
2012
Secure two-party computation via cut-and-choose oblivious transfer. Zbl 1281.94037
Lindell, Yehuda; Pinkas, Benny
23
2011
Highly-efficient universally-composable commitments based on the DDH assumption. Zbl 1291.68037
Lindell, Yehuda
16
2011
On the black-box complexity of optimally-fair coin tossing. Zbl 1295.94044
Dachman-Soled, Dana; Lindell, Yehuda; Mahmoody, Mohammad; Malkin, Tal
15
2011
Secure computation on the web: computing without simultaneous interaction. Zbl 1287.94070
Halevi, Shai; Lindell, Yehuda; Pinkas, Benny
15
2011
The IPS compiler: optimizations, variants and concrete efficiency. Zbl 1288.68023
Lindell, Yehuda; Oxman, Eli; Pinkas, Benny
12
2011
Black-box constructions of protocols for secure computation. Zbl 1236.94056
Haitner, Iftach; Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez
11
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
10
2011
Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. Zbl 1251.94034
Lindell, Yehuda; Zarosim, Hila
8
2011
Utility dependence in correct and fair rational secret sharing. Zbl 1209.94034
Asharov, Gilad; Lindell, Yehuda
7
2011
Complete fairness in secure two-party computation. Zbl 1281.94081
Gordon, S. Dov; Hazay, Carmit; Katz, Jonathan; Lindell, Yehuda
7
2011
Impossibility results for universal composability in public-key models and with fixed inputs. Zbl 1258.94039
Kidron, Dafna; Lindell, Yehuda
3
2011
Secure computation without authentication. Zbl 1243.94024
Barak, Boaz; Canetti, Ran; Lindell, Yehuda; Pass, Rafael; Rabin, Tal
2
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
2
2011
Perfectly-secure multiplication for any \(t < n/3\). Zbl 1287.94045
Asharov, Gilad; Lindell, Yehuda; Rabin, Tal
2
2011
Efficient secure two-party protocols. Techniques and constructions. Zbl 1208.68005
Hazay, Carmit; Lindell, Yehuda
33
2010
Security against covert adversaries: Efficient protocols for realistic adversaries. Zbl 1181.94091
Aumann, Yonatan; Lindell, Yehuda
15
2010
Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Zbl 1195.94058
Hazay, Carmit; Lindell, Yehuda
10
2010
Information-theoretically secure protocols and security under composition. Zbl 1202.94185
Kushilevitz, Eyal; Lindell, Yehuda; Rabin, Tal
5
2010
A proof of security of Yao’s protocol for two-party computation. Zbl 1159.94364
Lindell, Yehuda; Pinkas, Benny
63
2009
Utility dependence in correct and fair rational secret sharing. Zbl 1252.94105
Asharov, Gilad; Lindell, Yehuda
5
2009
Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. Zbl 1213.68249
Lindell, Yehuda; Zarosim, Hila
4
2009
General composition and universal composability in secure multiparty computation. Zbl 1184.94243
Lindell, Yehuda
4
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
3
2009
Introduction to modern cryptography. Zbl 1143.94001
Katz, Jonathan; Lindell, Yehuda
41
2008
Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Zbl 1162.94367
Hazay, Carmit; Lindell, Yehuda
22
2008
Complete fairness in secure two-party computation. Zbl 1231.94062
Gordon, S. Dov; Carmit, Hazay; Katz, Jonathan; Lindell, Yehuda
19
2008
Implementing two-party computation efficiently with security against malicious adversaries. Zbl 1180.68152
Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P.
9
2008
Lower bounds and impossibility results for concurrent self composition. Zbl 1143.94012
Lindell, Yehuda
5
2008
Efficient fully-simulatable oblivious transfer. Zbl 1286.68020
Lindell, Yehuda
2
2008
Handling expected polynomial-time strategies in simulation-based security proofs. Zbl 1161.94410
Katz, Jonathan; Lindell, Yehuda
2
2008
An efficient protocol for secure two-party computation in the presence of malicious adversaries. Zbl 1141.94362
Lindell, Yehuda; Pinkas, Benny
42
2007
Security against covert adversaries: efficient protocols for realistic adversaries. Zbl 1129.94010
Aumann, Yonatan; Lindell, Yehuda
15
2007
Concurrent composition of secure protocols in the timing model. Zbl 1130.68049
Kalai, Yael Tauman; Lindell, Yehuda; Prabhakaran, Manoj
7
2007
Concurrently-secure blind signatures without random oracles or setup assumptions. Zbl 1129.94044
Hazay, Carmit; Katz, Jonathan; Koo, Chiu-Yuen; Lindell, Yehuda
7
2007
Lower bounds for non-black-box zero knowledge. Zbl 1094.68024
Barak, Boaz; Lindell, Yehuda; Vadhan, Salil
20
2006
On the limitations of universally composable two-party computation without set-up assumptions. Zbl 1101.68549
Canetti, Ran; Kushilevitz, Eyal; Lindell, Yehuda
14
2006
Black-box constructions for secure computation. Zbl 1301.94116
Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez
13
2006
Information-theoretically secure protocols and security under composition. Zbl 1301.94119
Kushilevitz, Eyal; Lindell, Yehuda; Rabin, Tal
8
2006
A simpler construction of CCA2-secure public-key encryption under general assumptions. Zbl 1103.68528
Lindell, Yehuda
6
2006
Session-key generation using human passwords only. Zbl 1103.68513
Goldreich, Oded; Lindell, Yehuda
6
2006
On combining privacy with guaranteed output delivery in secure multiparty computation. Zbl 1161.94444
Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez
5
2006
On the composition of authenticated Byzantine agreement. Zbl 1326.68041
Lindell, Yehuda; Lysyanskaya, Anna; Rabin, Tal
4
2006
Secure multi-party computation without agreement. Zbl 1102.68472
Goldwasser, Shafi; Lindell, Yehuda
26
2005
Universally composable password-based key exchange. Zbl 1137.94367
Canetti, Ran; Halevi, Shai; Katz, Jonathan; Lindell, Yehuda; MacKenzie, Phil
22
2005
Secure computation without authentication. Zbl 1145.94457
Barak, Boaz; Canetti, Ran; Lindell, Yehuda; Pass, Rafael; Rabin, Tal
13
2005
Concurrent general composition of secure protocols in the timing model. Zbl 1192.94121
Kalai, Yael Tauman; Lindell, Yehuda; Prabhakaran, Manoj
4
2005
Handling expected polynomial-time strategies in simulation-based security proofs. Zbl 1079.94555
Katz, Jonathan; Lindell, Yehuda
3
2005
Lower bounds for concurrent self composition. Zbl 1176.94069
Lindell, Yehuda
15
2004
Strict polynomial-time in simulation and extraction. Zbl 1060.94014
Barak, Boaz; Lindell, Yehuda
7
2004
A framework for password-based authenticated key exchange. Zbl 1038.94534
Gennaro, Rosario; Lindell, Yehuda
31
2003
Parallel coin-tossing and constant-round secure two-party computation. Zbl 1027.94011
Lindell, Yehuda
21
2003
On the limitations of universally composable two-party computation without set-up assumptions. Zbl 1038.94523
Canetti, Ran; Kushilevitz, Eyal; Lindell, Yehuda
15
2003
Bounded-concurrent secure two-party computation without setup assumptions. Zbl 1192.94123
Lindell, Yehuda
15
2003
A simpler construction of CCA2-secure public-key encryption under general assumptions. Zbl 1037.68535
Lindell, Yehuda
13
2003
Composition of secure multi-party protocols. A comprehensive study. Zbl 1041.68036
Lindell, Yehuda
3
2003
Universally composable two-party and multi-party secure computation. Zbl 1192.94112
Canetti, Ran; Lindell, Yehuda; Ostrovsky, Rafail; Sahai, Amit
104
2002
Privacy preserving data mining. Zbl 1010.94008
Lindell, Yehuda; Pinkas, Benny
28
2002
Sequential composition of protocols without simultaneous termination. Zbl 1292.68023
Lindell, Yehuda; Lysyanskaya, Anna; Rabin, Tal
9
2002
Secure computation without agreement. Zbl 1029.68511
Goldwasser, Shafi; Lindell, Yehuda
6
2002
Strict polynomial-time in simulation and extraction. Zbl 1192.68343
Barak, Boaz; Lindell, Yehuda
6
2002
On the composition of authenticated byzantine agreement. Zbl 1192.68084
Lindell, Yehuda; Lysyanskaya, Anna; Rabin, Tal
5
2002
Parallel coin-tossing and constant-round secure two-party computation. Zbl 1002.94521
Lindell, Yehuda
11
2001
Session-key generation using human passwords only. Zbl 1003.94527
Goldreich, Oded; Lindell, Yehuda
10
2001
Privacy preserving data mining. Zbl 0989.68506
Lindell, Yehuda; Pinkas, Benny
24
2000
all top 5

Cited by 1,074 Authors

29 Hazay, Carmit
26 Lindell, Yehuda
19 Ostrovsky, Rafail
18 Venkitasubramaniam, Muthuramakrishnan
17 Katz, Jonathan N.
13 Damgård, Ivan Bjerre
13 Haitner, Iftach
13 Omri, Eran
12 Canetti, Ran
12 Cohen, Ran
12 Ishai, Yuval
11 Goyal, Vipul
10 Pinkas, Benny
9 Asharov, Gilad
9 Chevalier, Céline
9 Garg, Sanjam
9 Nielsen, Jesper Buus
9 Smart, Nigel P.
9 Zikas, Vassilis
8 Garay, Juan A.
8 Hofheinz, Dennis
8 Mohassel, Payman
8 Orlandi, Claudio
8 Orsini, Emmanuela
8 Pass, Rafael
8 Polychroniadou, Antigoni
8 Scholl, Peter
8 Venturi, Daniele
7 Blazy, Olivier
7 Mu, Yi
7 Pointcheval, David
7 Rosulek, Mike
7 Sahai, Amit
7 Yanai, Avishay
6 Coretti, Sandro
6 Fuchsbauer, Georg
6 Guo, Fuchun
6 Kolesnikov, Vladimir
6 Müller-Quade, Jörn
6 Schröder, Dominique
6 Segev, Gil
6 Srinivasan, Akshayaram
6 Vaikuntanathan, Vinod
6 Wichs, Daniel
6 Zhou, Hong-Sheng
5 Applebaum, Benny
5 Baum, Carsten
5 Benhamouda, Fabrice
5 Bitansky, Nir
5 Catalano, Dario
5 Chen, Rongmao
5 Chung, Kai-Min
5 Ciampi, Michele
5 Döttling, Nico
5 Feng, Dengguo
5 Halevi, Shai
5 Khurana, Dakshita
5 Moran, Tal
5 Pandey, Omkant
5 Soria-Vazquez, Eduardo
5 Susilo, Willy
5 Tanaka, Keisuke
5 Unruh, Dominique
5 Vergnaud, Damien
5 Visconti, Ivan
4 Abe, Masayuki
4 Camenisch, Jan L.
4 Choi, Seung Geol
4 D’Arco, Paolo
4 David, Bernardo Machado
4 Dodis, Yevgeniy
4 Fischlin, Marc
4 Ganesh, Chaya
4 Gordon, S. Dov
4 Groth, Jens
4 Jain, Abhishek
4 Kondi, Yashvanth
4 Kushilevitz, Eyal
4 Magri, Bernardo
4 Makriyannis, Nikolaos
4 Maurer, Ueli M.
4 Naor, Moni
4 Nuida, Koji
4 Ravi, Divya
4 Rosen, Alon
4 Saia, Jared
4 Shelat, Abhi
4 Siniscalchi, Luisa
4 Toft, Tomas
4 Vadhan, Salil P.
4 Wee, Hoeteck
4 Yang, Guomin
4 Zarosim, Hila
3 Abdalla, Michel
3 Ananth, Prabhanjan Vijendra
3 Backes, Michael
3 Baghery, Karim
3 Barak, Boaz
3 Beimel, Amos
3 Brakerski, Zvika
...and 974 more Authors
all top 5

Cited in 68 Serials

106 Journal of Cryptology
28 Theoretical Computer Science
22 Information Sciences
17 SIAM Journal on Computing
11 Designs, Codes and Cryptography
10 Quantum Information Processing
6 Distributed Computing
5 Information and Computation
5 Advances in Mathematics of Communications
4 Journal of Computer and System Sciences
4 Theory of Computing Systems
4 Science in China. Series F
4 Science China. Information Sciences
3 Information Processing Letters
3 Computing
3 Algorithmica
3 International Journal of Foundations of Computer Science
3 Soft Computing
3 Mathematical Biosciences and Engineering
2 Automatica
2 Applicable Algebra in Engineering, Communication and Computing
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 Journal of Mathematical Cryptology
2 Matematicheskie Voprosy Kriptografii
1 Artificial Intelligence
1 Discrete Applied Mathematics
1 International Journal of Theoretical Physics
1 Systems & Control Letters
1 Combinatorica
1 Journal of Automated Reasoning
1 Mathematical and Computer Modelling
1 SIAM Journal on Discrete Mathematics
1 MSCS. 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 Cybernetics and Systems Analysis
1 Rad Hrvatske Akademije Znanosti i Umjetnosti. Matematičke Znanosti
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
1 International Journal of Wavelets, Multiresolution and Information Processing
1 International Journal of Quantum Information
1 Mediterranean Journal of Mathematics
1 Online Journal of Analytic Combinatorics
1 Mathematics in Computer Science
1 Optimization Letters
1 Computational & Mathematical Methods in Medicine
1 Journal of Physics A: Mathematical and Theoretical
1 Statistical Analysis and Data Mining
1 The Annals of Applied Statistics
1 Cryptography and Communications
1 Statistics Surveys
1 Arabian Journal for Science and Engineering
1 Statistics and Computing
1 International Journal of Group Theory
1 Journal of Siberian Federal University. Mathematics & Physics
1 Mathematical Foundations of Computing
1 Japanese Journal of Statistics and Data Science
1 Prikladnaya Diskretnaya Matematika

Citations by Year