( en | de | ru )

 

Disambiguation of "Goldreich, Oded"

Author of the publication

copydeleteadd this publication to your clipboard
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity.

, and . SIAM J. Comput., 17 (2): 230-261 (1988)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Oded Green

Oded Maron

Oded Löwenbein

Oded Friedmann

Oded Winter

 

Other publications of authors with the same name

The Minimum-Length Generator Sequence Problem is NP-Hard., and . J. Algorithms, 2 (3): 311-313 (1981)More Constructions of Lossy and Correlation-Secure Trapdoor Functions., , , , and . IACR Cryptology ePrint Archive, (2009)Preface to "Week Three: Randomness in Computation".. Computational Complexity Theory, volume 10 of IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs., , , and . CRYPTO, volume 963 of Lecture Notes in Computer Science, page 325-338. Springer, (1995)Pseudorandomness.. ICALP, volume 1853 of Lecture Notes in Computer Science, page 687-704. Springer, (2000)Improved Derandomization of BPP Using a Hitting Set Generator., and . RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, page 131-137. Springer, (1999)On Chosen Ciphertext Security of Multiple Encryptions., , and . IACR Cryptology ePrint Archive, (2002)Universal Arguments and their Applications., and . SIAM J. Comput., 38 (5): 1661-1694 (2008)Session-Key Generation using Human Passwords Only., and . IACR Cryptology ePrint Archive, (2000)On Security Preserving Reductions - Revised Terminology.. IACR Cryptology ePrint Archive, (2000)