| 2013 | ||
|---|---|---|
| j17 | Ayman Jarrous, Benny Pinkas: Secure computation of functionalities based on Hamming distance and its application to computing document similarity. IJACT 3(1): 21-46 (2013) | |
| 2012 | ||
| j16 | Yehuda Lindell, Benny Pinkas: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. J. Cryptology 25(4): 680-722 (2012) | |
| 2011 | ||
| c40 | Shai Halevi, Danny Harnik, Benny Pinkas, Alexandra Shulman-Peleg: Proofs of ownership in remote storage systems. ACM Conference on Computer and Communications Security 2011: 491-500 | |
| c39 | Shai Halevi, Yehuda Lindell, Benny Pinkas: Secure Computation on the Web: Computing without Simultaneous Interaction. CRYPTO 2011: 132-150 | |
| c38 | Yehuda Lindell, Eli Oxman, Benny Pinkas: The IPS Compiler: Optimizations, Variants and Concrete Efficiency. CRYPTO 2011: 259-276 | |
| c37 | Marc Fischlin, Benny Pinkas, Ahmad-Reza Sadeghi, Thomas Schneider, Ivan Visconti: Secure Set Intersection with Untrusted Hardware Tokens. CT-RSA 2011: 1-16 | |
| c36 | Yehuda Lindell, Benny Pinkas: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. TCC 2011: 329-346 | |
| r2 | ||
| i15 | Benny Pinkas, Ahmad-Reza Sadeghi, Nigel P. Smart: Secure Computing in the Cloud (Dagstuhl Seminar 11491). Dagstuhl Reports 1(12): 1-10 (2011) | |
| i14 | Shai Halevi, Yehuda Lindell, Benny Pinkas: Secure Computation on the Web: Computing without Simultaneous Interaction. IACR Cryptology ePrint Archive 2011: 157 (2011) | |
| i13 | Shai Halevi, Danny Harnik, Benny Pinkas, Alexandra Shulman-Peleg: Proofs of Ownership in Remote Storage Systems. IACR Cryptology ePrint Archive 2011: 207 (2011) | |
| i12 | Yehuda Lindell, Benny Pinkas, Eli Oxman: The IPS Compiler: Optimizations, Variants and Concrete Efficiency. IACR Cryptology ePrint Archive 2011: 435 (2011) | |
| 2010 | ||
| j15 | Danny Harnik, Benny Pinkas, Alexandra Shulman-Peleg: Side Channels in Cloud Services: Deduplication in Cloud Storage. IEEE Security & Privacy 8(6): 40-47 (2010) | |
| j14 | ||
| j13 | Gagan Aggarwal, Nina Mishra, Benny Pinkas: Secure Computation of the Median (and Other Elements of Specified Ranks). J. Cryptology 23(3): 373-401 (2010) | |
| j12 | Danny Bickson, Tzachy Reinman, Danny Dolev, Benny Pinkas: Peer-to-peer secure multi-party numerical computation facing malicious adversaries. Peer-to-Peer Networking and Applications 3(2): 129-144 (2010) | |
| c35 | Mark Manulis, Benny Pinkas, Bertram Poettering: Privacy-Preserving Group Discovery with Linear Complexity. ACNS 2010: 420-437 | |
| c34 | ||
| c33 | Margarita Osadchy, Benny Pinkas, Ayman Jarrous, Boaz Moskovich: SCiFI - A System for Secure Face Identification. IEEE Symposium on Security and Privacy 2010: 239-254 | |
| i11 | Yehuda Lindell, Benny Pinkas: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. IACR Cryptology ePrint Archive 2010: 284 (2010) | |
| i10 | Benny Pinkas, Tzachy Reinman: Oblivious RAM Revisited. IACR Cryptology ePrint Archive 2010: 366 (2010) | |
| 2009 | ||
| j11 | Yehuda Lindell, Benny Pinkas: A Proof of Security of Yao's Protocol for Two-Party Computation. J. Cryptology 22(2): 161-188 (2009) | |
| j10 | Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum: Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. Theory Comput. Syst. 44(2): 245-268 (2009) | |
| j9 | Leo Dorrendorf, Zvi Gutterman, Benny Pinkas: Cryptanalysis of the random number generator of the Windows operating system. ACM Trans. Inf. Syst. Secur. 13(1) (2009) | |
| c32 | Ayman Jarrous, Benny Pinkas: Secure Hamming Distance Based Computation and Its Applications. ACNS 2009: 107-124 | |
| c31 | Benny Pinkas, Thomas Schneider, Nigel P. Smart, Stephen C. Williams: Secure Two-Party Computation Is Practical. ASIACRYPT 2009: 250-267 | |
| i9 | Danny Bickson, Tzachy Reinman, Danny Dolev, Benny Pinkas: Peer-to-Peer Secure Multi-Party Numerical Computation Facing Malicious Adversaries. CoRR abs/0901.2689 (2009) | |
| i8 | Benny Pinkas, Thomas Schneider, Nigel P. Smart, Stephen C. Williams: Secure Two-Party Computation is Practical. IACR Cryptology ePrint Archive 2009: 314 (2009) | |
| 2008 | ||
| c30 | Assaf Ben-David, Noam Nisan, Benny Pinkas: FairplayMP: a system for secure multi-party computation. ACM Conference on Computer and Communications Security 2008: 257-266 | |
| c29 | Danny Bickson, Danny Dolev, Genia Bezman, Benny Pinkas: Peer-to-Peer Secure Multi-party Numerical Computation. Peer-to-Peer Computing 2008: 257-266 | |
| c28 | Yehuda Lindell, Benny Pinkas, Nigel P. Smart: Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. SCN 2008: 2-20 | |
| i7 | Danny Bickson, Genia Bezman, Danny Dolev, Benny Pinkas: Peer-to-Peer Secure Multi-Party Numerical Computation. CoRR abs/0810.1624 (2008) | |
| i6 | Yehuda Lindell, Benny Pinkas: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. IACR Cryptology ePrint Archive 2008: 49 (2008) | |
| i5 | Yehuda Lindell, Benny Pinkas: Secure Multiparty Computation for Privacy-Preserving Data Mining. IACR Cryptology ePrint Archive 2008: 197 (2008) | |
| 2007 | ||
| c27 | Leo Dorrendorf, Zvi Gutterman, Benny Pinkas: Cryptanalysis of the windows random number generator. ACM Conference on Computer and Communications Security 2007: 476-485 | |
| c26 | Yehuda Lindell, Benny Pinkas: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. EUROCRYPT 2007: 52-78 | |
| c25 | Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum: Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. FUN 2007: 166-182 | |
| i4 | Leo Dorrendorf, Zvi Gutterman, Benny Pinkas: Cryptanalysis of the Random Number Generator of the Windows Operating System. IACR Cryptology ePrint Archive 2007: 419 (2007) | |
| 2006 | ||
| j8 | ||
| c24 | Zvi Gutterman, Benny Pinkas, Tzachy Reinman: Analysis of the Linux Random Number Generator. IEEE Symposium on Security and Privacy 2006: 371-385 | |
| i3 | Zvi Gutterman, Benny Pinkas, Tzachy Reinman: Analysis of the Linux Random Number Generator. IACR Cryptology ePrint Archive 2006: 86 (2006) | |
| 2005 | ||
| j7 | Moni Naor, Benny Pinkas: Computationally Secure Oblivious Transfer. J. Cryptology 18(1): 1-35 (2005) | |
| c23 | Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold: Keyword Search and Oblivious Pseudorandom Functions. TCC 2005: 303-324 | |
| r1 | ||
| 2004 | ||
| j6 | Benny Pinkas: Efficient State Updates for Key Management. Proceedings of the IEEE 92(6): 910-917 (2004) | |
| c22 | Michael J. Freedman, Kobbi Nissim, Benny Pinkas: Efficient Private Matching and Set Intersection. EUROCRYPT 2004: 1-19 | |
| c21 | Gagan Aggarwal, Nina Mishra, Benny Pinkas: Secure Computation of the k th-Ranked Element. EUROCRYPT 2004: 40-55 | |
| c20 | Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella: Fairplay - Secure Two-Party Computation System. USENIX Security Symposium 2004: 287-302 | |
| i2 | Yehuda Lindell, Benny Pinkas: A Proof of Yao's Protocol for Secure Two-Party Computation. Electronic Colloquium on Computational Complexity (ECCC)(063) (2004) | |
| i1 | Yehuda Lindell, Benny Pinkas: A Proof of Yao's Protocol for Secure Two-Party Computation. IACR Cryptology ePrint Archive 2004: 175 (2004) | |
| 2003 | ||
| c19 | ||
| c18 | Eu-Jin Goh, Dan Boneh, Benny Pinkas, Philippe Golle: The Design and Implementation of Protocol-Based Hidden Key Recovery. ISC 2003: 165-179 | |
| 2002 | ||
| j5 | ||
| j4 | Benny Pinkas: Cryptographic Techniques for Privacy-Preserving Data Mining. SIGKDD Explorations 4(2): 12-19 (2002) | |
| c17 | Benny Pinkas, Tomas Sander: Securing passwords against dictionary attacks. ACM Conference on Computer and Communications Security 2002: 161-170 | |
| 2001 | ||
| c16 | Benny Pinkas: Efficient State Updates for Key Management. Digital Rights Management Workshop 2001: 40-56 | |
| c15 | Stuart Haber, Benny Pinkas: Securely combining public-key cryptosystems. ACM Conference on Computer and Communications Security 2001: 215-224 | |
| c14 | Bill G. Horne, Benny Pinkas, Tomas Sander: Escrow services and incentives in peer-to-peer networks. ACM Conference on Electronic Commerce 2001: 85-94 | |
| c13 | ||
| 2000 | ||
| j3 | Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas: Tracing traitors. IEEE Transactions on Information Theory 46(3): 893-910 (2000) | |
| c12 | ||
| c11 | ||
| c10 | ||
| 1999 | ||
| j2 | Vinod Anupam, Alain J. Mayer, Kobbi Nissim, Benny Pinkas, Michael K. Reiter: On the Security of Pay-per-Click and Other Web Advertising Schemes. Computer Networks 31(11-16): 1091-1100 (1999) | |
| c9 | ||
| c8 | Moni Naor, Benny Pinkas, Omer Reingold: Distributed Pseudo-random Functions and KDCs. EUROCRYPT 1999: 327-346 | |
| c7 | Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas: Multicast Security: A Taxonomy and Some Efficient Constructions. INFOCOM 1999: 708-716 | |
| c6 | Moni Naor, Benny Pinkas, Reuban Sumner: Privacy preserving auctions and mechanism design. ACM Conference on Electronic Commerce 1999: 129-139 | |
| c5 | ||
| 1998 | ||
| j1 | Moni Naor, Benny Pinkas: Secure Accounting and Auditing on the Web. Computer Networks 30(1-7): 541-550 (1998) | |
| c4 | ||
| c3 | ||
| 1997 | ||
| c2 | ||
| 1990 | ||
| c1 | James L. McInnes, Benny Pinkas: On the Impossibility of Private Key Cryptography with Weakly Random Keys. CRYPTO 1990: 421-435 | |
Colors in the list of coauthors
Last update Thu May 23 14:18:15 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page