| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gilad Asharov, Yehuda Lindell |
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Constant-Round Zero-Knowledge Proofs of Knowledge. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gilad Asharov, Yehuda Lindell |
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Eran Omri |
A Practical Application of Differential Privacy to Personalized Online Advertising. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shai Halevi, Yehuda Lindell, Benny Pinkas |
Secure Computation on the Web: Computing without Simultaneous Interaction. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Benny Pinkas, Eli Oxman |
The IPS Compiler: Optimizations, Variants and Concrete Efficiency. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Highly-Efficient Universally-Composable Commitments based on the DDH Assumption. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell |
Complete Fairness in Secure Two-Party Computation. |
J. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilad Asharov, Yehuda Lindell |
Utility Dependence in Correct and Fair Rational Secret Sharing. |
J. Cryptology |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Lindell, Hila Zarosim |
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. |
J. Cryptology |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin |
Secure Computation Without Authentication. |
J. Cryptology |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dafna Kidron, Yehuda Lindell |
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs. |
J. Cryptology |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
Black-Box Constructions of Protocols for Secure Computation. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Lindell |
Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption. |
EUROCRYPT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Lindell, Benny Pinkas |
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. |
TCC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin |
On the Black-Box Complexity of Optimally-Fair Coin Tossing. |
TCC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilad Asharov, Yehuda Lindell, Tal Rabin |
Perfectly-Secure Multiplication for Any t < n/3. |
CRYPTO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shai Halevi, Yehuda Lindell, Benny Pinkas |
Secure Computation on the Web: Computing without Simultaneous Interaction. |
CRYPTO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov |
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. |
CRYPTO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Lindell, Eli Oxman, Benny Pinkas |
The IPS Compiler: Optimizations, Variants and Concrete Efficiency. |
CRYPTO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Carmit Hazay, Yehuda Lindell |
A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Constant-Round Zero-Knowledge Proofs of Knowledge. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
Black-Box Constructions of Protocols for Secure Computation. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Benny Pinkas |
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Carmit Hazay, Yehuda Lindell |
A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yonatan Aumann, Yehuda Lindell |
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. |
J. Cryptology |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Carmit Hazay, Yehuda Lindell |
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. |
J. Cryptology |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Yehuda Lindell, Tal Rabin |
Information-Theoretically Secure Protocols and Security under Composition. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Lindell, Erez Waisbard |
Private Web Search with Malicious Adversaries. |
Privacy Enhancing Technologies |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Lindell |
Legally Enforceable Fairness in Secure Two-Party Communication. |
Chicago J. Theor. Comput. Sci. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Carmit Hazay, Yehuda Lindell |
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Hila Zarosim |
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Carmit Hazay, Yehuda Lindell |
Constructions of Truly Practical Secure Protocols using Standard Smartcards. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Yehuda Lindell, Tal Rabin |
Information-Theoretically Secure Protocols and Security Under Composition. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Adaptively Secure Two-Party Computation with Erasures. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Gilad Asharov, Yehuda Lindell |
Utility Dependence in Correct and Fair Rational Secret Sharing. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Carmit Hazay, Yehuda Lindell |
Efficient Oblivious Polynomial Evaluation with Simulation-Based Security. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Benny Pinkas |
A Proof of Security of Yao's Protocol for Two-Party Computation. |
J. Cryptology |
2009 |
DBLP DOI BibTeX RDF |
Semi-honest adversaries, Yao’s two-party protocol, Secure two-party computation, Proofs of security |
| 1 | Yehuda Lindell |
General Composition and Universal Composability in Secure Multiparty Computation. |
J. Cryptology |
2009 |
DBLP DOI BibTeX RDF |
Concurrent general composition, Universal composability, Secure computation |
| 1 | Yehuda Lindell |
Secure Computation for Privacy Preserving Data Mining. |
Encyclopedia of Data Warehousing and Mining |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Hila Zarosim |
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, Ivan Visconti |
Collusion-Free Multiparty Computation in the Mediated Model. |
CRYPTO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilad Asharov, Yehuda Lindell |
Utility Dependence in Correct and Fair Rational Secret Sharing. |
CRYPTO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Lindell |
Efficient Fully-Simulatable Oblivious Transfer. |
Chicago J. Theor. Comput. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Efficient Fully-Simulatable Oblivious Transfer. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell |
Complete Fairness in Secure Two-Party Computation. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Benny Pinkas |
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jonathan Katz, Yehuda Lindell |
Collusion-Free Multiparty Computation in the Mediated Model. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Benny Pinkas |
Secure Multiparty Computation for Privacy-Preserving Data Mining. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Lower Bounds and Impossibility Results for Concurrent Self Composition. |
J. Cryptology |
2008 |
DBLP DOI BibTeX RDF |
Self and general composition, Non-black-box and black-box simulation, Lower bounds, Secure computation, Protocol composition, Impossibility results |
| 1 | Jonathan Katz, Yehuda Lindell |
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. |
J. Cryptology |
2008 |
DBLP DOI BibTeX RDF |
Expected polynomial-time, Black-box simulation, Zero-knowledge, Secure multiparty computation |
| 1 | Yehuda Lindell, Benny Pinkas, Nigel P. Smart |
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. |
SCN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Carmit Hazay, Yehuda Lindell |
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. |
TCC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell |
Complete fairness in secure two-party computation. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
cryptography, fairness, secure computation |
| 1 | Carmit Hazay, Yehuda Lindell |
Constructions of truly practical secure protocols using standardsmartcards. |
ACM Conference on Computer and Communications Security |
2008 |
DBLP DOI BibTeX RDF |
provable security, smartcards, secure computation |
| 1 | Yonatan Aumann, Yehuda Lindell |
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin |
Secure Computation Without Authentication. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dafna Kidron, Yehuda Lindell |
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran |
Concurrent Composition of Secure Protocols in the Timing Model. |
J. Cryptology |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Katz, Yehuda Lindell |
Introduction to Modern Cryptography |
|
2007 |
RDF |
|
| 1 | Yehuda Lindell, Benny Pinkas |
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. |
EUROCRYPT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonatan Aumann, Yehuda Lindell |
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. |
TCC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell |
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. |
TCC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Lindell |
Protocols for Bounded-Concurrent Secure Two-Party Computation. |
Chicago J. Theor. Comput. Sci. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Anna Lysyanskaya, Tal Rabin |
On the composition of authenticated Byzantine Agreement. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
Authenticated Byzantine Agreement, lower bounds, randomized protocols, protocol composition |
| 1 | Oded Goldreich, Yehuda Lindell |
Session-Key Generation Using Human Passwords Only. |
J. Cryptology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Canetti, Eyal Kushilevitz, Yehuda Lindell |
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. |
J. Cryptology |
2006 |
DBLP DOI BibTeX RDF |
Universal composability, Secure two-party computation, Impossibility results |
| 1 | Yehuda Lindell |
A Simpler Construction of CCA2-Secure Public-KeyEncryption under General Assumptions. |
J. Cryptology |
2006 |
DBLP DOI BibTeX RDF |
Adaptive chosen-ciphertext attacks, Simulation-sound non-interactive zero-knowledge, Public-key encryption |
| 1 | Boaz Barak, Yehuda Lindell, Salil P. Vadhan |
Lower bounds for non-black-box zero knowledge. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rosario Gennaro, Yehuda Lindell |
A framework for password-based authenticated key exchange1. |
ACM Trans. Inf. Syst. Secur. |
2006 |
DBLP DOI BibTeX RDF |
projective hash functions, authentication, Passwords, dictionary attack |
| 1 | Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. |
CRYPTO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Yehuda Lindell, Tal Rabin |
Information-theoretically secure protocols and security under composition. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
theory of cryptography, information-theoretic security, secure computation, protocol composition |
| 1 | Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
Black-box constructions for secure computation. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
theory of cryptography, oblivious transfer, secure computation, black-box reductions |
| 1 | Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran |
Concurrent Composition of Secure Protocols in the Timing Model. |
IACR Cryptology ePrint Archive |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie |
Universally Composable Password-Based Key Exchange. |
IACR Cryptology ePrint Archive |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jonathan Katz, Yehuda Lindell |
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. |
IACR Cryptology ePrint Archive |
2005 |
DBLP BibTeX RDF |
|
| 1 | Shafi Goldwasser, Yehuda Lindell |
Secure Multi-Party Computation without Agreement. |
J. Cryptology |
2005 |
DBLP DOI BibTeX RDF |
Broadcast, Secure multi-party computation, Protocol composition |
| 1 | Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie |
Universally Composable Password-Based Key Exchange. |
EUROCRYPT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Katz, Yehuda Lindell |
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. |
TCC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin |
Secure Computation Without Authentication. |
CRYPTO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran |
Concurrent general composition of secure protocols in the timing model. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
cryptography, secure multiparty computation, protocol composition |
| 1 | Boaz Barak, Yehuda Lindell, Salil P. Vadhan |
Lower Bounds for Non-Black-Box Zero Knowledge |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Benny Pinkas |
A Proof of Yao's Protocol for Secure Two-Party Computation |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Yehuda Lindell, Tal Rabin |
Protocol Initialization for the Framework of Universal Composability. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Benny Pinkas |
A Proof of Yao's Protocol for Secure Two-Party Computation. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell, Anna Lysyanskaya, Tal Rabin |
On the Composition of Authenticated Byzantine Agreement. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Lower Bounds and Impossibility Results for Concurrent Self Composition. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Ran Canetti, Eyal Kushilevitz, Yehuda Lindell |
On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Yehuda Lindell, Salil P. Vadhan |
Lower Bounds for Non-Black-Box Zero Knowledge. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Yehuda Lindell |
Strict Polynomial-Time in Simulation and Extraction. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Lindell |
Lower Bounds for Concurrent Self Composition. |
TCC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Lindell |
General Composition and Universal Composability in Secure Multiparty Computation. |
IACR Cryptology ePrint Archive |
2003 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model. |
IACR Cryptology ePrint Archive |
2003 |
DBLP BibTeX RDF |
|
| 1 | Rosario Gennaro, Yehuda Lindell |
A Framework for Password-Based Authenticated Key Exchange. |
IACR Cryptology ePrint Archive |
2003 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. |
J. Cryptology |
2003 |
DBLP DOI BibTeX RDF |
Constant-round protocols, Coin-tossing, Secure computation |
| 1 | Yonatan Aumann, Yehuda Lindell |
A Statistical Theory for Quantitative Association Rules. |
J. Intell. Inf. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Lindell |
Composition of Secure Multi-Party Protocols, A Comprehensive Study |
|
2003 |
DOI RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")