Cryptographers' World
 

Yehuda Lindell


Author's Web Page Link

37 papers and 1 book in database with 2832 citations StarStarStar

H-number: 21

Books

 
1. Jonathan KatzYehuda LindellIntroduction to Modern Cryptography: Principles and Protocols. Chapman & Hall / CRC, 2007. ISBN 978-1-584-88551-1.

Find this book on amazon.com , amazon.co.uk, amazon.ca, amazon.de, amazon.fr, Google Books or Wikipedia.

[Cited 19 times ]


Journal Papers

[Sort papers chronologically] [Sort papers by citations count]

 
1. Jonathan Katz,  Yehuda Lindell,  Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs, Journal of Cryptology, Volume 21(3), pp. 303 - 349, Springer, 2008.

[Cited 4 times ]

2. Yehuda Lindell,  Lower Bounds and Impossibility Results for Concurrent Self Composition, Journal of Cryptology, Volume 21(2), pp. 200 - 249, Springer, 2008.

[Cited 4 times ]

3. Yael Tauman Kalai,  Yehuda Lindell,  Manoj Prabhakaran,  Concurrent Composition of Secure Protocols in the Timing Model, Journal of Cryptology, Volume 20(4), pp. 431 - 492, Springer, 2007.

[Cited 18 times ]

4. Yehuda Lindell,  A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions, Journal of Cryptology, Volume 19(3), pp. 359 - 377, Springer, 2006.

[Cited 54 times Red Star]

5. Oded Goldreich,  Yehuda Lindell,  Session-Key Generation Using Human Passwords Only, Journal of Cryptology, Volume 19(3), pp. 241 - 340, Springer, 2006.

[Cited 118 times Red StarRed Star]

6. Ran Canetti,  Eyal Kushilevitz,  Yehuda Lindell,  On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions, Journal of Cryptology, Volume 19(2), pp. 135 - 167, Springer, 2006.

[Cited 79 times Red Star]

7. Shafi Goldwasser,  Yehuda Lindell,  Secure Multi-Party Computation without Agreement, Journal of Cryptology, Volume 18(3), pp. 247 - 287, Springer, 2005.

[Cited 8 times ]

8. Yehuda Lindell,  Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation, Journal of Cryptology, Volume 16(3), pp. 143 - 184, Springer, 2003.

[Cited 70 times Red Star]

9. Yehuda Lindell,  Benny Pinkas,  Privacy Preserving Data Mining, Journal of Cryptology, Volume 15(3), pp. 177 - 206, Springer, 2002.

[Cited 946 times Red StarRed StarRed StarRed Star]

Conference Papers

[Sort papers chronologically] [Sort papers by citations count]

1. Joël Alwen,  Jonathan Katz,  Yehuda Lindell,  Giuseppe Persiano,  Abhi Shelat,  Ivan Visconti,  Collusion-Free Multiparty Computation in the Mediated Model, pp. 524 - 540, CRYPTO 2009.

[Electronic Edition][Cited 2 times ]

2. Gilad Asharov,  Yehuda Lindell,  Utility Dependence in Correct and Fair Rational Secret Sharing, pp. 559 - 576, CRYPTO 2009.

[Electronic Edition][Cited 3 times ]

3. Yehuda Lindell,  Hila Zarosim,  Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer, pp. 183 - 201, TCC 2009.

[Electronic Edition][Cited 2 times ]

4. S. Dov Gordon,  Carmit Hazay,  Jonathan Katz,  Yehuda Lindell,  Complete fairness in secure two-party computation, pp. 413 - 422, STOC 2008.

[Electronic Edition][Cited 25 times ]

5. Yehuda Lindell,  Legally-Enforceable Fairness in Secure Two-Party Computation, pp. 121 - 137, CT-RSA 2008.

[Electronic Edition][Cited 8 times ]

6. Jonathan Katz,  Yehuda Lindell,  Aggregate Message Authentication Codes, pp. 155 - 169, CT-RSA 2008.

[Electronic Edition][Cited 25 times ]

7. Yehuda Lindell,  Efficient Fully-Simulatable Oblivious Transfer, pp. 52 - 70, CT-RSA 2008.

