| 词条 | Oded Goldreich |
| 释义 |
| name = Oded Goldreich | native_name = עודד גולדרייך | native_name_lang = heb | image = Oded Goldreich.jpg | image_size = 225 | alt = | caption = Oded Goldreich, 2006 | birth_date = {{Birth date and age|1957|2|4}} | birth_place = Tel Aviv, Israel | death_date = | death_place = | resting_place = | resting_place_coordinates = | other_names = | residence = | nationality = Israeli | fields = Cryptography | alma_mater = Technion, Weizmann Institute | thesis_title = | thesis_url = | thesis_year = | doctoral_advisor = Shimon Even | academic_advisors = | doctoral_students = | notable_students = | known_for = Zero-knowledge proof | influences = | influenced = | awards = | signature = | signature_alt = | website = {{URL|www.wisdom.weizmann.ac.il/~oded/}} | footnotes = | spouse = Dana Ron | children = }}Oded Goldreich ({{lang-he|עודד גולדרייך}}; b. 1957) is a professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel. His research interests lie within the theory of computation and are, specifically, the interplay of randomness and computation, the foundations of cryptography, and computational complexity theory. He won the Knuth Prize in 2017.[1] Goldreich has contributed to the development of pseudorandomness,[2][3] zero knowledge proofs,[4] secure function evaluation,[5] property testing,[6]and other areas in cryptography[7][8] and computational complexity.[9][10][11] Goldreich has also authored several books including: Foundations of Cryptography[12] which comes in two volumes (volume 1 in 2001[13] and volume 2 in 2004), Computational Complexity: A Conceptual Perspective[14] (2008), and Modern Cryptography, Probabilistic Proofs and Pseudorandomness[15] (1998).[13] He is married to Dana Ron, who is a computer scientist at Tel Aviv University, and has collaborated with Ron on approximation algorithms.[6] See also
References1. ^{{Cite press release|url=https://www.sigact.org/Prizes/Knuth/citation2017.pdf|title=2017 Knuth prize is Awarded to Oded Goldreich|publisher=ACM Special Interest Group on Algorithms and Computation Theory|accessdate=23 June 2017}} 2. ^Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to Construct Random Functions" Journal of the ACM, Vol. 33, No. 4, Oct. 1986, pages 792-807. 3. ^Oded Goldreich and Leonid Levin. Hard-core Predicates for any One-Way Function. In the proceedings of the 21st ACM Symp. on Theory of Computing, pages 25-32, 1989. 4. ^Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that Yield Nothing But their Validity or All Languages in NP have Zero-Knowledge Proofs" Journal of the ACM, Vol. 38, No. 3, July 1991, pages 691-729. 5. ^Oded Goldreich, Silvio Micali, and Avi Wigderson. How to Play any Mental Gameor a Completeness Theorem for Protocols with Honest Majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 218-229, ACM, 1987. 6. ^1 Oded Goldreich, Shafi Goldwasser, and Dana Ron. 1998 Property Testing and its connection to Learning and Approximation.Journal of the ACM, pages 653-750. 7. ^{{cite journal | author = Chor B. | authorlink4 = Madhu Sudan, Goldreich O., Kushilevitz E., Sudan Madhu | year = 1998 | title = Private Information Retrieval | url = | journal = Journal of the ACM | volume = 45 | issue = 6| pages = 965–982 | doi=10.1145/293347.293350| citeseerx = 10.1.1.51.3663 }} 8. ^{{cite journal | author = Goldreich O. | authorlink2 = Rafail Ostrovsky, Ostrovsky Rafail | year = 1996 | title = Software Protection and Simulation on Oblivious RAMs | url = | journal = Journal of the ACM | volume = 43 | issue = 3| pages = 431–473 | doi=10.1145/233551.233553| hdl = 1721.1/103684 }} 9. ^B. Chor and O. Goldreich. Unbiased Bits From Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM J. Comp., Vol. 17, No. 2, April 1988, pages 230-261. 10. ^Mihir Bellare, O. Goldreich and M. Sudan. Free Bits, PCPs and Non-Approximability -- Towards Tight Results. SIAM J. Comp., Vol. 27, No. 3, pages 804-915, June 1998. 11. ^{{cite journal | author = Goldreich O., Sudan M. | year = 2006 | title = Locally Testable Codes and PCPs of Almost-Linear Length | url = | journal = Journal of the ACM | volume = 53 | issue = 4| pages = 558–655 | doi=10.1145/1162349.1162351| citeseerx = 10.1.1.145.7477 }} 12. ^{{cite web|url=http://www.wisdom.weizmann.ac.il/~oded/foc-book.html|title=Foundations of Cryptography - a two-volume book [Goldreich]|website=www.wisdom.weizmann.ac.il}} 13. ^1 {{cite journal|author=Landau, Susan|authorlink=Susan Landau|title=Review of Foundations of Cryptography: Basic Tools by Oded Goldreich and Modern Cryptography, Probabilistic Proofs and Pseudorandomness by Oded Goldreich and 8 other books by various authors|journal=Bull. Amer. Math. Soc. (N.S.)|year=2004|volume=41|issue=3|pages=357–367|doi=10.1090/s0273-0979-04-01011-0|url=http://www.ams.org/journals/bull/2004-41-03/S0273-0979-04-01011-0/S0273-0979-04-01011-0.pdf}} 14. ^{{cite web|url=http://www.wisdom.weizmann.ac.il/~oded/cc-book.html|title=Computational Complexity: A Conceptual Perspective [Goldreich]|website=www.wisdom.weizmann.ac.il}} 15. ^{{cite web|url=http://www.wisdom.weizmann.ac.il/~oded/book1.html|title=Modern Cryptography, Probabilistic Proofs, and Pseudorandomness [Goldreich]|website=www.wisdom.weizmann.ac.il}} External links
11 : 1957 births|Living people|Israeli computer scientists|Israeli cryptographers|Modern cryptographers|Weizmann Institute faculty|Theoretical computer scientists|People from Tel Aviv|International Association for Cryptologic Research fellows|Israeli communists|Science bloggers |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。