| 2012 |
| 41 | Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. Yehuda Lindell, Benny Pinkas. J. Cryptology (25): 680-722 (2012). Web SearchBibTeXDownload |
| 2011 |
| 40 | The IPS Compiler: Optimizations, Variants and Concrete Efficiency. Yehuda Lindell, Eli Oxman, Benny Pinkas. CRYPTO 2011, 259-276. Web SearchBibTeXDownload |
| 39 | Secure Computation on the Web: Computing without Simultaneous Interaction. Shai Halevi, Yehuda Lindell, Benny Pinkas. CRYPTO 2011, 132-150. Web SearchBibTeXDownload |
| 38 | Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. Yehuda Lindell, Benny Pinkas. TCC 2011, 329-346. Web SearchBibTeXDownload |
| 2010 |
| 37 | Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. Yehuda Lindell, Benny Pinkas. IACR Cryptology ePrint Archive (2010): 284 (2010). Web SearchBibTeXDownload |
| 36 | Efficient trace and revoke schemes. Moni Naor, Benny Pinkas. Int. J. Inf. Sec. (9): 411-424 (2010). Web SearchBibTeXDownload |
| 35 | Secure Computation of the Median (and Other Elements of Specified Ranks). Gagan Aggarwal, Nina Mishra, Benny Pinkas. J. Cryptology (23): 373-401 (2010). Web SearchBibTeXDownload |
| 34 | Peer-to-peer secure multi-party numerical computation facing malicious adversaries. Danny Bickson, Tzachy Reinman, Danny Dolev, Benny Pinkas. Peer-to-Peer Networking and Applications (3): 129-144 (2010). Web SearchBibTeXDownload |
| 2009 |
| 33 | Peer-to-Peer Secure Multi-Party Numerical Computation Facing Malicious Adversaries. Danny Bickson, Tzachy Reinman, Danny Dolev, Benny Pinkas. CoRR (abs/0901.2689) (2009). Web SearchBibTeXDownload |
| 32 | A Proof of Security of Yao's Protocol for Two-Party Computation. Yehuda Lindell, Benny Pinkas. J. Cryptology (22): 161-188 (2009). Cited by 7Web SearchBibTeXDownload |
| 31 | Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum. Theory Comput. Syst. (44): 245-268 (2009). Cited by 1Web SearchBibTeXDownload |
| 2008 |
| 30 | FairplayMP: a system for secure multi-party computation. Assaf Ben-David, Noam Nisan, Benny Pinkas. ACM Conference on Computer and Communications Security 2008, 257-266. Web SearchBibTeXDownload |
| 29 | Peer-to-Peer Secure Multi-Party Numerical Computation. Danny Bickson, Genia Bezman, Danny Dolev, Benny Pinkas. CoRR (abs/0810.1624) (2008). Web SearchBibTeXDownload |
| 28 | Secure Multiparty Computation for Privacy-Preserving Data Mining. Yehuda Lindell, Benny Pinkas. IACR Cryptology ePrint Archive (2008): 197 (2008). Web SearchBibTeXDownload |
| 27 | An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. Yehuda Lindell, Benny Pinkas. IACR Cryptology ePrint Archive (2008): 49 (2008). Cited by 42Web SearchBibTeXDownload |
| 26 | Peer-to-Peer Secure Multi-party Numerical Computation. Danny Bickson, Danny Dolev, Genia Bezman, Benny Pinkas. Peer-to-Peer Computing 2008, 257-266. Cited by 13Web SearchBibTeXDownload |
| 25 | Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. Yehuda Lindell, Benny Pinkas, Nigel P. Smart. SCN 2008, 2-20. Cited by 14Web SearchBibTeXDownload |
| 2007 |
| 24 | An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. Yehuda Lindell, Benny Pinkas. EUROCRYPT 2007, 52-78. Cited by 42Web SearchBibTeXDownload |
| 23 | Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum. FUN 2007, 166-182. Cited by 1Web SearchBibTeXDownload |
| 2006 |
| 22 | Oblivious Polynomial Evaluation. Moni Naor, Benny Pinkas, Dengguo Feng, Bao Li. SIAM J. Comput. (35): 1254-1281 (2006). Cited by 25Web SearchBibTeXDownload |
| 2005 |
| 21 | Computationally Secure Oblivious Transfer. Moni Naor, Benny Pinkas. J. Cryptology (18): 1-35 (2005). Cited by 33Web SearchBibTeXDownload |
| 2004 |
| 20 | A Proof of Yao's Protocol for Secure Two-Party Computation. Yehuda Lindell, Benny Pinkas. Electronic Colloquium on Computational Complexity (ECCC) 2004. Cited by 54Web SearchBibTeXDownload |
| 19 | Secure Computation of the k th-Ranked Element. Gagan Aggarwal, Nina Mishra, Benny Pinkas. EUROCRYPT 2004, 40-55. Cited by 85Web SearchBibTeXDownload |
| 18 | Efficient Private Matching and Set Intersection. Michael J. Freedman, Kobbi Nissim, Benny Pinkas. EUROCRYPT 2004, 1-19. Cited by 250Web SearchBibTeXDownload |
| 2003 |
| 17 | The Design and Implementation of Protocol-Based Hidden Key Recovery. Eu-Jin Goh, Dan Boneh, Benny Pinkas, Philippe Golle. ISC 2003, 165-179. Cited by 8Web SearchBibTeXDownload |
| 2002 |
| 16 | Privacy Preserving Data Mining. Yehuda Lindell, Benny Pinkas, Christopher W. Clifton. J. Cryptology (15): 177-206 (2002). Cited by 615Web SearchBibTeXDownload |
| 2001 |
| 15 | Efficient oblivious transfer protocols. Moni Naor, Benny Pinkas. SODA 2001, 448-457. Cited by 243Web SearchBibTeXDownload |
| 2000 |
| 14 | Distributed Oblivious Transfer. Moni Naor, Benny Pinkas. ASIACRYPT 2000, 205-219. Cited by 52Web SearchBibTeXDownload |
| 13 | Privacy Preserving Data Mining. Yehuda Lindell, Benny Pinkas, Christopher W. Clifton. CRYPTO 2000, 36-54. Cited by 615Web SearchBibTeXDownload |
| 12 | Efficient Trace and Revoke Schemes. Moni Naor, Benny Pinkas. Financial Cryptography 2000, 1-20. Web SearchBibTeXDownload |
| 11 | Tracing traitors. Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas. IEEE Transactions on Information Theory (46): 893-910 (2000). Cited by 493Web SearchBibTeXDownload |
| 1999 |
| 10 | Privacy preserving auctions and mechanism design. Moni Naor, Benny Pinkas, Reuban Sumner. ACM Conference on Electronic Commerce 1999, 129-139. Cited by 293Web SearchBibTeXDownload |
| 9 | On the Security of Pay-per-Click and Other Web Advertising Schemes. Vinod Anupam, Alain J. Mayer, Kobbi Nissim, Benny Pinkas, Michael K. Reiter. Computer Networks (31): 1091-1100 (1999). Cited by 52Web SearchBibTeXDownload |
| 8 | Oblivious Transfer with Adaptive Queries. Moni Naor, Benny Pinkas. CRYPTO 1999, 573-590. Cited by 63Web SearchBibTeXDownload |
| 7 | Distributed Pseudo-random Functions and KDCs. Moni Naor, Benny Pinkas, Omer Reingold. EUROCRYPT 1999, 327-346. Cited by 77Web SearchBibTeXDownload |
| 6 | Multicast Security: A Taxonomy and Some Efficient Constructions. Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas. INFOCOM 1999, 708-716. Cited by 622Web SearchBibTeX |
| 5 | Oblivious Transfer and Polynomial Evaluation. Moni Naor, Benny Pinkas. STOC 1999, 245-254. Cited by 342Web SearchBibTeXDownload |
| 1998 |
| 4 | Secure Accounting and Auditing on the Web. Moni Naor, Benny Pinkas. Computer Networks (30): 541-550 (1998). Cited by 22Web SearchBibTeXDownload |
| 3 | Threshold Traitor Tracing. Moni Naor, Benny Pinkas. CRYPTO 1998, 502-517. Cited by 98Web SearchBibTeXDownload |
| 2 | Secure and Efficient Metering. Moni Naor, Benny Pinkas. EUROCRYPT 1998, 576-590. Cited by 80Web SearchBibTeXDownload |
| 1997 |
| 1 | Visual Authentication and Identification. Moni Naor, Benny Pinkas. CRYPTO 1997, 322-336. Cited by 140Web SearchBibTeXDownload |