×

zbMATH — the first resource for mathematics

Lindell, Yehuda

Compute Distance To:
Author ID: lindell.yehuda Recent zbMATH articles by "Lindell, Yehuda"
Published as: Lindell, Yehuda
External Links: MGP
Documents Indexed: 105 Publications since 2000, including 7 Books

Publications by Year

Citations contained in zbMATH Open

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

Cited by 739 Authors

24 Lindell, Yehuda
22 Hazay, Carmit
15 Katz, Jonathan N.
12 Venkitasubramaniam, Muthuramakrishnan
11 Ostrovsky, Rafail
9 Canetti, Ran
8 Damgård, Ivan Bjerre
8 Haitner, Iftach
8 Omri, Eran
8 Pinkas, Benny
7 Cohen, Ran
7 Garay, Juan A.
7 Mu, Yi
7 Nielsen, Jesper Buus
6 Fuchsbauer, Georg
6 Guo, Fuchun
6 Hofheinz, Dennis
6 Ishai, Yuval
6 Pass, Rafael
6 Pointcheval, David
6 Venturi, Daniele
6 Zikas, Vassilis
5 Asharov, Gilad
5 Chen, Rongmao
5 Chevalier, Céline
5 Coretti, Sandro
5 Garg, Sanjam
5 Mohassel, Payman
5 Müller-Quade, Jörn
5 Sahai, Amit
5 Susilo, Willy
5 Visconti, Ivan
4 Applebaum, Benny
4 Baum, Carsten
4 Camenisch, Jan L.
4 D’Arco, Paolo
4 Feng, Dengguo
4 Fischlin, Marc
4 Ganesh, Chaya
4 Goyal, Vipul
4 Groth, Jens
4 Moran, Tal
4 Orlandi, Claudio
4 Polychroniadou, Antigoni
4 Saia, Jared
4 Scholl, Peter
4 Schröder, Dominique
4 Segev, Gil
4 Smart, Nigel P.
4 Tanaka, Keisuke
4 Toft, Tomas
4 Unruh, Dominique
4 Wichs, Daniel
4 Yang, Guomin
4 Zarosim, Hila
4 Zhou, Hong-Sheng
3 Abdalla, Michel
3 Abe, Masayuki
3 Barak, Boaz
3 Benhamouda, Fabrice
3 Bitansky, Nir
3 Choi, Seung Geol
3 Dachman-Soled, Dana
3 David, Bernardo Machado
3 Deng, Yi
3 Dodis, Yevgeniy
3 Döttling, Nico
3 Fujisaki, Eiichiro
3 Goldreich, Oded
3 Halevi, Shai
3 Kiltz, Eike
3 Kolesnikov, Vladimir
3 Koo, Chiu-Yuen
3 Kumaresan, Ranjit
3 Li, Bao
3 Li, Hongda
3 Li, Jin
3 Li, Shundong
3 Malkin, Tal G.
3 Maurer, Ueli M.
3 Movahedi, Mahnush
3 Naor, Moni
3 Naya-Plasencia, María
3 Nissim, Kobbi
3 Orsini, Emmanuela
3 Pandey, Omkant
3 Patra, Arpita
3 Peng, Changgen
3 Rosulek, Mike
3 Scafuro, Alessandra
3 Schneider, Thomas
3 Shi, Runhua
3 Vadhan, Salil P.
3 Vaikuntanathan, Vinod
3 Yanai, Avishay
3 Zhao, Minghao
3 Zhao, Yunlei
3 Zhong, Sheng
3 Zhu, Huafei
2 Akavia, Adi
...and 639 more Authors
all top 5

Cited in 56 Serials

93 Journal of Cryptology
23 Theoretical Computer Science
22 Information Sciences
11 SIAM Journal on Computing
9 Designs, Codes and Cryptography
6 Distributed Computing
6 Quantum Information Processing
5 Advances in Mathematics of Communications
4 Journal of Computer and System Sciences
4 Information and Computation
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
2 Applicable Algebra in Engineering, Communication and Computing
2 Formal Methods in System Design
2 Data Mining and Knowledge Discovery
2 International Journal of Applied Mathematics and Computer Science
2 Sādhanā
2 Journal of Mathematical Cryptology
1 Discrete Applied Mathematics
1 Automatica
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 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 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 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 Japanese Journal of Statistics and Data Science
1 Prikladnaya Diskretnaya Matematika

Citations by Year