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
2020 – today
- 2024
[j52]Yi-Hsiu Chen
, Yehuda Lindell:
Feldman's Verifiable Secret Sharing for a Dishonest Majority. IACR Commun. Cryptol. 1(1): 16 (2024)- [j51]Yehuda Lindell:
Simple Three-Round Multiparty Schnorr Signing with Full Simulatability. IACR Commun. Cryptol. 1(1): 25 (2024) - [j50]Yi-Hsiu Chen, Yehuda Lindell:
Optimizing and Implementing Fischlin's Transform for UC-Secure Zero Knowledge. IACR Commun. Cryptol. 1(2): 11 (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) - 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) - 2022
- [i99]Yehuda Lindell:
Simple Three-Round Multiparty Schnorr Signing with Full Simulatability. IACR Cryptol. ePrint Arch. 2022: 374 (2022) - 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) - [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)
2010 – 2019
- 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) - [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 - [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
- [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) - [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 - [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
- [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) - [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 - [p2]Yehuda Lindell:
How to Simulate It - A Tutorial on the Simulation Proof Technique. Tutorials on the Foundations of Cryptography 2017: 277-346 - [e2]Yehuda Lindell:
Tutorials on the Foundations of Cryptography. Springer International Publishing 2017, ISBN 978-3-319-57047-1 [contents] - [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
- [j35]Yehuda Lindell:
Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries. J. Cryptol. 29(2): 456-490 (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 - [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
- [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) - [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 - [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
- [b4]Jonathan Katz, Yehuda Lindell:
Introduction to Modern Cryptography, Second Edition. CRC Press 2014, ISBN 9781466570269 - [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 - [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] - [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
- [j33]Yehuda Lindell:
A Note on Constant-Round Zero-Knowledge Proofs of Knowledge. J. Cryptol. 26(4): 638-654 (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 - [p1]Gilad Asharov, Yehuda Lindell:
The BGW Protocol for Perfectly-Secure Multiparty Computation. Secure Multi-Party Computation 2013: 120-167 - [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
- [j32]Yehuda Lindell, Benny Pinkas:
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. J. Cryptol. 25(4): 680-722 (2012) - [c52]Yehuda Lindell, Eran Omri, Hila Zarosim:
Completeness for Symmetric Two-Party Functionalities - Revisited. ASIACRYPT 2012: 116-133 - [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
- [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) - [c51]Shai Halevi, Yehuda Lindell, Benny Pinkas:
Secure Computation on the Web: Computing without Simultaneous Interaction. CRYPTO 2011: 132-150 - [c50]