Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYehuda Lindell
Andrew Y. Lindell
Person information
- affiliation: Bar-Ilan University, Ramat Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2014
[b4]Jonathan Katz, Yehuda Lindell:
Introduction to Modern Cryptography, Second Edition. CRC Press 2014, ISBN 9781466570269- 2010
- [b3]Carmit Hazay, Yehuda Lindell:
Efficient Secure Two-Party Protocols - Techniques and Constructions. Information Security and Cryptography, Springer 2010, ISBN 978-3-642-14302-1, pp. 3-254 - 2007
- [b2]Jonathan Katz, Yehuda Lindell:
Introduction to Modern Cryptography. Chapman and Hall/CRC Press 2007, ISBN 978-1-58488-551-1 - 2003
- [b1]Yehuda Lindell:
Composition of Secure Multi-Party Protocols, A Comprehensive Study. Lecture Notes in Computer Science 2815, Springer 2003, ISBN 3-540-20105-X
Journal Articles
- 2023
- [j49]Koji Chida, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Daniel Genkin, Yehuda Lindell, Ariel Nof:
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. J. Cryptol. 36(3): 15 (2023) - [j48]Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein:
High-Throughput Secure Three-Party Computation with an Honest Majority. J. Cryptol. 36(3): 21 (2023) - 2021
- [j47]Yehuda Lindell:
Secure multiparty computation. Commun. ACM 64(1): 86-96 (2021) - [j46]Yehuda Lindell:
Fast Secure Two-Party ECDSA Signing. J. Cryptol. 34(4): 44 (2021) - 2020
- [j45]Amos Beimel
, Yehuda Lindell, Eran Omri, Ilan Orlov:
1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds. J. Cryptol. 33(4): 1659-1731 (2020) - 2019
- [j44]Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai:
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ. J. Cryptol. 32(3): 1026-1069 (2019) - 2018
- [j43]David W. Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob Illeborg Pagter, Nigel P. Smart, Rebecca N. Wright:
From Keys to Databases - Real-World Applications of Secure Multi-Party Computation. Comput. J. 61(12): 1749-1771 (2018) - [j42]Yehuda Lindell, Eran Omri, Hila Zarosim:
Completeness for Symmetric Two-Party Functionalities: Revisited. J. Cryptol. 31(3): 671-697 (2018) - [j41]Yehuda Lindell, Hila Zarosim:
On the Feasibility of Extending Oblivious Transfer. J. Cryptol. 31(3): 737-773 (2018) - [j40]Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas:
Fast Garbling of Circuits Under Standard Assumptions. J. Cryptol. 31(3): 798-844 (2018) - [j39]Gilad Asharov, Shai Halevi, Yehuda Lindell, Tal Rabin:
Privacy-Preserving Search of Similar Patients in Genomic Data. Proc. Priv. Enhancing Technol. 2018(4): 104-124 (2018) - 2017
- [j38]Gilad Asharov, Yehuda Lindell:
A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation. J. Cryptol. 30(1): 58-151 (2017) - [j37]Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner:
More Efficient Oblivious Transfer Extensions. J. Cryptol. 30(3): 805-858 (2017) - [j36]Ran Cohen, Yehuda Lindell:
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation. J. Cryptol. 30(4): 1157-1186 (2017) - 2016
- [j35]Yehuda Lindell:
Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries. J. Cryptol. 29(2): 456-490 (2016) - 2015
- [j34]Yehuda Lindell, Benny Pinkas:
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. J. Cryptol. 28(2): 312-350 (2015) - 2013
- [j33]Yehuda Lindell:
A Note on Constant-Round Zero-Knowledge Proofs of Knowledge. J. Cryptol. 26(4): 638-654 (2013) - 2012
- [j32]Yehuda Lindell, Benny Pinkas:
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. J. Cryptol. 25(4): 680-722 (2012) - 2011
- [j31]S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell:
Complete Fairness in Secure Two-Party Computation. J. ACM 58(6): 24:1-24:37 (2011) - [j30]Gilad Asharov, Yehuda Lindell:
Utility Dependence in Correct and Fair Rational Secret Sharing. J. Cryptol. 24(1): 157-202 (2011) - [j29]Dafna Kidron, Yehuda Lindell:
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs. J. Cryptol. 24(3): 517-544 (2011) - [j28]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. J. Cryptol. 24(4): 720-760 (2011) - [j27]Yehuda Lindell, Hila Zarosim:
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. J. Cryptol. 24(4): 761-799 (2011) - [j26]Yehuda Lindell:
Anonymous Authentication. J. Priv. Confidentiality 2(2) (2011) - [j25]Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. SIAM J. Comput. 40(1): 122-141 (2011) - [j24]Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
Black-Box Constructions of Protocols for Secure Computation. SIAM J. Comput. 40(2): 225-266 (2011) - 2010
- [j23]Yonatan Aumann, Yehuda Lindell:
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. J. Cryptol. 23(2): 281-343 (2010) - [j22]Carmit Hazay, Yehuda Lindell:
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. J. Cryptol. 23(3): 422-456 (2010) - [j21]Eyal Kushilevitz, Yehuda Lindell, Tal Rabin:
Information-Theoretically Secure Protocols and Security under Composition. SIAM J. Comput. 39(5): 2090-2112 (2010) - 2009
- [j20]Yehuda Lindell:
Legally Enforceable Fairness in Secure Two-Party Communication. Chic. J. Theor. Comput. Sci. 2009 (2009) - [j19]Yehuda Lindell, Benny Pinkas:
A Proof of Security of Yao's Protocol for Two-Party Computation. J. Cryptol. 22(2): 161-188 (2009) - [j18]Yehuda Lindell:
General Composition and Universal Composability in Secure Multiparty Computation. J. Cryptol. 22(3): 395-428 (2009) - [j17]Yehuda Lindell, Benny Pinkas:
Secure Multiparty Computation for Privacy-Preserving Data Mining. J. Priv. Confidentiality 1(1) (2009) - 2008
- [j16]Yehuda Lindell:
Efficient Fully-Simulatable Oblivious Transfer. Chic. J. Theor. Comput. Sci. 2008 (2008) - [j15]Yehuda Lindell:
Lower Bounds and Impossibility Results for Concurrent Self Composition. J. Cryptol. 21(2): 200-249 (2008) - [j14]Jonathan Katz, Yehuda Lindell:
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. J. Cryptol. 21(3): 303-349 (2008) - 2007
- [j13]Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran:
Concurrent Composition of Secure Protocols in the Timing Model. J. Cryptol. 20(4): 431-492 (2007) - 2006
- [j12]Yehuda Lindell:
Protocols for Bounded-Concurrent Secure Two-Party Computation. Chic. J. Theor. Comput. Sci. 2006 (2006) - [j11]Yehuda Lindell, Anna Lysyanskaya, Tal Rabin:
On the composition of authenticated Byzantine Agreement. J. ACM 53(6): 881-917 (2006) - [j10]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower bounds for non-black-box zero knowledge. J. Comput. Syst. Sci. 72(2): 321-391 (2006) - [j9]Ran Canetti, Eyal Kushilevitz, Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. J. Cryptol. 19(2): 135-167 (2006) - [j8]Oded Goldreich, Yehuda Lindell:
Session-Key Generation Using Human Passwords Only. J. Cryptol. 19(3): 241-340 (2006) - [j7]Yehuda Lindell:
A Simpler Construction of CCA2-Secure Public-KeyEncryption under General Assumptions. J. Cryptol. 19(3): 359-377 (2006) - [j6]Rosario Gennaro, Yehuda Lindell:
A framework for password-based authenticated key exchange1. ACM Trans. Inf. Syst. Secur. 9(2): 181-234 (2006) - 2005
- [j5]Shafi Goldwasser, Yehuda Lindell:
Secure Multi-Party Computation without Agreement. J. Cryptol. 18(3): 247-287 (2005) - 2004
- [j4]Boaz Barak, Yehuda Lindell:
Strict Polynomial-Time in Simulation and Extraction. SIAM J. Comput. 33(4): 738-818 (2004) - 2003
- [j3]Yonatan Aumann, Yehuda Lindell:
A Statistical Theory for Quantitative Association Rules. J. Intell. Inf. Syst. 20(3): 255-283 (2003) - [j2]Yehuda Lindell:
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. J. Cryptol. 16(3): 143-184 (2003) - 2002
- [j1]Yehuda Lindell, Benny Pinkas:
Privacy Preserving Data Mining. J. Cryptol. 15(3): 177-206 (2002)
Conference and Workshop Papers
- 2019
- [c89]Michael Kraitsberg, Yehuda Lindell, Valery Osheter, Nigel P. Smart, Younes Talibi Alaoui:
Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme. ACISP 2019: 192-210 - [c88]Jun Furukawa, Yehuda Lindell:
Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. CCS 2019: 1557-1571 - 2018
- [c87]Assi Barak, Martin Hirt, Lior Koskas, Yehuda Lindell:
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. CCS 2018: 695-712 - [c86]Toshinori Araki, Assi Barak, Jun Furukawa, Marcel Keller, Yehuda Lindell, Kazuma Ohara, Hikaru Tsuchida:
Generalizing the SPDZ Compiler For Other Protocols. CCS 2018: 880-895 - [c85]Yehuda Lindell, Ariel Nof:
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. CCS 2018: 1837-1854 - [c84]Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof:
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. CRYPTO (3) 2018: 34-64 - [c83]Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas:
Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries. CRYPTO (2) 2018: 331-361 - [c82]Yehuda Lindell, Avishay Yanai:
Fast Garbling of Circuits over 3-Valued Logic. Public Key Cryptography (1) 2018: 620-643 - 2017
- [c81]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Efficient Scalable Constant-Round MPC via Garbled Circuits. ASIACRYPT (2) 2017: 471-498 - [c80]Yehuda Lindell, Ariel Nof:
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority. CCS 2017: 259-276 - [c79]Shay Gueron, Yehuda Lindell:
Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation. CCS 2017: 1019-1036 - [c78]Yehuda Lindell:
Fast Secure Two-Party ECDSA Signing. CRYPTO (2) 2017: 613-644 - [c77]Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein:
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. EUROCRYPT (2) 2017: 225-255 - [c76]Toshinori Araki, Assi Barak, Jun Furukawa, Tamar Lichter, Yehuda Lindell, Ariel Nof, Kazuma Ohara, Adi Watzman, Or Weinstein:
Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier. IEEE Symposium on Security and Privacy 2017: 843-862 - [c75]Yehuda Lindell, Tal Rabin:
Secure Two-Party Computation with Fairness - A Necessary Design Principle. TCC (1) 2017: 565-580 - 2016
- [c74]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Optimizing Semi-Honest Secure Multiparty Computation for the Internet. CCS 2016: 578-590 - [c73]Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara:
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. CCS 2016: 805-817 - [c72]Vladimir Kolesnikov, Hugo Krawczyk, Yehuda Lindell, Alex J. Malozemoff, Tal Rabin:
Attribute-based Key Exchange with General Policies. CCS 2016: 1451-1463 - [c71]Toshinori Araki, Assaf Barak, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara:
DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation. CCS 2016: 1841-1843 - [c70]Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez:
More Efficient Constant-Round Multi-party Computation from BMR and SHE. TCC (B1) 2016: 554-581 - 2015
- [c69]Shay Gueron, Yehuda Lindell:
GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte. CCS 2015: 109-119 - [c68]Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas:
Fast Garbling of Circuits Under Standard Assumptions. CCS 2015: 567-578 - [c67]Yehuda Lindell, Ben Riva:
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries. CCS 2015: 579-590 - [c66]Ran Canetti, Asaf Cohen, Yehuda Lindell:
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. CRYPTO (2) 2015: 3-22 - [c65]Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai:
Efficient Constant Round Multi-party Computation Combining BMR and SPDZ. CRYPTO (2) 2015: 319-338 - [c64]Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner:
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. EUROCRYPT (1) 2015: 673-701 - [c63]Carmit Hazay, Yehuda Lindell, Arpita Patra:
Adaptively Secure Computation with Partial Erasures. PODC 2015: 291-300 - [c62]Yehuda Lindell:
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle. TCC (1) 2015: 93-109 - 2014
- [c61]Ran Cohen, Yehuda Lindell:
Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation. ASIACRYPT (2) 2014: 466-485 - [c60]Yehuda Lindell, Ben Riva:
Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings. CRYPTO (2) 2014: 476-494 - 2013
- [c59]Gilad Asharov, Yehuda Lindell, Hila Zarosim:
Fair and Efficient Secure Multiparty Computation with Reputation Systems. ASIACRYPT (2) 2013: 201-220 - [c58]Yehuda Lindell, Kobbi Nissim, Claudio Orlandi:
Hiding the Input-Size in Secure Two-Party Computation. ASIACRYPT (2) 2013: 421-440 - [c57]Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner:
More efficient oblivious transfer and extensions for faster secure computation. CCS 2013: 535-548 - [c56]Yehuda Lindell:
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries. CRYPTO (2) 2013: 1-17 - [c55]Yehuda Lindell:
Techniques for Efficient Secure Computation Based on Yao's Protocol. Public Key Cryptography 2013: 253 - [c54]Gilad Asharov, Yehuda Lindell, Tal Rabin:
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. TCC 2013: 243-262 - [c53]Yehuda Lindell, Hila Zarosim:
On the Feasibility of Extending Oblivious Transfer. TCC 2013: 519-538 - 2012
- [c52]Yehuda Lindell, Eran Omri, Hila Zarosim:
Completeness for Symmetric Two-Party Functionalities - Revisited. ASIACRYPT 2012: 116-133 - 2011
- [c51]Shai Halevi, Yehuda Lindell, Benny Pinkas:
Secure Computation on the Web: Computing without Simultaneous Interaction. CRYPTO 2011: 132-150 - [c50]Gilad Asharov, Yehuda Lindell, Tal Rabin:
Perfectly-Secure Multiplication for Any t < n/3. CRYPTO 2011: 240-258 - [c49]Yehuda Lindell, Eli Oxman, Benny Pinkas:
The IPS Compiler: Optimizations, Variants and Concrete Efficiency. CRYPTO 2011: 259-276 - [c48]Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov:
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. CRYPTO 2011: 277-296 - [c47]Yehuda Lindell:
Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption. EUROCRYPT 2011: 446-466 - [c46]Yehuda Lindell, Benny Pinkas:
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. TCC 2011: 329-346 - [c45]Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin:
On the Black-Box Complexity of Optimally-Fair Coin Tossing. TCC 2011: 450-467 - 2010
- [c44]Yehuda Lindell, Erez Waisbard:
Private Web Search with Malicious Adversaries. Privacy Enhancing Technologies 2010: 220-235 - 2009
- [c43]Joël Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, Ivan Visconti:
Collusion-Free Multiparty Computation in the Mediated Model. CRYPTO 2009: 524-540 - [c42]Gilad Asharov, Yehuda Lindell:
Utility Dependence in Correct and Fair Rational Secret Sharing. CRYPTO 2009: 559-576 - [c41]Andrew Y. Lindell:
Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1. CT-RSA 2009: 66-83 - [c40]Andrew Y. Lindell:
Adaptively Secure Two-Party Computation with Erasures. CT-RSA 2009: 117-132 - [c39]Andrew Y. Lindell:
Local Sequentiality Does Not Help for Concurrent Composition. CT-RSA 2009: 372-388 - [c38]Yehuda Lindell, Hila Zarosim:
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. TCC 2009: 183-201 - 2008
- [c37]Carmit Hazay, Yehuda Lindell:
Constructions of truly practical secure protocols using standard smartcards. CCS 2008: 491-500 - [c36]Andrew Y. Lindell:
Efficient Fully-Simulatable Oblivious Transfer. CT-RSA 2008: 52-70 - [c35]Andrew Y. Lindell:
Legally-Enforceable Fairness in Secure Two-Party Computation. CT-RSA 2008: 121-137 - [c34]Jonathan Katz, Andrew Y. Lindell:
Aggregate Message Authentication Codes. CT-RSA 2008: 155-169 - [c33]Yehuda Lindell, Benny Pinkas, Nigel P. Smart:
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. SCN 2008: 2-20 - [c32]S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell:
Complete fairness in secure two-party computation. STOC 2008: 413-422 - [c31]Carmit Hazay, Yehuda Lindell:
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. TCC 2008: 155-175 - 2007
- [c30]Yehuda Lindell, Benny Pinkas:
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. EUROCRYPT 2007: 52-78 - [c29]Yonatan Aumann, Yehuda Lindell:
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. TCC 2007: 137-156 - [c28]Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell:
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. TCC 2007: 323-341 - 2006
- [c27]Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. CRYPTO 2006: 483-500 - [c26]Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
Black-box constructions for secure computation. STOC 2006: 99-108 - [c25]Eyal Kushilevitz, Yehuda Lindell, Tal Rabin:
Information-theoretically secure protocols and security under composition. STOC 2006: 109-118 - 2005
- [c24]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. CRYPTO 2005: 361-377 - [c23]Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie:
Universally Composable Password-Based Key Exchange. EUROCRYPT 2005: 404-421 - [c22]Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran:
Concurrent general composition of secure protocols in the timing model. STOC 2005: 644-653 - [c21]Jonathan Katz, Yehuda Lindell:
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. TCC 2005: 128-149 - 2004
- [c20]Yehuda Lindell:
Lower Bounds for Concurrent Self Composition. TCC 2004: 203-222 - 2003
- [c19]Ran Canetti, Eyal Kushilevitz, Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. EUROCRYPT 2003: 68-86 - [c18]Yehuda Lindell:
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions. EUROCRYPT 2003: 241-254 - [c17]Rosario Gennaro, Yehuda Lindell:
A Framework for Password-Based Authenticated Key Exchange. EUROCRYPT 2003: 524-543 - [c16]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower Bounds for Non-Black-Box Zero Knowledge. FOCS 2003: 384-393 - [c15]Yehuda Lindell:
General Composition and Universal Composability in Secure Multi-Party Computation. FOCS 2003: 394-403 - [c14]Yehuda Lindell:
Brief announcement: impossibility results for concurrent secure two-party computation. PODC 2003: 200 - [c13]Yehuda Lindell:
Bounded-concurrent secure two-party computation without setup assumptions. STOC 2003: 683-692 - 2002
- [c12]Yehuda Lindell, Anna Lysyanskaya, Tal Rabin:
Sequential composition of protocols without simultaneous termination. PODC 2002: 203-212 - [c11]Boaz Barak, Yehuda Lindell:
Strict polynomial-time in simulation and extraction. STOC 2002: 484-493 - [c10]Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai:
Universally composable two-party and multi-party secure computation. STOC 2002: 494-503 - [c9]Yehuda Lindell, Anna Lysyanskaya, Tal Rabin:
On the composition of authenticated byzantine agreement. STOC 2002: 514-523 - [c8]Shafi Goldwasser, Yehuda Lindell:
Secure Computation without Agreement. DISC 2002: 17-32 - 2001
- [c7]Yehuda Lindell:
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. CRYPTO 2001: 171-189 - [c6]Oded Goldreich, Yehuda Lindell:
Session-Key Generation Using Human Passwords Only. CRYPTO 2001: 408-432 - [c5]Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell:
Resettably-Sound Zero-Knowledge and its Applications. FOCS 2001: 116-125 - 2000
- [c4]Yehuda Lindell, Benny Pinkas:
Privacy Preserving Data Mining. CRYPTO 2000: 36-54 - 1999
- [c3]Yonatan Aumann, Yehuda Lindell:
A Statistical Theory for Quantitative Association Rules. KDD 1999: 261-270 - 1998
- [c2]David Landau, Ronen Feldman, Yonatan Aumann, Moshe Fresko, Yehuda Lindell, Orly Liphstat, Oren Zamir:
TextVis: An Integrated Visual Environment for Text Mining. PKDD 1998: 56-64 - [c1]Ronen Feldman, Moshe Fresko, Yakkov Kinar, Yehuda Lindell, Orly Liphstat, Martin Rajman, Yonatan Schler, Oren Zamir:
Text Mining at the Term Level. PKDD 1998: 65-73
Parts in Books or Collections
- 2017
- [p2]Yehuda Lindell:
How to Simulate It - A Tutorial on the Simulation Proof Technique. Tutorials on the Foundations of Cryptography 2017: 277-346 - 2013
- [p1]Gilad Asharov, Yehuda Lindell:
The BGW Protocol for Perfectly-Secure Multiparty Computation. Secure Multi-Party Computation 2013: 120-167
Editorship
- 2017
- [e2]Yehuda Lindell:
Tutorials on the Foundations of Cryptography. Springer International Publishing 2017, ISBN 978-3-319-57047-1 [contents] - 2014
- [e1]Yehuda Lindell:
Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings. Lecture Notes in Computer Science 8349, Springer 2014, ISBN 978-3-642-54241-1 [contents]
Reference Works
- 2009
- [r1]Yehuda Lindell:
Secure Computation for Privacy Preserving Data Mining. Encyclopedia of Data Warehousing and Mining 2009: 1747-1752
Informal and Other Publications
- 2024
- [i102]Yi-Hsiu Chen, Yehuda Lindell:
Feldman's Verifiable Secret Sharing for a Dishonest Majority. IACR Cryptol. ePrint Arch. 2024: 31 (2024) - [i101]Dan Boneh, Iftach Haitner, Yehuda Lindell:
Exponent-VRFs and Their Applications. IACR Cryptol. ePrint Arch. 2024: 397 (2024) - [i100]Yi-Hsiu Chen, Yehuda Lindell:
Optimizing and Implementing Fischlin's Transform for UC-Secure Zero-Knowledge. IACR Cryptol. ePrint Arch. 2024: 526 (2024) - 2022
- [i99]Yehuda Lindell:
Simple Three-Round Multiparty Schnorr Signing with Full Simulatability. IACR Cryptol. ePrint Arch. 2022: 374 (2022) - 2020
- [i98]Hila Dahari, Yehuda Lindell:
Deterministic-Prover Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2020: 141 (2020) - [i97]Yehuda Lindell:
Secure Multiparty Computation (MPC). IACR Cryptol. ePrint Arch. 2020: 300 (2020) - 2019
- [i96]Jun Furukawa, Yehuda Lindell:
Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. IACR Cryptol. ePrint Arch. 2019: 658 (2019) - [i95]Shay Gueron, Yehuda Lindell:
SimpleENC and SimpleENCsmall - an Authenticated Encryption Mode for the Lightweight Setting. IACR Cryptol. ePrint Arch. 2019: 712 (2019) - [i94]Shay Gueron, Adam Langley, Yehuda Lindell:
AES-GCM-SIV: Nonce Misuse-Resistant Authenticated Encryption. RFC 8452: 1-42 (2019) - 2018
- [i93]Stav Buchsbaum, Ran Gilad-Bachrach, Yehuda Lindell:
Turning Lemons into Peaches using Secure Computation. CoRR abs/1810.02066 (2018) - [i92]David W. Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob Illeborg Pagter, Nigel P. Smart, Rebecca N. Wright:
From Keys to Databases - Real-World Applications of Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2018: 450 (2018) - [i91]Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof:
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. IACR Cryptol. ePrint Arch. 2018: 570 (2018) - [i90]Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas:
Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries. IACR Cryptol. ePrint Arch. 2018: 577 (2018) - [i89]Assi Barak, Martin Hirt, Lior Koskas, Yehuda Lindell:
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. IACR Cryptol. ePrint Arch. 2018: 751 (2018) - [i88]Toshinori Araki, Assi Barak, Jun Furukawa, Marcel Keller, Yehuda Lindell, Kazuma Ohara, Hikaru Tsuchida:
Generalizing the SPDZ Compiler For Other Protocols. IACR Cryptol. ePrint Arch. 2018: 762 (2018) - [i87]Yehuda Lindell, Ariel Nof, Samuel Ranellucci:
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. IACR Cryptol. ePrint Arch. 2018: 987 (2018) - [i86]Michael Kraitsberg, Yehuda Lindell, Valery Osheter, Nigel P. Smart, Younes Talibi Alaoui:
Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme. IACR Cryptol. ePrint Arch. 2018: 1034 (2018) - 2017
- [i85]Yehuda Lindell:
How To Simulate It - A Tutorial on the Simulation Proof Technique. Electron. Colloquium Comput. Complex. TR17 (2017) - [i84]Gilad Asharov, Shai Halevi, Yehuda Lindell, Tal Rabin:
Privacy-Preserving Search of Similar Patients in Genomic Data. IACR Cryptol. ePrint Arch. 2017: 144 (2017) - [i83]Shay Gueron, Adam Langley, Yehuda Lindell:
AES-GCM-SIV: Specification and Analysis. IACR Cryptol. ePrint Arch. 2017: 168 (2017) - [i82]Yehuda Lindell:
Fast Secure Two-Party ECDSA Signing. IACR Cryptol. ePrint Arch. 2017: 552 (2017) - [i81]Shay Gueron, Yehuda Lindell:
Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation. IACR Cryptol. ePrint Arch. 2017: 702 (2017) - [i80]Yehuda Lindell, Ariel Nof:
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority. IACR Cryptol. ePrint Arch. 2017: 816 (2017) - [i79]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Efficient Scalable Constant-Round MPC via Garbled Circuits. IACR Cryptol. ePrint Arch. 2017: 862 (2017) - [i78]Yehuda Lindell, Tal Rabin:
Secure Two-Party Computation with Fairness - A Necessary Design Principle. IACR Cryptol. ePrint Arch. 2017: 952 (2017) - [i77]Yehuda Lindell, Avishay Yanai:
Fast Garbling of Circuits over 3-Valued Logic. IACR Cryptol. ePrint Arch. 2017: 1225 (2017) - 2016
- [i76]Yehuda Lindell:
How To Simulate It - A Tutorial on the Simulation Proof Technique. IACR Cryptol. ePrint Arch. 2016: 46 (2016) - [i75]Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez:
More Efficient Constant-Round Multi-Party Computation from BMR and SHE. IACR Cryptol. ePrint Arch. 2016: 156 (2016) - [i74]Vladimir Kolesnikov, Hugo Krawczyk, Yehuda Lindell, Alex J. Malozemoff, Tal Rabin:
Attribute-based Key Exchange with General Policies. IACR Cryptol. ePrint Arch. 2016: 518 (2016) - [i73]Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner:
More Efficient Oblivious Transfer Extensions. IACR Cryptol. ePrint Arch. 2016: 602 (2016) - [i72]Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara:
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. IACR Cryptol. ePrint Arch. 2016: 768 (2016) - [i71]Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein:
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. IACR Cryptol. ePrint Arch. 2016: 944 (2016) - [i70]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Optimizing Semi-Honest Secure Multiparty Computation for the Internet. IACR Cryptol. ePrint Arch. 2016: 1066 (2016) - 2015
- [i69]Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner:
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. IACR Cryptol. ePrint Arch. 2015: 61 (2015) - [i68]Shay Gueron, Yehuda Lindell:
GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte. IACR Cryptol. ePrint Arch. 2015: 102 (2015) - [i67]Carmit Hazay, Yehuda Lindell, Arpita Patra:
Adaptively Secure Computation with Partial Erasures. IACR Cryptol. ePrint Arch. 2015: 450 (2015) - [i66]Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai:
Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ. IACR Cryptol. ePrint Arch. 2015: 523 (2015) - [i65]Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas:
Fast Garbling of Circuits Under Standard Assumptions. IACR Cryptol. ePrint Arch. 2015: 751 (2015) - [i64]Yehuda Lindell, Ben Riva:
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries. IACR Cryptol. ePrint Arch. 2015: 987 (2015) - 2014
- [i63]Yehuda Lindell, Eran Omri, Hila Zarosim:
Completeness for Symmetric Two-Party Functionalities - Revisited. IACR Cryptol. ePrint Arch. 2014: 18 (2014) - [i62]Ran Canetti, Asaf Cohen, Yehuda Lindell:
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 553 (2014) - [i61]Yehuda Lindell, Ben Riva:
Cut-and-Choose Based Two-Party Computation in the Online/Offline and Batch Settings. IACR Cryptol. ePrint Arch. 2014: 667 (2014) - [i60]Ran Cohen, Yehuda Lindell:
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 668 (2014) - [i59]Yehuda Lindell:
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle. IACR Cryptol. ePrint Arch. 2014: 710 (2014) - 2013
- [i58]Yehuda Lindell:
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries. IACR Cryptol. ePrint Arch. 2013: 79 (2013) - [i57]Gilad Asharov, Yehuda Lindell, Tal Rabin:
Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. IACR Cryptol. ePrint Arch. 2013: 110 (2013) - [i56]Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner:
More Efficient Oblivious Transfer and Extensions for Faster Secure Computation. IACR Cryptol. ePrint Arch. 2013: 552 (2013) - [i55]Gilad Asharov, Yehuda Lindell, Hila Zarosim:
Fair and Efficient Secure Multiparty Computation with Reputation Systems. IACR Cryptol. ePrint Arch. 2013: 824 (2013) - 2012
- [i54]Yehuda Lindell, Hila Zarosim:
On the Feasibility of Extending Oblivious Transfer. IACR Cryptol. ePrint Arch. 2012: 333 (2012) - [i53]Yael Ejgenberg, Moriya Farbstein, Meital Levy, Yehuda Lindell:
SCAPI: The Secure Computation Application Programming Interface. IACR Cryptol. ePrint Arch. 2012: 629 (2012) - [i52]Yehuda Lindell, Kobbi Nissim, Claudio Orlandi:
Hiding the Input-Size in Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2012: 679 (2012) - 2011
- [i51]Gilad Asharov, Yehuda Lindell:
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. Electron. Colloquium Comput. Complex. TR11 (2011) - [i50]Yehuda Lindell:
Constant-Round Zero-Knowledge Proofs of Knowledge. Electron. Colloquium Comput. Complex. TR11 (2011) - [i49]Gilad Asharov, Yehuda Lindell:
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2011: 136 (2011) - [i48]Yehuda Lindell, Eran Omri:
A Practical Application of Differential Privacy to Personalized Online Advertising. IACR Cryptol. ePrint Arch. 2011: 152 (2011) - [i47]Shai Halevi, Yehuda Lindell, Benny Pinkas:
Secure Computation on the Web: Computing without Simultaneous Interaction. IACR Cryptol. ePrint Arch. 2011: 157 (2011) - [i46]Yehuda Lindell:
Highly-Efficient Universally-Composable Commitments based on the DDH Assumption. IACR Cryptol. ePrint Arch. 2011: 180 (2011) - [i45]Yehuda Lindell, Benny Pinkas, Eli Oxman:
The IPS Compiler: Optimizations, Variants and Concrete Efficiency. IACR Cryptol. ePrint Arch. 2011: 435 (2011) - 2010
- [i44]Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2010: 29 (2010) - [i43]Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
Black-Box Constructions of Protocols for Secure Computation. IACR Cryptol. ePrint Arch. 2010: 164 (2010) - [i42]Yehuda Lindell, Benny Pinkas:
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. IACR Cryptol. ePrint Arch. 2010: 284 (2010) - [i41]Carmit Hazay, Yehuda Lindell:
A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries. IACR Cryptol. ePrint Arch. 2010: 551 (2010) - [i40]Carmit Hazay, Yehuda Lindell:
A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality. IACR Cryptol. ePrint Arch. 2010: 552 (2010) - [i39]Yehuda Lindell:
Constant-Round Zero-Knowledge Proofs of Knowledge. IACR Cryptol. ePrint Arch. 2010: 656 (2010) - 2009
- [i38]Yehuda Lindell:
Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1. IACR Cryptol. ePrint Arch. 2009: 13 (2009) - [i37]Yehuda Lindell:
Adaptively Secure Two-Party Computation with Erasures. IACR Cryptol. ePrint Arch. 2009: 31 (2009) - [i36]Carmit Hazay, Yehuda Lindell:
Constructions of Truly Practical Secure Protocols using Standard Smartcards. IACR Cryptol. ePrint Arch. 2009: 36 (2009) - [i35]Carmit Hazay, Yehuda Lindell:
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. IACR Cryptol. ePrint Arch. 2009: 45 (2009) - [i34]Yehuda Lindell, Hila Zarosim:
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. IACR Cryptol. ePrint Arch. 2009: 366 (2009) - [i33]Gilad Asharov, Yehuda Lindell:
Utility Dependence in Correct and Fair Rational Secret Sharing. IACR Cryptol. ePrint Arch. 2009: 373 (2009) - [i32]Carmit Hazay, Yehuda Lindell:
Efficient Oblivious Polynomial Evaluation with Simulation-Based Security. IACR Cryptol. ePrint Arch. 2009: 459 (2009) - [i31]Eyal Kushilevitz, Yehuda Lindell, Tal Rabin:
Information-Theoretically Secure Protocols and Security Under Composition. IACR Cryptol. ePrint Arch. 2009: 630 (2009) - 2008
- [i30]Yehuda Lindell:
Efficient Fully-Simulatable Oblivious Transfer. IACR Cryptol. ePrint Arch. 2008: 35 (2008) - [i29]Yehuda Lindell, Benny Pinkas:
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. IACR Cryptol. ePrint Arch. 2008: 49 (2008) - [i28]Yehuda Lindell, Benny Pinkas:
Secure Multiparty Computation for Privacy-Preserving Data Mining. IACR Cryptol. ePrint Arch. 2008: 197 (2008) - [i27]S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell:
Complete Fairness in Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2008: 303 (2008) - [i26]Jonathan Katz, Yehuda Lindell:
Collusion-Free Multiparty Computation in the Mediated Model. IACR Cryptol. ePrint Arch. 2008: 533 (2008) - 2007
- [i25]Yonatan Aumann, Yehuda Lindell:
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. IACR Cryptol. ePrint Arch. 2007: 60 (2007) - [i24]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. IACR Cryptol. ePrint Arch. 2007: 464 (2007) - [i23]Dafna Kidron, Yehuda Lindell:
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs. IACR Cryptol. ePrint Arch. 2007: 478 (2007) - 2005
- [i22]Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran:
Concurrent Composition of Secure Protocols in the Timing Model. IACR Cryptol. ePrint Arch. 2005: 36 (2005) - [i21]Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie:
Universally Composable Password-Based Key Exchange. IACR Cryptol. ePrint Arch. 2005: 196 (2005) - [i20]Jonathan Katz, Yehuda Lindell:
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. IACR Cryptol. ePrint Arch. 2005: 379 (2005) - 2004
- [i19]Yehuda Lindell, Benny Pinkas:
A Proof of Yao's Protocol for Secure Two-Party Computation. Electron. Colloquium Comput. Complex. TR04 (2004) - [i18]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower Bounds for Non-Black-Box Zero Knowledge. Electron. Colloquium Comput. Complex. TR04 (2004) - [i17]Boaz Barak, Yehuda Lindell, Tal Rabin:
Protocol Initialization for the Framework of Universal Composability. IACR Cryptol. ePrint Arch. 2004: 6 (2004) - [i16]Yehuda Lindell:
Lower Bounds and Impossibility Results for Concurrent Self Composition. IACR Cryptol. ePrint Arch. 2004: 45 (2004) - [i15]Ran Canetti, Eyal Kushilevitz, Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions. IACR Cryptol. ePrint Arch. 2004: 116 (2004) - [i14]Yehuda Lindell, Benny Pinkas:
A Proof of Yao's Protocol for Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2004: 175 (2004) - [i13]Yehuda Lindell, Anna Lysyanskaya, Tal Rabin:
On the Composition of Authenticated Byzantine Agreement. IACR Cryptol. ePrint Arch. 2004: 181 (2004) - [i12]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower Bounds for Non-Black-Box Zero Knowledge. IACR Cryptol. ePrint Arch. 2004: 226 (2004) - 2003
- [i11]Rosario Gennaro, Yehuda Lindell:
A Framework for Password-Based Authenticated Key Exchange. IACR Cryptol. ePrint Arch. 2003: 32 (2003) - [i10]Yehuda Lindell:
Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model. IACR Cryptol. ePrint Arch. 2003: 100 (2003) - [i9]Yehuda Lindell:
General Composition and Universal Composability in Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2003: 141 (2003) - 2002
- [i8]Boaz Barak, Yehuda Lindell:
Strict Polynomial-time in Simulation and Extraction. Electron. Colloquium Comput. Complex. TR02 (2002) - [i7]Shafi Goldwasser, Yehuda Lindell:
Secure Computation Without Agreement. IACR Cryptol. ePrint Arch. 2002: 40 (2002) - [i6]Boaz Barak, Yehuda Lindell:
Strict Polynomial-time in Simulation and Extraction. IACR Cryptol. ePrint Arch. 2002: 43 (2002) - [i5]Yehuda Lindell:
A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions. IACR Cryptol. ePrint Arch. 2002: 57 (2002) - [i4]Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai:
Universally Composable Two-Party and Multi-Party Secure Computation. IACR Cryptol. ePrint Arch. 2002: 140 (2002) - 2001
- [i3]Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell:
Resettably-Sound Zero-Knowledge and its Applications. IACR Cryptol. ePrint Arch. 2001: 63 (2001) - [i2]Yehuda Lindell:
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2001: 107 (2001) - 2000
- [i1]Oded Goldreich, Yehuda Lindell:
Session-Key Generation using Human Passwords Only. IACR Cryptol. ePrint Arch. 2000: 57 (2000)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
