The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Benny Pinkas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Moni Naor, Benny Pinkas
    Distributed Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2000, pp:205-219 [Conf]
  2. Stuart Haber, Benny Pinkas
    Securely combining public-key cryptosystems. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2001, pp:215-224 [Conf]
  3. Benny Pinkas
    Efficient State Updates for Key Management. [Citation Graph (0, 0)][DBLP]
    Digital Rights Management Workshop, 2001, pp:40-56 [Conf]
  4. Benny Pinkas, Tomas Sander
    Securing passwords against dictionary attacks. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2002, pp:161-170 [Conf]
  5. Yehuda Lindell, Benny Pinkas
    Privacy Preserving Data Mining. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:36-54 [Conf]
  6. Moni Naor, Benny Pinkas
    Visual Authentication and Identification. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:322-336 [Conf]
  7. Moni Naor, Benny Pinkas
    Threshold Traitor Tracing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1998, pp:502-517 [Conf]
  8. Moni Naor, Benny Pinkas
    Oblivious Transfer with Adaptive Queries. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:573-590 [Conf]
  9. James L. McInnes, Benny Pinkas
    On the Impossibility of Private Key Cryptography with Weakly Random Keys. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:421-435 [Conf]
  10. Gagan Aggarwal, Nina Mishra, Benny Pinkas
    Secure Computation of the k th-Ranked Element. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:40-55 [Conf]
  11. Michael J. Freedman, Kobbi Nissim, Benny Pinkas
    Efficient Private Matching and Set Intersection. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:1-19 [Conf]
  12. Moni Naor, Benny Pinkas
    Secure and Efficient Metering. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1998, pp:576-590 [Conf]
  13. Moni Naor, Benny Pinkas, Omer Reingold
    Distributed Pseudo-random Functions and KDCs. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1999, pp:327-346 [Conf]
  14. Benny Pinkas
    Fair Secure Two-Party Computation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:87-105 [Conf]
  15. Moni Naor, Benny Pinkas
    Efficient Trace and Revoke Schemes. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2000, pp:1-20 [Conf]
  16. Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas
    Multicast Security: A Taxonomy and Some Efficient Constructions. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:708-716 [Conf]
  17. Eu-Jin Goh, Dan Boneh, Benny Pinkas, Philippe Golle
    The Design and Implementation of Protocol-Based Hidden Key Recovery. [Citation Graph (0, 0)][DBLP]
    ISC, 2003, pp:165-179 [Conf]
  18. Bill G. Horne, Benny Pinkas, Tomas Sander
    Escrow services and incentives in peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2001, pp:85-94 [Conf]
  19. Moni Naor, Benny Pinkas, Reuban Sumner
    Privacy preserving auctions and mechanism design. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 1999, pp:129-139 [Conf]
  20. Moni Naor, Benny Pinkas
    Efficient oblivious transfer protocols. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:448-457 [Conf]
  21. Zvi Gutterman, Benny Pinkas, Tzachy Reinman
    Analysis of the Linux Random Number Generator. [Citation Graph (0, 0)][DBLP]
    S&P, 2006, pp:371-385 [Conf]
  22. Moni Naor, Benny Pinkas
    Oblivious Transfer and Polynomial Evaluation. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:245-254 [Conf]
  23. Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold
    Keyword Search and Oblivious Pseudorandom Functions. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:303-324 [Conf]
  24. Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella
    Fairplay - Secure Two-Party Computation System. [Citation Graph (0, 0)][DBLP]
    USENIX Security Symposium, 2004, pp:287-302 [Conf]
  25. Vinod Anupam, Alain J. Mayer, Kobbi Nissim, Benny Pinkas, Michael K. Reiter
    On the Security of Pay-per-Click and Other Web Advertising Schemes. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 1999, v:31, n:11-16, pp:1091-1100 [Journal]
  26. Moni Naor, Benny Pinkas
    Secure Accounting and Auditing on the Web. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 1998, v:30, n:1-7, pp:541-550 [Journal]
  27. Yehuda Lindell, Benny Pinkas
    A Proof of Yao's Protocol for Secure Two-Party Computation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:063, pp:- [Journal]
  28. Yehuda Lindell, Benny Pinkas
    Privacy Preserving Data Mining. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2002, v:15, n:3, pp:177-206 [Journal]
  29. Moni Naor, Benny Pinkas
    Computationally Secure Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2005, v:18, n:1, pp:1-35 [Journal]
  30. Benny Pinkas
    Efficient State Updates for Key Management. [Citation Graph (0, 0)][DBLP]
    Proceedings of the IEEE, 2004, v:92, n:6, pp:910-917 [Journal]
  31. Moni Naor, Benny Pinkas
    Oblivious Polynomial Evaluation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1254-1281 [Journal]
  32. Benny Pinkas
    Cryptographic Techniques for Privacy-Preserving Data Mining. [Citation Graph (0, 0)][DBLP]
    SIGKDD Explorations, 2002, v:4, n:2, pp:12-19 [Journal]
  33. Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas
    Tracing traitors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:893-910 [Journal]
  34. Yehuda Lindell, Benny Pinkas
    An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:52-78 [Conf]
  35. Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
    Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:166-182 [Conf]

  36. Secure Hamming Distance Based Computation and Its Applications. [Citation Graph (, )][DBLP]


  37. Privacy-Preserving Group Discovery with Linear Complexity. [Citation Graph (, )][DBLP]


  38. Secure Two-Party Computation Is Practical. [Citation Graph (, )][DBLP]


  39. Cryptanalysis of the windows random number generator. [Citation Graph (, )][DBLP]


  40. FairplayMP: a system for secure multi-party computation. [Citation Graph (, )][DBLP]


  41. Oblivious RAM Revisited. [Citation Graph (, )][DBLP]


  42. Peer-to-Peer Secure Multi-party Numerical Computation. [Citation Graph (, )][DBLP]


  43. Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. [Citation Graph (, )][DBLP]


  44. SCiFI - A System for Secure Face Identification. [Citation Graph (, )][DBLP]


  45. Peer-to-Peer Secure Multi-Party Numerical Computation [Citation Graph (, )][DBLP]


  46. Peer-to-Peer Secure Multi-Party Numerical Computation Facing Malicious Adversaries [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.043secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002