Furukawa, Jun; Lindell, Yehuda; Nof, Ariel; Weinstein, Or High-throughput secure three-party computation with an honest majority. (English) Zbl 07707563 J. Cryptology 36, No. 3, Paper No. 21, 68 p. (2023). MSC: 68P25 68M14 94A60 94A62 PDFBibTeX XMLCite \textit{J. Furukawa} et al., J. Cryptology 36, No. 3, Paper No. 21, 68 p. (2023; Zbl 07707563) Full Text: DOI
Chida, Koji; Hamada, Koki; Ikarashi, Dai; Kikuchi, Ryo; Genkin, Daniel; Lindell, Yehuda; Nof, Ariel Fast large-scale honest-majority MPC for malicious adversaries. (English) Zbl 1517.94080 J. Cryptology 36, No. 3, Paper No. 15, 50 p. (2023). MSC: 94A60 94A62 PDFBibTeX XMLCite \textit{K. Chida} et al., J. Cryptology 36, No. 3, Paper No. 15, 50 p. (2023; Zbl 1517.94080) Full Text: DOI
Beimel, Amos; Lindell, Yehuda; Omri, Eran; Orlov, Ilan \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds. (English) Zbl 1453.94131 J. Cryptology 33, No. 4, 1659-1731 (2020). MSC: 94A62 PDFBibTeX XMLCite \textit{A. Beimel} et al., J. Cryptology 33, No. 4, 1659--1731 (2020; Zbl 1453.94131) Full Text: DOI
Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P.; Yanai, Avishay Efficient constant-round multi-party computation combining BMR and SPDZ. (English) Zbl 1466.94033 J. Cryptology 32, No. 3, 1026-1069 (2019). MSC: 94A60 PDFBibTeX XMLCite \textit{Y. Lindell} et al., J. Cryptology 32, No. 3, 1026--1069 (2019; Zbl 1466.94033) Full Text: DOI Link
Lindell, Yehuda How to simulate it – a tutorial on the simulation proof technique. (English) Zbl 1481.94111 Lindell, Yehuda (ed.), Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich. Cham: Springer. Inf. Secur. Cryptogr., 277-346 (2017). MSC: 94A60 PDFBibTeX XMLCite \textit{Y. Lindell}, in: Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich. Cham: Springer. 277--346 (2017; Zbl 1481.94111) Full Text: DOI
Cohen, Ran; Lindell, Yehuda Fairness versus guaranteed output delivery in secure multiparty computation. (English) Zbl 1386.94067 J. Cryptology 30, No. 4, 1157-1186 (2017). MSC: 94A60 PDFBibTeX XMLCite \textit{R. Cohen} and \textit{Y. Lindell}, J. Cryptology 30, No. 4, 1157--1186 (2017; Zbl 1386.94067) Full Text: DOI
Furukawa, Jun; Lindell, Yehuda; Nof, Ariel; Weinstein, Or High-throughput secure three-party computation for malicious adversaries and an honest majority. (English) Zbl 1415.94431 Coron, Jean-Sébastien (ed.) et al., Advances in cryptology – EUROCRYPT 2017. 36th annual international conference on the theory and applications of cryptographic techniques, Paris, France, April 30 – May 4, 2017. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 10211, 225-255 (2017). MSC: 94A60 PDFBibTeX XMLCite \textit{J. Furukawa} et al., Lect. Notes Comput. Sci. 10211, 225--255 (2017; Zbl 1415.94431) Full Text: DOI
Asharov, Gilad; Lindell, Yehuda A full proof of the BGW protocol for perfectly secure multiparty computation. (English) Zbl 1370.94480 J. Cryptology 30, No. 1, 58-151 (2017). MSC: 94A60 68P25 PDFBibTeX XMLCite \textit{G. Asharov} and \textit{Y. Lindell}, J. Cryptology 30, No. 1, 58--151 (2017; Zbl 1370.94480) Full Text: DOI
Lindell, Yehuda; Smart, Nigel P.; Soria-Vazquez, Eduardo More efficient constant-round multi-party computation from BMR and SHE. (English) Zbl 1406.94071 Hirt, Martin (ed.) et al., Theory of cryptography. 14th international conference, TCC 2016-B, Beijing, China, October 31 – November 3, 2016. Proceedings. Part I. Berlin: Springer (ISBN 978-3-662-53640-7/pbk; 978-3-662-53641-4/ebook). Lecture Notes in Computer Science 9985, 554-581 (2016). MSC: 94A60 PDFBibTeX XMLCite \textit{Y. Lindell} et al., Lect. Notes Comput. Sci. 9985, 554--581 (2016; Zbl 1406.94071) Full Text: DOI Link
Lindell, Yehuda Fast cut-and-choose-based protocols for malicious and covert adversaries. (English) Zbl 1355.94068 J. Cryptology 29, No. 2, 456-490 (2016). MSC: 94A60 PDFBibTeX XMLCite \textit{Y. Lindell}, J. Cryptology 29, No. 2, 456--490 (2016; Zbl 1355.94068) Full Text: DOI
Lindell, Yehuda; Pinkas, Benny An efficient protocol for secure two-party computation in the presence of malicious adversaries. (English) Zbl 1314.94086 J. Cryptology 28, No. 2, 312-350 (2015). MSC: 94A60 PDFBibTeX XMLCite \textit{Y. Lindell} and \textit{B. Pinkas}, J. Cryptology 28, No. 2, 312--350 (2015; Zbl 1314.94086) Full Text: DOI
Lindell, Yehuda A note on constant-round zero-knowledge proofs of knowledge. (English) Zbl 1283.94074 J. Cryptology 26, No. 4, 638-654 (2013). MSC: 94A60 68Q15 PDFBibTeX XMLCite \textit{Y. Lindell}, J. Cryptology 26, No. 4, 638--654 (2013; Zbl 1283.94074) Full Text: DOI
Lindell, Yehuda; Pinkas, Benny Secure two-party computation via cut-and-choose oblivious transfer. (English) Zbl 1278.94056 J. Cryptology 25, No. 4, 680-722 (2012). MSC: 94A60 68M12 68P25 94A62 PDFBibTeX XMLCite \textit{Y. Lindell} and \textit{B. Pinkas}, J. Cryptology 25, No. 4, 680--722 (2012; Zbl 1278.94056) Full Text: DOI
Kidron, Dafna; Lindell, Yehuda Impossibility results for universal composability in public-key models and with fixed inputs. (English) Zbl 1258.94039 J. Cryptology 24, No. 3, 517-544 (2011). MSC: 94A60 94A62 PDFBibTeX XMLCite \textit{D. Kidron} and \textit{Y. Lindell}, J. Cryptology 24, No. 3, 517--544 (2011; Zbl 1258.94039) Full Text: DOI Link
Barak, Boaz; Canetti, Ran; Lindell, Yehuda; Pass, Rafael; Rabin, Tal Secure computation without authentication. (English) Zbl 1243.94024 J. Cryptology 24, No. 4, 720-760 (2011). MSC: 94A60 68M12 94A62 PDFBibTeX XMLCite \textit{B. Barak} et al., J. Cryptology 24, No. 4, 720--760 (2011; Zbl 1243.94024) Full Text: DOI
Hazay, Carmit; Lindell, Yehuda Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. (English) Zbl 1195.94058 J. Cryptology 23, No. 3, 422-456 (2010). MSC: 94A60 94A62 PDFBibTeX XMLCite \textit{C. Hazay} and \textit{Y. Lindell}, J. Cryptology 23, No. 3, 422--456 (2010; Zbl 1195.94058) Full Text: DOI
Aumann, Yonatan; Lindell, Yehuda Security against covert adversaries: Efficient protocols for realistic adversaries. (English) Zbl 1181.94091 J. Cryptology 23, No. 2, 281-343 (2010). MSC: 94A60 94A62 PDFBibTeX XMLCite \textit{Y. Aumann} and \textit{Y. Lindell}, J. Cryptology 23, No. 2, 281--343 (2010; Zbl 1181.94091) Full Text: DOI
Lindell, Yehuda General composition and universal composability in secure multiparty computation. (English) Zbl 1184.94243 J. Cryptology 22, No. 3, 395-428 (2009). Reviewer: Boaz Tsaban (Ramat-Gan) MSC: 94A60 94A62 PDFBibTeX XMLCite \textit{Y. Lindell}, J. Cryptology 22, No. 3, 395--428 (2009; Zbl 1184.94243) Full Text: DOI
Lindell, Yehuda; Pinkas, Benny A proof of security of Yao’s protocol for two-party computation. (English) Zbl 1159.94364 J. Cryptology 22, No. 2, 161-188 (2009). MSC: 94A60 94A62 PDFBibTeX XMLCite \textit{Y. Lindell} and \textit{B. Pinkas}, J. Cryptology 22, No. 2, 161--188 (2009; Zbl 1159.94364) Full Text: DOI
Katz, Jonathan; Lindell, Yehuda Handling expected polynomial-time strategies in simulation-based security proofs. (English) Zbl 1161.94410 J. Cryptology 21, No. 3, 303-349 (2008). MSC: 94A60 PDFBibTeX XMLCite \textit{J. Katz} and \textit{Y. Lindell}, J. Cryptology 21, No. 3, 303--349 (2008; Zbl 1161.94410) Full Text: DOI Link
Lindell, Yehuda Lower bounds and impossibility results for concurrent self composition. (English) Zbl 1143.94012 J. Cryptology 21, No. 2, 200-249 (2008). Reviewer: Jaak Henno (Tallinn) MSC: 94A60 94A62 PDFBibTeX XMLCite \textit{Y. Lindell}, J. Cryptology 21, No. 2, 200--249 (2008; Zbl 1143.94012) Full Text: DOI
Hazay, Carmit; Lindell, Yehuda Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. (English) Zbl 1162.94367 Canetti, Ran (ed.), Theory of cryptography. Fifth theory of cryptography conference, TCC 2008, New York, USA, March 19–21, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78524-8/pbk). Lecture Notes in Computer Science 4948, 155-175 (2008). MSC: 94A60 PDFBibTeX XMLCite \textit{C. Hazay} and \textit{Y. Lindell}, Lect. Notes Comput. Sci. 4948, 155--175 (2008; Zbl 1162.94367) Full Text: DOI
Barak, Boaz; Lindell, Yehuda; Vadhan, Salil Lower bounds for non-black-box zero knowledge. (English) Zbl 1094.68024 J. Comput. Syst. Sci. 72, No. 2, 321-391 (2006). MSC: 68P25 68Q17 94A60 PDFBibTeX XMLCite \textit{B. Barak} et al., J. Comput. Syst. Sci. 72, No. 2, 321--391 (2006; Zbl 1094.68024) Full Text: DOI