( en | de | ru )

 

Disambiguation of "Goldreich, Oded"

Author of the publication

copydeleteadd this publication to your clipboard
RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure.

, and . CRYPTO, volume 196 of Lecture Notes in Computer Science, page 303-313. Springer, (1984)

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 Krebs

 

Other publications of authors with the same name

Three theorems regarding testing graph properties, and . Random Struct. Algorithms, 23 (1): 23-57 (2003)Property Testing in Bounded Degree Graphs, and . Algorithmica, 32 (2): 302-343 (2002)On derandomizing algorithms that err extremely rarely., and . STOC, page 109-118. ACM, (2014)Another Motivation for Reducing the Randomness Complexity of Algorithms.. Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)Average Case Complexity, Revisited.. Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)On Security Preserving Reductions - Revised Terminology.. Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)Bravely, Moderately: A Common Theme in Four Recent Works.. Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)A taxonomy of proof systems (part 2).. SIGACT News, 25 (1): 22-30 (1994)On our duties as scientists.. SIGACT News, 40 (3): 53-59 (2009)On Pseudorandomness with respect to Deterministic Observes., and . ICALP Satellite Workshops, page 77-84. Carleton Scientific, Waterloo, Ontario, Canada, (2000)