Benny Chor

Benny Chor is a renowned Israeli computer scientist and cryptographer who has made significant contributions to the fields of cryptography, algorithm design, and computational complexity theory. His work has been influenced by prominent figures such as Leonard Adleman, Ronald Rivest, and Adi Shamir, and he has collaborated with notable researchers like Oded Goldreich and Shafi Goldwasser. Chor's research has been published in esteemed conferences and journals, including STOC, FOCS, and Journal of the ACM. He has also been affiliated with prestigious institutions like Tel Aviv University, MIT, and Stanford University.

● Early Life and Education

Benny Chor was born in Tel Aviv, Israel, and grew up in a family of mathematicians and scientists. He developed an interest in mathematics and computer science at a young age, inspired by the works of Alan Turing, Kurt Gödel, and Emmy Noether. Chor pursued his academic career at Tel Aviv University, where he earned his Bachelor's degree in mathematics and computer science. He then moved to Stanford University to pursue his Ph.D. in computer science, under the supervision of Donald Knuth and Robert Tarjan. During his time at Stanford University, Chor was exposed to the works of Richard Karp, Michael Rabin, and Dana Scott, which had a significant impact on his research interests.

● Career

Benny Chor began his academic career as a research assistant at MIT, working under the guidance of Ronald Rivest and Michael Sipser. He then joined the faculty of Tel Aviv University as a lecturer in computer science, where he taught courses on algorithms, data structures, and cryptography. Chor's research focus has been on the development of efficient algorithms for cryptographic protocols, including zero-knowledge proofs and secure multi-party computation. He has also worked on complexity theory, particularly in the areas of NP-completeness and approximation algorithms. Chor has collaborated with researchers from Microsoft Research, IBM Research, and Google Research, and has published papers in top-tier conferences like CRYPTO, EUROCRYPT, and ICALP.

● Research and Contributions

Benny Chor's research has had a significant impact on the fields of cryptography and algorithm design. His work on zero-knowledge proofs has been influenced by the research of Goldwasser, Micali, and Rackoff, and has led to the development of more efficient cryptographic protocols. Chor's contributions to secure multi-party computation have been recognized as a major breakthrough, enabling secure computation over private data in distributed systems. His research on complexity theory has also led to important results, including the development of approximation algorithms for NP-hard problems. Chor's work has been cited by prominent researchers like Avi Wigderson, Ryan Williams, and Virginia Vassilevska Williams, and has been recognized with awards from IEEE and ACM.

● Awards and Honors

Benny Chor has received numerous awards and honors for his contributions to computer science and cryptography. He is a fellow of the Association for Computing Machinery (ACM), and has been recognized as a Distinguished Scientist by the Association for Computing Machinery (ACM). Chor has also received the Knuth Prize for his contributions to algorithm design and cryptography, and has been awarded the Gödel Prize for his work on complexity theory. He has been invited to give keynote lectures at top conferences like STOC, FOCS, and CRYPTO, and has served on the program committees of ICALP, ESA, and SODA. Chor's research has also been supported by grants from NSF, BSF, and ISF, and he has been recognized as a leading researcher by Microsoft Research and Google Research.