[Electronic Edition][Cited 17 times ]

8. Carmit Hazay,  Yehuda Lindell,  Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries, pp. 155 - 175, TCC 2008.

[Electronic Edition][Cited 48 times ]

9. Carmit Hazay,  Jonathan Katz,  Chiu-Yuen Koo,  Yehuda Lindell,  Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions, pp. 323 - 341, TCC 2007.

[Electronic Edition][Cited 22 times ]

10. Yonatan Aumann,  Yehuda Lindell,  Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries, pp. 137 - 156, TCC 2007.

[Electronic Edition][Cited 47 times ]

11. Yehuda Lindell,  Benny Pinkas,  An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries, pp. 52 - 78, EUROCRYPT 2007.

[Electronic Edition][Cited 68 times Red Star]

12. Yuval Ishai,  Eyal Kushilevitz,  Yehuda Lindell,  Erez Petrank,  Black-box constructions for secure computation, pp. 99 - 108, STOC 2006.

[Electronic Edition][Cited 22 times ]

13. Eyal Kushilevitz,  Yehuda Lindell,  Tal Rabin,  Information-theoretically secure protocols and security under composition, pp. 109 - 118, STOC 2006.

[Electronic Edition][Cited 29 times ]

14. Yuval Ishai,  Eyal Kushilevitz,  Yehuda Lindell,  Erez Petrank,  On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation, pp. 483 - 500, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 17 times ]

15. Boaz Barak,  Ran Canetti,  Yehuda Lindell,  Rafael Pass,  Tal Rabin,  Secure Computation Without Authentication, pp. 361 - 377, CRYPTO 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 35 times ]

16. Ran Canetti,  Shai Halevi,  Jonathan Katz,  Yehuda Lindell,  Philip D. MacKenzie,  Universally Composable Password-Based Key Exchange, pp. 404 - 421, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 87 times Red Star]

17. Yael Tauman Kalai,  Yehuda Lindell,  Manoj Prabhakaran,  Concurrent general composition of secure protocols in the timing model, pp. 644 - 653, STOC 2005.

[Electronic Edition][Cited 22 times ]

18. Jonathan Katz,  Yehuda Lindell,  Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs, pp. 128 - 149, TCC 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 8 times ]

19. Yehuda Lindell,  Lower Bounds for Concurrent Self Composition, pp. 203 - 222, TCC 2004.

[Electronic Edition][Cited 50 times Red Star]

20. Yehuda Lindell,  Bounded-concurrent secure two-party computation without setup assumptions, pp. 683 - 692, STOC 2003.

[Electronic Edition][Cited 56 times Red Star]

21. Yehuda Lindell,  A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions, pp. 241 - 254, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 76 times Red Star]

22. Rosario Gennaro,  Yehuda Lindell,  A Framework for Password-Based Authenticated Key Exchange, pp. 524 - 543, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 130 times Red StarRed Star]

23. Ran Canetti,  Eyal Kushilevitz,  Yehuda Lindell,  On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions, pp. 68 - 86, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 104 times Red StarRed Star]

24. Boaz Barak,  Yehuda Lindell,  Salil P. Vadhan,  Lower Bounds for Non-Black-Box Zero Knowledge, pp. 384 - 393, FOCS 2003.

[Electronic Edition][Cited 42 times ]

25. Yehuda Lindell,  General Composition and Universal Composability in Secure Multi-Party Computation, pp. 394 - 403, FOCS 2003.

[Electronic Edition][Cited 70 times Red Star]

26. Yehuda Lindell,  Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation, pp. 171 - 189, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 100 times Red StarRed Star]

27. Oded Goldreich,  Yehuda Lindell,  Session-Key Generation Using Human Passwords Only, pp. 408 - 432, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 154 times Red StarRed Star]

28. Yehuda Lindell,  Benny Pinkas,  Privacy Preserving Data Mining, pp. 36 - 54, CRYPTO 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 1514 times Red StarRed StarRed StarRed StarRed Star]



Database status:
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals
Highly Cited...