( en | de | ru )

 

Disambiguation of "Goldreich, Oded"

Author of the publication

copydeleteadd this publication to your clipboard
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

, , and . J. ACM, 38 (3): 690--728 (1991)
DOI: http://doi.acm.org/10.1145/116825.116852

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

Property Testing in Bounded Degree Graphs, and . Algorithmica, 32 (2): 302-343 (2002)Testing Bipartiteness in the Dense-Graph Model., and . Encyclopedia of Algorithms, (2016)On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits.. TCC, volume 4392 of Lecture Notes in Computer Science, page 174-193. Springer, (2007)Bravely, Moderately: A Common Theme in Four Recent Works.. Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)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)On some noncryptographic works of Goldwasser and Micali.. Providing Sound Foundations for Cryptography, ACM, (2019)Preface.. Providing Sound Foundations for Cryptography, ACM, (2019)Preface to the Special Issue from Random'06.. Comput. Complex., 17 (1): 1-2 (2008)