- Introduction to Cryptography Yehuda Lindell1
- Efficient Fully-Simulatable Oblivious Transfer Yehuda Lindell
- Aggregate Message Authentication Codes Jonathan Katz
- Foundations of Cryptography 89-856-01 Dr. Yehuda Lindell
- Privacy Preserving Data Mining \Lambda Yehuda Lindell
- A Statistical Theory for Quantitative Association Rules Yonatan Aumann \Lambda
- Solution to Exam 1 --Introduction to Cryptography Yehuda Lindell
- Carmit Hazay, Yehuda Lindell Efficient Secure Two-Party
- A Simpler Construction of CCA2Secure PublicKey Encryption Under General Assumptions
- A Statistical Theory for Quantitative Association Rules # Yonatan Aumann +
- ResettablySound ZeroKnowledge and its Applications Boaz Barak Oded Goldreich Shafi Goldwasser y Yehuda Lindell
- Foundations of Cryptography Yehuda Lindell
- Introduction to Cryptography 89-656 Brief Solutions and Remarks
- Solution to Final Exam Foundations of Cryptography 8985601
- The IPS Compiler: Optimizations, Variants and Concrete Efficiency
- Secure Computation on the Web: Computing without Simultaneous Interaction
- 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
- A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation
- A Note on Constant-Round Zero-Knowledge Proofs of Knowledge Yehuda Lindell
- Secure Multiparty Computation for Privacy-Preserving Data Mining
- Implementing Two-Party Computation Efficiently with Security Against Malicious
- Complete Fairness in Secure Two-Party Computation S. Dov Gordon
- Research Statement Yehuda Lindell
- Classic Results in Theoretical Computer Science Bar-Ilan University
- Introduction to Cryptography 89-656 Final Exam, Moed Aleph 2008
- Introduction to Cryptography 89-656 Final Exam, Moed Beth 2008
- Introduction to Cryptography 89-656 Final Exam, Moed Aleph 2009
- Introduction to Cryptography 89-656 Final Exam, Moed Beth 2009
- A Proof of Security of Yao's Protocol for Two-Party Computation Yehuda Lindell Benny Pinkas y
- Brief Announcement: Impossibility Results for Concurrent Secure TwoParty Computation
- Introduction 1.1 Secure Computation
- Protocols for BoundedConcurrent Secure TwoParty Computation in the Plain Model
- Sequential Composition of Protocols Without Simultaneous Termination
- Final Exam Solutions Foundations of Cryptography 89-856-01
- Introduction to Cryptography Bar-Ilan University
- Foundations of Cryptography 8985601 Dr. Yehuda Lindell
- SessionKey Generation using Human Passwords Oded Goldreich ? and Yehuda Lindell
- Legally Enforceable Fairness in Secure Two-Party Computation
- On the Limitations of Universally Composable Two Party Computation Without Setup Assumptions #
- Abstract and Course Syllabus In this course, we will study the theoretical foundations of modern cryptography. The
- Solution to Moed Beth Exam Introduction to Cryptography (89656)
- Strict Polynomialtime in Simulation and Extraction # Department of Computer Science
- Research Statement Yehuda Lindell
- Introduction to Cryptography Yehuda Lindell 1
- Foundations of Cryptography Yehuda Lindell
- BoundedConcurrent Secure TwoParty Computation Without Setup Assumptions
- Adaptively Secure Two-Party Computation with Erasures
- Text Mining at the Term Level Ronen Feldman 1 , Moshe Fresko 1 , Yakkov Kinar 1 ,Yehuda Lindell 1 , Orly Liphstat 1 ,
- Solution to Final Exam Foundations of Cryptography 8985601
- BarIlan University Department of Mathematics and Computer Science
- Lower Bounds and Impossibility Results for Concurrent Self Composition #
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Introduction to Cryptography 89-656 Final Exam, Moed Beth 2007
- Secure Computation Without Authentication Ran Canetti
- F E A T U R E S Includes formal definitions, precise assumptions, and rigorous proofs
- Foundations of Cryptography 8985601 Dr. Yehuda Lindell
- Universally Composable TwoParty and Multiparty Secure Computation
- Collusion-Free Multiparty Computation in the Mediated Model
- Introduction to Cryptography 89-656 Final Exam, Moed Aleph 2007
- Final Exam Solutions Foundations of Cryptography 89-856-01
- On the Composition of Authenticated Byzantine Agreement Yehuda Lindell y Anna Lysyanskaya z Tal Rabin x
- BlackBox Constructions for Secure Computation # (extended abstract)
- Introduction to Cryptography BarIlan University
- Perfectly-Secure Multiplication for any t < n/3 Gilad Asharov1
- Lower Bounds for NonBlackBox Zero Knowledge # Boaz Barak + Yehuda Lindell # Salil Vadhan
- Universally Composable PasswordBased Key Ran Canetti 1 , Shai Halevi 1 , Jonathan Katz 2 , Yehuda Lindell 3# , and Phil
- TextVis: An Integrated Visual Environment for Text Mining *
- Foundations of Cryptography 89-856-01 Dr. Yehuda Lindell
- Parallel CoinTossing and ConstantRound Secure TwoParty Computation #
- Secure Computation Without Authentication Boaz Barak 1 , Ran Canetti 2 , Yehuda Lindell 3 , Rafael Pass 4# , and Tal Rabin 2
- A Framework for PasswordBased Authenticated Key Exchange #
- Private Web Search with Malicious Adversaries Yehuda Lindell
- Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions ?
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation ?
- Lower Bounds for Concurrent Self Composition Yehuda Lindell
- Yehuda Lindell and Benny Pinkas, Computer Science Dept., Bar-Ilan University, Israel Beck Hall, Bar-Ilan University, Ramat Gan (greater Tel-Aviv area), Israel
- Introduction to Cryptography Bar-Ilan University
- Efficient Secure Two-Party Protocols: Techniques and Constructions
