| 2009 |
|---|
| 43 | EE | Danny Bickson,
Tzachy Reinman,
Danny Dolev,
Benny Pinkas:
Peer-to-Peer Secure Multi-Party Numerical Computation Facing Malicious Adversaries
CoRR abs/0901.2689: (2009) |
| 42 | EE | Yehuda Lindell,
Benny Pinkas:
A Proof of Security of Yao's Protocol for Two-Party Computation.
J. Cryptology 22(2): 161-188 (2009) |
| 2008 |
|---|
| 41 | EE | 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 |
| 40 | EE | Danny Bickson,
Danny Dolev,
Genia Bezman,
Benny Pinkas:
Peer-to-Peer Secure Multi-party Numerical Computation.
Peer-to-Peer Computing 2008: 257-266 |
| 39 | EE | Yehuda Lindell,
Benny Pinkas,
Nigel P. Smart:
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries.
SCN 2008: 2-20 |
| 38 | EE | Danny Bickson,
Genia Bezman,
Danny Dolev,
Benny Pinkas:
Peer-to-Peer Secure Multi-Party Numerical Computation
CoRR abs/0810.1624: (2008) |
| 2007 |
|---|
| 37 | EE | Leo Dorrendorf,
Zvi Gutterman,
Benny Pinkas:
Cryptanalysis of the windows random number generator.
ACM Conference on Computer and Communications Security 2007: 476-485 |
| 36 | EE | Yehuda Lindell,
Benny Pinkas:
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.
EUROCRYPT 2007: 52-78 |
| 35 | EE | 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 |
| 2006 |
|---|
| 34 | EE | Zvi Gutterman,
Benny Pinkas,
Tzachy Reinman:
Analysis of the Linux Random Number Generator.
IEEE Symposium on Security and Privacy 2006: 371-385 |
| 33 | EE | Moni Naor,
Benny Pinkas:
Oblivious Polynomial Evaluation.
SIAM J. Comput. 35(5): 1254-1281 (2006) |
| 2005 |
|---|
| 32 | EE | Michael J. Freedman,
Yuval Ishai,
Benny Pinkas,
Omer Reingold:
Keyword Search and Oblivious Pseudorandom Functions.
TCC 2005: 303-324 |
| 31 | EE | Benny Pinkas:
Traitor Tracing.
Encyclopedia of Cryptography and Security 2005 |
| 30 | EE | Moni Naor,
Benny Pinkas:
Computationally Secure Oblivious Transfer.
J. Cryptology 18(1): 1-35 (2005) |
| 2004 |
|---|
| 29 | EE | Michael J. Freedman,
Kobbi Nissim,
Benny Pinkas:
Efficient Private Matching and Set Intersection.
EUROCRYPT 2004: 1-19 |
| 28 | EE | Gagan Aggarwal,
Nina Mishra,
Benny Pinkas:
Secure Computation of the k th-Ranked Element.
EUROCRYPT 2004: 40-55 |
| 27 | EE | Dahlia Malkhi,
Noam Nisan,
Benny Pinkas,
Yaron Sella:
Fairplay - Secure Two-Party Computation System (Awarded Best Student Paper!).
USENIX Security Symposium 2004: 287-302 |
| 26 | EE | Yehuda Lindell,
Benny Pinkas:
A Proof of Yao's Protocol for Secure Two-Party Computation
Electronic Colloquium on Computational Complexity (ECCC)(063): (2004) |
| 25 | | Benny Pinkas:
Efficient State Updates for Key Management.
Proceedings of the IEEE 92(6): 910-917 (2004) |
| 2003 |
|---|
| 24 | EE | Benny Pinkas:
Fair Secure Two-Party Computation.
EUROCRYPT 2003: 87-105 |
| 23 | EE | Eu-Jin Goh,
Dan Boneh,
Benny Pinkas,
Philippe Golle:
The Design and Implementation of Protocol-Based Hidden Key Recovery.
ISC 2003: 165-179 |
| 2002 |
|---|
| 22 | EE | Benny Pinkas,
Tomas Sander:
Securing passwords against dictionary attacks.
ACM Conference on Computer and Communications Security 2002: 161-170 |
| 21 | EE | Yehuda Lindell,
Benny Pinkas:
Privacy Preserving Data Mining.
J. Cryptology 15(3): 177-206 (2002) |
| 20 | EE | Benny Pinkas:
Cryptographic Techniques for Privacy-Preserving Data Mining.
SIGKDD Explorations 4(2): 12-19 (2002) |
| 2001 |
|---|
| 19 | EE | Stuart Haber,
Benny Pinkas:
Securely combining public-key cryptosystems.
ACM Conference on Computer and Communications Security 2001: 215-224 |
| 18 | EE | Bill G. Horne,
Benny Pinkas,
Tomas Sander:
Escrow services and incentives in peer-to-peer networks.
ACM Conference on Electronic Commerce 2001: 85-94 |
| 17 | EE | Benny Pinkas:
Efficient State Updates for Key Management.
Digital Rights Management Workshop 2001: 40-56 |
| 16 | EE | Moni Naor,
Benny Pinkas:
Efficient oblivious transfer protocols.
SODA 2001: 448-457 |
| 2000 |
|---|
| 15 | EE | Moni Naor,
Benny Pinkas:
Distributed Oblivious Transfer.
ASIACRYPT 2000: 205-219 |
| 14 | EE | Yehuda Lindell,
Benny Pinkas:
Privacy Preserving Data Mining.
CRYPTO 2000: 36-54 |
| 13 | EE | Moni Naor,
Benny Pinkas:
Efficient Trace and Revoke Schemes.
Financial Cryptography 2000: 1-20 |
| 12 | | Benny Chor,
Amos Fiat,
Moni Naor,
Benny Pinkas:
Tracing traitors.
IEEE Transactions on Information Theory 46(3): 893-910 (2000) |
| 1999 |
|---|
| 11 | EE | Moni Naor,
Benny Pinkas,
Reuban Sumner:
Privacy preserving auctions and mechanism design.
ACM Conference on Electronic Commerce 1999: 129-139 |
| 10 | EE | Moni Naor,
Benny Pinkas:
Oblivious Transfer with Adaptive Queries.
CRYPTO 1999: 573-590 |
| 9 | EE | Moni Naor,
Benny Pinkas,
Omer Reingold:
Distributed Pseudo-random Functions and KDCs.
EUROCRYPT 1999: 327-346 |
| 8 | | 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 |
| 7 | EE | Moni Naor,
Benny Pinkas:
Oblivious Transfer and Polynomial Evaluation.
STOC 1999: 245-254 |
| 6 | EE | 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) |
| 1998 |
|---|
| 5 | EE | Moni Naor,
Benny Pinkas:
Threshold Traitor Tracing.
CRYPTO 1998: 502-517 |
| 4 | EE | Moni Naor,
Benny Pinkas:
Secure and Efficient Metering.
EUROCRYPT 1998: 576-590 |
| 3 | EE | Moni Naor,
Benny Pinkas:
Secure Accounting and Auditing on the Web.
Computer Networks 30(1-7): 541-550 (1998) |
| 1997 |
|---|
| 2 | EE | Moni Naor,
Benny Pinkas:
Visual Authentication and Identification.
CRYPTO 1997: 322-336 |
| 1990 |
|---|
| 1 | EE | James L. McInnes,
Benny Pinkas:
On the Impossibility of Private Key Cryptography with Weakly Random Keys.
CRYPTO 1990: 421-435 |
