Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Reingold, Omer - Department of Computer Science and Applied Mathematics, Weizmann Institute of Science
On the Power of the Randomized Iterate Iftach Haitner # Danny Harnik # Omer Reingold #+
On the Error Parameter of Dispersers Ronen Gradwohl # Guy Kindler + Omer Reingold # Amnon TaShma
Immunizing Encryption Schemes from Decryption Errors
Breaking Generalized DiffieHellman Modulo a Composite is no Easier than Factoring
Extracting Randomness via Repeated Condensing # Omer Reingold + Ronen Shaltiel # Avi Wigderson
Synthesizers and Their Application to the Parallel Construction of PseudoRandom Functions \Lambda
StatisticallyHiding Commitment from Any OneWay Function
E#cient Pseudorandom Generators from Exponentially Hard OneWay Functions
NumberTheoretic Constructions of Efficient PseudoRandom Functions \Lambda
A New Interactive Hashing Theorem Iftach Haitner
On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates
The Relationship between Public Key Encryption and Oblivious Transfer
Entropy Waves, The ZigZag Graph Product, and New ConstantDegree Expanders
Partial Exposure and Correlated Types in Large Games Working Draft, Comments are Welcome
On Recycling the Randomness of the States in Space Bounded Computation
Entropy Waves, the ZigZag Graph Product, and New ConstantDegree Expanders and Extractors
Notions of Reducibility between Cryptographic Primitives ?
Completeness in Two-Party Secure Computation -A Computational View
Perfectly OneWay Probabilistic Hash Functions (Preliminary Version)
Randomness Conductors and ConstantDegree Expansion Beyond the Degree / 2 Barrier
