- A Probabilistic-Time Hierarchy Theorem for \Slightly Non-Uniform" Algorithms
- How To Play Almost Any Mental Game Over The Net --Concurrent Composition via Super-Polynomial Simulation
- A M SL A T E X Version 1.0 User's Guide
- Extracting Randomness Using Few Independent Sources Russell Impagliazzo
- LATEX Template for Writing Papers April 8, 2003
- Concurrent Non-Malleable Zero Knowledge Manoj Prabhakaran
- How to Go Beyond the Black-Box Simulation Barrier Boaz Barak
- An extended abstract of this report appeared in the proceedings of the 19th ACM Symposium on Principles of Distributed Computing (PODC 2000), July 2000. Updated versions of this report can
- Computational Analogues of Entropy Ronen Shaltiel
- Extracting Randomness Using Few Independent Sources Boaz Barak # Russell Impagliazzo + Avi Wigderson #
- Subsampling Mathematical Relaxations and Average-case Complexity
- A model and Architecture for Pseudo-Random Generation and Applications to /dev/random
- Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors
- Computational Complexity: A Modern Approach
- Mathematical Methods in Computer Science: Gil Kalai & Avi Wigderson
- Path-Quality Monitoring in the Presence of Adversaries This is the full version from March 27, 2008
- Lower Bounds on Signatures From Symmetric Primitives Mohammad Mahmoody-Ghidary
- ResettablySound ZeroKnowledge and its Applications (preliminary version)
- True Random Number Generators Secure in a Changing Environment
- L A T E X Template for Writing Papers April 8, 2003
- Universal Arguments and their Applications Department of Computer Science
- 7KH#3URDFWLYH#6HFXULW\#7RRONLW#DQG#$SSOLFDWLRQV Boaz Barak, Amir Herzberg, Dalit Naor and Eldad Shai
- Derandomization in Cryptography Boaz Barak #
- Lower Bounds for Non-Black-Box Zero Knowledge Yehuda Lindell
- Non-Black-Box Techniques In Crytpography Thesis for the Ph.D degree
- Universally Composable Protocols with Relaxed Setup Assumptions Boaz Barak
- On the Possibility of OneMessage Weak ZeroKnowledge
- A model and Architecture for PseudoRandom Generation and Applications to /dev/random
- Computational Analogues of Entropy Boaz Barak # Ronen Shaltiel + Avi Wigderson #
- Protocols and Lower Bounds for Failure Localization in the Internet
- Delegateable Signatures Boaz Barak #
- ConstantRound CoinTossing With a Man in the Middle Realizing the Shared Random String Model
- True Random Number Generators Secure in a Changing Environment
- How To Play Almost Any Mental Game Over The Net ---Concurrent Composition via SuperPolynomial Simulation
- Non-Black-Box Techniques in Cryptography
- Subexponential Algorithms for Unique Games and Related Sanjeev Arora
- Merkle Puzzles are Optimal --)-query attack on key exchange from a random oracle
- Privacy, Accuracy, and Consistency Too: A Holistic Solution to Contingency Table Release
- NonBlackBox Techniques In Crytpography Thesis for the Ph.D degree
- Universally Composable Protocols with Relaxed Set-up Assumptions Inst. for Advanced Study
- The Uniform Hardcore Lemma via Approximate Bregman Projections
- Bounded Key-Dependent Message Security Iftach Haitner
- On the (Im)possibility of Obfuscating Programs # Boaz Barak + Oded Goldreich + Russell Impagliazzo # Steven Rudich
- Public-Key Cryptography from Different Assumptions Benny Applebaum
- 2Source Dispersers for n o(1) Entropy, and Ramsey Graphs Beating the FranklWilson Construction
- Constant-Round Coin-Tossing With a Man in the Middle Realizing the Shared Random String Model
- On the Possibility of One-Message Weak Zero-Knowledge
- Mathematical Methods in Computer Science: Gil Kalai & Avi Wigderson
- Derandomization in Cryptography Princeton University
- Lower Bounds for NonBlackBox Zero Knowledge # Boaz Barak + Yehuda Lindell # Salil Vadhan
- Computational Complexity and Information Asymmetry in Financial Products
- LATEX Template for Writing Papers Boaz Barak
- LATEX Template for Writing Papers Boaz Barak
- Tight lower bounds for 2-query LCCs over finite fields Arnab Bhattacharyya