Hazay, Carmit; Lindell, Yehuda; Patra, Arpita Adaptively secure computation with partial erasures. (English) Zbl 1333.94038 Proceedings of the 2015 ACM symposium on principles of distributed computing, PODC ’15, Donostia-San Sebastián, Spain, July 21–23, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3617-8). 291-300 (2015). MSC: 94A60 68M14 68P25 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P.; Yanai, Avishay Efficient constant round multi-party computation combining BMR and SPDZ. (English) Zbl 1352.94049 Gennaro, Rosario (ed.) et al., Advances in cryptology – CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16–20, 2015. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-47999-5/pbk; 978-3-662-48000-7/ebook). Lecture Notes in Computer Science 9216, 319-338 (2015). MSC: 94A60 68P25 68M12 × Cite Format Result Cite Review PDF Full Text: DOI Link
Canetti, Ran; Cohen, Asaf; Lindell, Yehuda A simpler variant of universally composable security for standard multiparty computation. (English) Zbl 1351.94031 Gennaro, Rosario (ed.) et al., Advances in cryptology – CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16–20, 2015. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-47999-5/pbk; 978-3-662-48000-7/ebook). Lecture Notes in Computer Science 9216, 3-22 (2015). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Asharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael More efficient oblivious transfer extensions with security for malicious adversaries. (English) Zbl 1370.94481 Oswald, Elisabeth (ed.) et al., Advances in cryptology – EUROCRYPT 2015. 34th annual international conference on the theory and applications of cryptographic techniques, Sofia, Bulgaria, April 26–30, 2015. Proceedings. Part I. Berlin: Springer (ISBN 978-3-662-46799-2/pbk; 978-3-662-46800-5/ebook). Lecture Notes in Computer Science 9056, 673-701 (2015). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI Link
Lindell, Yehuda An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle. (English) Zbl 1354.94038 Dodis, Yevgeniy (ed.) et al., Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23–25, 2015. Proceedings, Part I. Heidelberg: Springer (ISBN 978-3-662-46493-9/pbk). Lecture Notes in Computer Science 9014, 93-109 (2015). MSC: 94A60 × Cite Format Result Cite Review PDF 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 × Cite Format Result Cite Review PDF Full Text: DOI
Katz, Jonathan; Lindell, Yehuda Introduction to modern cryptography. 2nd ed. (English) Zbl 1323.94001 Chapman & Hall/CRC Cryptography and Network Security. Boca Raton, FL: CRC Press (ISBN 978-1-4665-7026-9/hbk; 978-1-4665-7028-3/ebook). xx, 583 p. (2015). Reviewer: Fabian Müller (Berlin) MSC: 94-01 94A60 94A62 11T71 94A55 × Cite Format Result Cite Review PDF
Cohen, Ran; Lindell, Yehuda Fairness versus guaranteed output delivery in secure multiparty computation. (English) Zbl 1317.94099 Sarkar, Palash (ed.) et al., Advances in cryptology – ASIACRYPT 2014. 20th international conference on the theory and application of cryptology and information security, Kaoshiung, Taiwan, R.O.C., December 7–11, 2014, Proceedings, Part II. Berlin: Springer (ISBN 978-3-662-45607-1/pbk). Lecture Notes in Computer Science 8874, 466-485 (2014). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda; Riva, Ben Cut-and-choose yao-based secure computation in the online/offline and batch settings. (English) Zbl 1335.94067 Garay, Juan A. (ed.) et al., Advances in cryptology – CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17–21, 2014. Proceedings, Part II. Berlin: Springer (ISBN 978-3-662-44380-4/pbk). Lecture Notes in Computer Science 8617, 476-494 (2014). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda (ed.) Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24–26, 2014. Proceedings. (English) Zbl 1280.94007 Lecture Notes in Computer Science 8349. Berlin: Springer (ISBN 978-3-642-54241-1/pbk). xvi, 739 p. (2014). MSC: 94-06 94A60 00B25 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda; Nissim, Kobbi; Orlandi, Claudio Hiding the input-size in secure two-party computation. (English) Zbl 1326.94110 Sako, Kazue (ed.) et al., Advances in cryptology – ASIACRYPT 2013. 19th international conference on the theory and application of cryptology and information security, Bengaluru, India, December 1–5, 2013. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-42044-3/pbk). Lecture Notes in Computer Science 8270, 421-440 (2013). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Asharov, Gilad; Lindell, Yehuda; Zarosim, Hila Fair and efficient secure multiparty computation with reputation systems. (English) Zbl 1314.94052 Sako, Kazue (ed.) et al., Advances in cryptology – ASIACRYPT 2013. 19th international conference on the theory and application of cryptology and information security, Bengaluru, India, December 1–5, 2013. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-42044-3/pbk). Lecture Notes in Computer Science 8270, 201-220 (2013). MSC: 94A60 68P25 × Cite Format Result Cite Review PDF 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 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda Fast cut-and-choose based protocols for malicious and covert adversaries. (English) Zbl 1316.94082 Canetti, Ran (ed.) et al., Advances in cryptology – CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18–22, 2013. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-40083-4/pbk). Lecture Notes in Computer Science 8043, 1-17 (2013). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda Techniques for efficient secure computation based on Yao’s protocol. (Abstract). (English) Zbl 1314.94085 Kurosawa, Kaoru (ed.) et al., Public-key cryptography – PKC 2013. 16th international conference on practice and theory in public-key cryptography, Nara, Japan, February 26–March 1, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36361-0/pbk). Lecture Notes in Computer Science 7778, 253 (2013). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda; Zarosim, Hila On the feasibility of extending oblivious transfer. (English) Zbl 1315.94086 Sahai, Amit (ed.), Theory of cryptography. 10th theory of cryptography conference, TCC 2013, Tokyo, Japan, March 3–6, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36593-5/pbk). Lecture Notes in Computer Science 7785, 519-538 (2013). MSC: 94A60 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI
Asharov, Gilad; Lindell, Yehuda; Rabin, Tal A full characterization of functions that imply fair coin tossing and ramifications to fairness. (English) Zbl 1315.94051 Sahai, Amit (ed.), Theory of cryptography. 10th theory of cryptography conference, TCC 2013, Tokyo, Japan, March 3–6, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36593-5/pbk). Lecture Notes in Computer Science 7785, 243-262 (2013). MSC: 94A60 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda; Omri, Eran; Zarosim, Hila Completeness for symmetric two-party functionalities – revisited. (English) Zbl 1292.94102 Wang, Xiaoyun (ed.) et al., Advances in cryptology – ASIACRYPT 2012. 18th international conference on the theory and application of cryptology and information security, Beijing, China, December 2–6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-34960-7/pbk). Lecture Notes in Computer Science 7658, 116-133 (2012). MSC: 94A60 × Cite Format Result Cite Review PDF 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 × Cite Format Result Cite Review PDF Full Text: DOI
Gordon, S. Dov; Hazay, Carmit; Katz, Jonathan; Lindell, Yehuda Complete fairness in secure two-party computation. (English) Zbl 1281.94081 J. ACM 58, No. 6, Article No. 24, 37 p. (2011). MSC: 94A62 68M12 68P25 × Cite Format Result Cite Review PDF 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 × Cite Format Result Cite Review PDF 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 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda; Zarosim, Hila Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. (English) Zbl 1251.94034 J. Cryptology 24, No. 4, 761-799 (2011). MSC: 94A60 68Q15 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Beimel, Amos; Lindell, Yehuda; Omri, Eran; Orlov, Ilan \(1/p\)-secure multiparty computation without honest majority and the best of both worlds. (English) Zbl 1287.94051 Rogaway, Phillip (ed.), Advances in cryptology – CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22791-2/pbk). Lecture Notes in Computer Science 6841, 277-296 (2011). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Lindell, Yehuda; Oxman, Eli; Pinkas, Benny The IPS compiler: optimizations, variants and concrete efficiency. (English) Zbl 1288.68023 Rogaway, Phillip (ed.), Advances in cryptology – CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22791-2/pbk). Lecture Notes in Computer Science 6841, 259-276 (2011). MSC: 68M12 68M14 68N20 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Asharov, Gilad; Lindell, Yehuda; Rabin, Tal Perfectly-secure multiplication for any \(t < n/3\). (English) Zbl 1287.94045 Rogaway, Phillip (ed.), Advances in cryptology – CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22791-2/pbk). Lecture Notes in Computer Science 6841, 240-258 (2011). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Halevi, Shai; Lindell, Yehuda; Pinkas, Benny Secure computation on the web: computing without simultaneous interaction. (English) Zbl 1287.94070 Rogaway, Phillip (ed.), Advances in cryptology – CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22791-2/pbk). Lecture Notes in Computer Science 6841, 132-150 (2011). MSC: 94A60 94B25 94C10 94C15 × Cite Format Result Cite Review PDF Full Text: DOI
Haitner, Iftach; Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez Black-box constructions of protocols for secure computation. (English) Zbl 1236.94056 SIAM J. Comput. 40, No. 2, 225-266 (2011). MSC: 94A60 68P25 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda Highly-efficient universally-composable commitments based on the DDH assumption. (English) Zbl 1291.68037 Paterson, Kenneth G. (ed.), Advances in cryptology – EUROCRYPT 2011. 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15–19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20464-7/pbk). Lecture Notes in Computer Science 6632, 446-466 (2011). MSC: 68M12 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Dachman-Soled, Dana; Lindell, Yehuda; Mahmoody, Mohammad; Malkin, Tal On the black-box complexity of optimally-fair coin tossing. (English) Zbl 1295.94044 Ishai, Yuval (ed.), Theory of cryptography. 8th theory of cryptography conference, TCC 2011, Providence, RI, USA, March 28–30, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19570-9/pbk). Lecture Notes in Computer Science 6597, 450-467 (2011). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda; Pinkas, Benny Secure two-party computation via cut-and-choose oblivious transfer. (English) Zbl 1281.94037 Ishai, Yuval (ed.), Theory of cryptography. 8th theory of cryptography conference, TCC 2011, Providence, RI, USA, March 28–30, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19570-9/pbk). Lecture Notes in Computer Science 6597, 329-346 (2011). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Ishai, Yuval; Katz, Jonathan; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez On achieving the “best of both worlds” in secure multiparty computation. (English) Zbl 1215.68035 SIAM J. Comput. 40, No. 1, 122-141 (2011). MSC: 68M12 94A60 × Cite Format Result Cite Review PDF Full Text: DOI Link
Asharov, Gilad; Lindell, Yehuda Utility dependence in correct and fair rational secret sharing. (English) Zbl 1209.94034 J. Cryptology 24, No. 1, 157-202 (2011). MSC: 94A60 94A62 × Cite Format Result Cite Review PDF Full Text: DOI Link
Kushilevitz, Eyal; Lindell, Yehuda; Rabin, Tal Information-theoretically secure protocols and security under composition. (English) Zbl 1202.94185 SIAM J. Comput. 39, No. 5, 2090-2112 (2010). Reviewer: Tiit Riismaa (Tallinn) MSC: 94A60 68Q17 68Q25 × Cite Format Result Cite Review PDF 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 × Cite Format Result Cite Review PDF 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 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda Legally enforceable fairness in secure two-party communication. (English) Zbl 1286.68012 Chic. J. Theor. Comput. Sci. 2009, Article No. 1, 17 p. (2009). MSC: 68M10 68M12 94A60 68M15 × Cite Format Result Cite Review PDF Full Text: DOI
Asharov, Gilad; Lindell, Yehuda Utility dependence in correct and fair rational secret sharing. (English) Zbl 1252.94105 Halevi, Shai (ed.), Advances in cryptology – CRYPTO 2009. 29th annual international cryptology conference, Santa Barbara, CA, USA, August 16–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03355-1/pbk). Lecture Notes in Computer Science 5677, 559-576 (2009). MSC: 94A62 91A80 91A30 68M12 × Cite Format Result Cite Review PDF Full Text: DOI
Alwen, Joël; Katz, Jonathan; Lindell, Yehuda; Persiano, Giuseppe; Shelat, Abhi; Visconti, Ivan Collusion-free multiparty computation in the mediated model. (English) Zbl 1252.94042 Halevi, Shai (ed.), Advances in cryptology – CRYPTO 2009. 29th annual international cryptology conference, Santa Barbara, CA, USA, August 16–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03355-1/pbk). Lecture Notes in Computer Science 5677, 524-540 (2009). MSC: 94A60 × Cite Format Result Cite Review PDF 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 × Cite Format Result Cite Review PDF 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 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda; Zarosim, Hila Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. (English) Zbl 1213.68249 Reingold, Omer (ed.), Theory of cryptography. 6th theory of cryptography conference, TCC 2009, San Francisco, CA, USA, March 15–17, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00456-8/pbk). Lecture Notes in Computer Science 5444, 183-201 (2009). MSC: 68P25 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda Efficient fully-simulatable oblivious transfer. (English) Zbl 1286.68020 Chic. J. Theor. Comput. Sci. 2008, Article No. 6, 20 p. (2008). MSC: 68M12 94A60 68P25 × Cite Format Result Cite Review PDF 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 × Cite Format Result Cite Review PDF Full Text: DOI Link
Gordon, S. Dov; Carmit, Hazay; Katz, Jonathan; Lindell, Yehuda Complete fairness in secure two-party computation. (English) Zbl 1231.94062 STOC’08. Proceedings of the 40th annual ACM symposium on theory of computing 2008, Victoria, Canada, May 17–20, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-047-0). 413-422 (2008). MSC: 94A60 68M12 68P25 × Cite Format Result Cite Review PDF
Lindell, Yehuda; Pinkas, Benny; Smart, Nigel P. Implementing two-party computation efficiently with security against malicious adversaries. (English) Zbl 1180.68152 Ostrovsky, Rafail (ed.) et al., Security and cryptography for networks. 6th international conference, SCN 2008, Amalfi, Italy, September 10–12, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85854-6/pbk). Lecture Notes in Computer Science 5229, 2-20 (2008). MSC: 68P25 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
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 × Cite Format Result Cite Review PDF 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 × Cite Format Result Cite Review PDF Full Text: DOI
Katz, Jonathan; Lindell, Yehuda Introduction to modern cryptography. (English) Zbl 1143.94001 Chapman & Hall/CRC Cryptography and Network Security. Boca Raton, FL: Chapman & Hall/CRC (ISBN 978-1-58488-551-1/hbk). xviii, 534 p. (2008). Reviewer: Guillermo Morales-Luna (Mexico) MSC: 94-01 94A60 94A62 11T71 94A55 × Cite Format Result Cite Review PDF
Lindell, Yehuda; Pinkas, Benny An efficient protocol for secure two-party computation in the presence of malicious adversaries. (English) Zbl 1141.94362 Naor, Moni (ed.), Advances in cryptology – EUROCRYPT 2007. 26th annual international conference on the theory and applications of cryptographic techniques, Barcelona, Spain, May 20–24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72539-8/pbk). Lecture Notes in Computer Science 4515, 52-78 (2007). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Hazay, Carmit; Katz, Jonathan; Koo, Chiu-Yuen; Lindell, Yehuda Concurrently-secure blind signatures without random oracles or setup assumptions. (English) Zbl 1129.94044 Vadhan, Salil P. (ed.), Theory of cryptography. 4th theory of cryptography conference, TCC 2007, Amsterdam, The Netherlands, February 21–24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-70935-0/pbk). Lecture Notes in Computer Science 4392, 323-341 (2007). MSC: 94A62 × Cite Format Result Cite Review PDF Full Text: DOI
Aumann, Yonatan; Lindell, Yehuda Security against covert adversaries: efficient protocols for realistic adversaries. (English) Zbl 1129.94010 Vadhan, Salil P. (ed.), Theory of cryptography. 4th theory of cryptography conference, TCC 2007, Amsterdam, The Netherlands, February 21–24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-70935-0/pbk). Lecture Notes in Computer Science 4392, 137-156 (2007). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda; Lysyanskaya, Anna; Rabin, Tal On the composition of authenticated Byzantine agreement. (English) Zbl 1326.68041 J. ACM 53, No. 6, 881-917 (2006). MSC: 68M12 68M14 94A62 × Cite Format Result Cite Review PDF Full Text: DOI
Kushilevitz, Eyal; Lindell, Yehuda; Rabin, Tal Information-theoretically secure protocols and security under composition. (English) Zbl 1301.94119 Kleinberg, Jon M. (ed.), Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21–23, 2006. New York, NY: ACM Press (ISBN 1-59593-134-1). 109-118 (2006). MSC: 94A60 68P25 68Q17 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI Link
Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez Black-box constructions for secure computation. (English) Zbl 1301.94116 Kleinberg, Jon M. (ed.), Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21–23, 2006. New York, NY: ACM Press (ISBN 1-59593-134-1). 99-108 (2006). MSC: 94A60 68P25 68Q17 94A62 × Cite Format Result Cite Review PDF Full Text: DOI
Ishai, Yuval; Kushilevitz, Eyal; Lindell, Yehuda; Petrank, Erez On combining privacy with guaranteed output delivery in secure multiparty computation. (English) Zbl 1161.94444 Dwork, Cynthia (ed.), Advances in cryptology – CRYPTO 2006. 26th annual international cryptology conference, Santa Barbara, California, USA, August 20–24, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37432-9/pbk). Lecture Notes in Computer Science 4117, 483-500 (2006). MSC: 94A62 68M14 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda Protocols for bounded-concurrent secure two-party computation in the plain model. (English) Zbl 1176.94068 Chic. J. Theor. Comput. Sci. 2006, Article No. 1, 50 p. (2006). MSC: 94A62 68M12 68P25 × Cite Format Result Cite Review PDF Full Text: DOI Link
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 × Cite Format Result Cite Review PDF Full Text: DOI
Kalai, Yael Tauman; Lindell, Yehuda; Prabhakaran, Manoj Concurrent general composition of secure protocols in the timing model. (English) Zbl 1192.94121 STOC’05: Proceedings of the 37th annual ACM symposium on theory of computing, Baltimore, MD, USA, May 22–24, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-960-8). 644-653 (2005). MSC: 94A62 68M12 × Cite Format Result Cite Review PDF Full Text: DOI
Canetti, Ran; Halevi, Shai; Katz, Jonathan; Lindell, Yehuda; MacKenzie, Phil Universally composable password-based key exchange. (English) Zbl 1137.94367 Cramer, Ronald (ed.), Advances in cryptology – EUROCRYPT 2005. 24th annual international conference on the theory and applications of cryptographic techniques, Aarhus, Denmark, May 22–26, 2005. Proceedings. Berlin: Springer (ISBN 3-540-25910-4/pbk). Lecture Notes in Computer Science 3494, 404-421 (2005). MSC: 94A62 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Barak, Boaz; Canetti, Ran; Lindell, Yehuda; Pass, Rafael; Rabin, Tal Secure computation without authentication. (English) Zbl 1145.94457 Shoup, Victor (ed.), Advances in cryptology – CRYPTO 2005. 25th annual international cryptology conference, Santa Barbara, CA, USA, August 14–18, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28114-2/pbk). Lecture Notes in Computer Science 3621, 361-377 (2005). MSC: 94A62 × Cite Format Result Cite Review PDF Full Text: DOI
Goldwasser, Shafi; Lindell, Yehuda Secure multi-party computation without agreement. (English) Zbl 1102.68472 J. Cryptology 18, No. 3, 247-287 (2005). MSC: 68P25 68M10 68M12 94A62 × Cite Format Result Cite Review PDF Full Text: DOI
Katz, Jonathan; Lindell, Yehuda Handling expected polynomial-time strategies in simulation-based security proofs. (English) Zbl 1079.94555 Kilian, Joe (ed.), Theory of cryptography. Second theory of cryptography conference, TCC 2005, Cambridge, MA, USA, February 10–12, 2005. Proceedings. Berlin: Springer (ISBN 3-540-24573-1/pbk). Lecture Notes in Computer Science 3378, 128-149 (2005). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda Lower bounds for concurrent self composition. (English) Zbl 1176.94069 Naor, Moni (ed.), Theory of cryptography. First theory of cryptography conference, TCC 2004, Cambridge, MA, USA, February 19–21, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21000-8/pbk). Lecture Notes in Computer Science 2951, 203-222 (2004). MSC: 94A62 68M12 × Cite Format Result Cite Review PDF Full Text: DOI
Barak, Boaz; Lindell, Yehuda Strict polynomial-time in simulation and extraction. (English) Zbl 1060.94014 SIAM J. Comput. 33, No. 4, 783-818 (2004). MSC: 94A60 68Q17 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda Bounded-concurrent secure two-party computation without setup assumptions. (English) Zbl 1192.94123 Proceedings of the thirty-fifth annual ACM symposium on theory of computing (STOC 2003), San Diego, CA, USA,. New York, NY: ACM Press (ISBN 1-58113-674-9). 683-692, electronic only (2003). MSC: 94A62 68M12 × Cite Format Result Cite Review PDF Full Text: DOI
Gennaro, Rosario; Lindell, Yehuda A framework for password-based authenticated key exchange. (English) Zbl 1038.94534 Biham, Eli (ed.), Advances in cryptology – EUROCRYPT 2003. International conference on the theory and applications of cryptographic techniques, Warsaw, Poland, May 4–8, 2003. Proceedings. Berlin: Springer (ISBN 3-540-14039-5/pbk). Lect. Notes Comput. Sci. 2656, 524-543 (2003). MSC: 94A60 94A62 68P25 × Cite Format Result Cite Review PDF Full Text: Link
Lindell, Yehuda A simpler construction of CCA2-secure public-key encryption under general assumptions. (English) Zbl 1037.68535 Biham, Eli (ed.), Advances in cryptology – EUROCRYPT 2003. International conference on the theory and applications of cryptographic techniques, Warsaw, Poland, May 4–8, 2003. Proceedings. Berlin: Springer (ISBN 3-540-14039-5/pbk). Lect. Notes Comput. Sci. 2656, 241-254 (2003). MSC: 68P25 94A60 × Cite Format Result Cite Review PDF Full Text: Link
Canetti, Ran; Kushilevitz, Eyal; Lindell, Yehuda On the limitations of universally composable two-party computation without set-up assumptions. (English) Zbl 1038.94523 Biham, Eli (ed.), Advances in cryptology – EUROCRYPT 2003. International conference on the theory and applications of cryptographic techniques, Warsaw, Poland, May 4–8, 2003. Proceedings. Berlin: Springer (ISBN 3-540-14039-5/pbk). Lect. Notes Comput. Sci. 2656, 68-86 (2003). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: Link
Lindell, Yehuda Parallel coin-tossing and constant-round secure two-party computation. (English) Zbl 1027.94011 J. Cryptology 16, No. 3, 143-184 (2003). MSC: 94A60 68P25 × Cite Format Result Cite Review PDF Full Text: DOI
Canetti, Ran; Lindell, Yehuda; Ostrovsky, Rafail; Sahai, Amit Universally composable two-party and multi-party secure computation. (English) Zbl 1192.94112 Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 494-503, electronic only (2002). MSC: 94A62 68M12 × Cite Format Result Cite Review PDF Full Text: DOI
Lindell, Yehuda; Pinkas, Benny Privacy preserving data mining. (English) Zbl 1010.94008 J. Cryptology 15, No. 3, 177-206 (2002). MSC: 68P25 94A62 × Cite Format Result Cite Review PDF Full Text: DOI
Goldreich, Oded; Lindell, Yehuda Session-key generation using human passwords only. (English) Zbl 1003.94527 Kilian, Joe (ed.), Advances in cryptology - CRYPTO 2001. 21st annual international cryptology conference, Santa Barbara, CA, USA, August 19-23, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2139, 408-432 (2001). MSC: 94A60 94A62 × Cite Format Result Cite Review PDF Full Text: Link
Lindell, Yehuda Parallel coin-tossing and constant-round secure two-party computation. (English) Zbl 1002.94521 Kilian, Joe (ed.), Advances in cryptology - CRYPTO 2001. 21st annual international cryptology conference, Santa Barbara, CA, USA, August 19-23, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2139, 171-189 (2001). MSC: 94A60 × Cite Format Result Cite Review PDF Full Text: Link
Lindell, Yehuda; Pinkas, Benny Privacy preserving data mining. (English) Zbl 0989.68506 Bellare, Mihir (ed.), Advances in cryptology - CRYPTO 2000. 20th annual international conference, Santa Barbara, CA, USA, August 20-24, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1880, 36-54 (2000). MSC: 68P15 68P20 94A60 68T05 × Cite Format Result Cite Review PDF