The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Boaz Barak: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Boaz Barak, Shai Halevi
    A model and architecture for pseudo-random generation with applications to /dev/random. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2005, pp:203-212 [Conf]
  2. Boaz Barak, Amir Herzberg, Dalit Naor, Eldad Shai
    The Proactive Security Toolkit and Applications. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 1999, pp:18-27 [Conf]
  3. Boaz Barak, Ronen Shaltiel, Eran Tromer
    True Random Number Generators Secure in a Changing Environment. [Citation Graph (0, 0)][DBLP]
    CHES, 2003, pp:166-180 [Conf]
  4. Boaz Barak, Oded Goldreich
    Universal Arguments and their Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:194-203 [Conf]
  5. Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin
    Secure Computation Without Authentication. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2005, pp:361-377 [Conf]
  6. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:1-18 [Conf]
  7. Boaz Barak, Shien Jin Ong, Salil P. Vadhan
    Derandomization in Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:299-315 [Conf]
  8. Boaz Barak
    Non-black-box Techniques in Cryptography. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:1- [Conf]
  9. Boaz Barak
    How to Go Beyond the Black-Box Simulation Barrier. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:106-115 [Conf]
  10. Boaz Barak
    Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:345-355 [Conf]
  11. Boaz Barak, Amit Sahai
    How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:543-552 [Conf]
  12. Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass
    Universally Composable Protocols with Relaxed Set-Up Assumptions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:186-195 [Conf]
  13. Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell
    Resettably-Sound Zero-Knowledge and its Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:116-125 [Conf]
  14. Boaz Barak, Russell Impagliazzo, Avi Wigderson
    Extracting Randomness Using Few Independent Sources. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:384-393 [Conf]
  15. Boaz Barak, Yehuda Lindell, Salil P. Vadhan
    Lower Bounds for Non-Black-Box Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:384-393 [Conf]
  16. Boaz Barak, Manoj Prabhakaran, Amit Sahai
    Concurrent Non-Malleable Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:345-354 [Conf]
  17. Boaz Barak, Shai Halevi, Amir Herzberg, Dalit Naor
    Clock synchronization with faults and recoveries (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:133-142 [Conf]
  18. Boaz Barak
    A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:194-208 [Conf]
  19. Boaz Barak, Ronen Shaltiel, Avi Wigderson
    Computational Analogues of Entropy. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:200-215 [Conf]
  20. Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
    Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:1-10 [Conf]
  21. Boaz Barak, Yehuda Lindell
    Strict polynomial-time in simulation and extraction. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:484-493 [Conf]
  22. Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson
    2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:671-680 [Conf]
  23. Boaz Barak, Rafael Pass
    On the Possibility of One-Message Weak Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:121-132 [Conf]
  24. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:057, pp:- [Journal]
  25. Boaz Barak, Oded Goldreich
    Universal Arguments and their Applications [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:093, pp:- [Journal]
  26. Boaz Barak, Yehuda Lindell
    Strict Polynomial-time in Simulation and Extraction [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:026, pp:- [Journal]
  27. Boaz Barak, Yehuda Lindell, Salil P. Vadhan
    Lower Bounds for Non-Black-Box Zero Knowledge [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:083, pp:- [Journal]
  28. Boaz Barak, Amit Sahai
    How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:096, pp:- [Journal]
  29. Boaz Barak, Shien Jin Ong, Salil P. Vadhan
    Derandomization in Cryptography [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:114, pp:- [Journal]
  30. Boaz Barak, Yehuda Lindell, Salil P. Vadhan
    Lower bounds for non-black-box zero knowledge. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:2, pp:321-391 [Journal]
  31. Boaz Barak, Yehuda Lindell
    Strict Polynomial-Time in Simulation and Extraction. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:4, pp:738-818 [Journal]
  32. Boaz Barak, Russell Impagliazzo, Avi Wigderson
    Extracting Randomness Using Few Independent Sources. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:1095-1118 [Journal]
  33. Boaz Barak, Shien Jin Ong, Salil P. Vadhan
    Derandomization in Cryptography. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:380-400 [Journal]
  34. Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar
    Privacy, accuracy, and consistency too: a holistic solution to contingency table release. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:273-282 [Conf]

  35. Strong Parallel Repetition Theorem for Free Projection Games. [Citation Graph (, )][DBLP]


  36. Merkle Puzzles Are Optimal - An O(n2)-Query Attack on Any Key Exchange from a Random Oracle. [Citation Graph (, )][DBLP]


  37. Protocols and Lower Bounds for Failure Localization in the Internet. [Citation Graph (, )][DBLP]


  38. Bounded Key-Dependent Message Security. [Citation Graph (, )][DBLP]


  39. Lower Bounds on Signatures From Symmetric Primitives. [Citation Graph (, )][DBLP]


  40. On Basing Lower-Bounds for Learning on Worst-Case Assumptions. [Citation Graph (, )][DBLP]


  41. Rounding Parallel Repetitions of Unique Games. [Citation Graph (, )][DBLP]


  42. Path-quality monitoring in the presence of adversaries. [Citation Graph (, )][DBLP]


  43. The uniform hardcore lemma via approximate Bregman projections. [Citation Graph (, )][DBLP]


  44. Public-key cryptography from different assumptions. [Citation Graph (, )][DBLP]


  45. How to compress interactive communication. [Citation Graph (, )][DBLP]


  46. Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract). [Citation Graph (, )][DBLP]


  47. Merkle Puzzles are Optimal [Citation Graph (, )][DBLP]


  48. Lower Bounds on Signatures from Symmetric Primitives [Citation Graph (, )][DBLP]


  49. Subsampling Semidefinite Programs and Max-Cut on the Sphere [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.302secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002