Benny Chor focuses on Cryptography, Discrete mathematics, Computer security, Combinatorics and Private information retrieval. Benny Chor has researched Cryptography in several fields, including Ciphertext, Arithmetic and Public-key cryptography. He has researched Discrete mathematics in several fields, including Plaintext and Pseudorandom number generator.
The study incorporates disciplines such as Verifiable secret sharing and Tracing in addition to Computer security. His work on Zero–one law, Parameterized complexity and Clique as part of general Combinatorics study is frequently linked to Function and Dominating set, bridging the gap between disciplines. Benny Chor works mostly in the field of Private information retrieval, limiting it down to topics relating to Information retrieval and, in certain cases, Scheme and Oblivious ram.
His primary areas of investigation include Discrete mathematics, Combinatorics, Theoretical computer science, Phylogenetic tree and Algorithm. The various areas that Benny Chor examines in his Discrete mathematics study include Computational complexity theory, Set, Ciphertext and Secret sharing. Benny Chor works mostly in the field of Secret sharing, limiting it down to concerns involving Verifiable secret sharing and, occasionally, Computer security.
His Combinatorics research is multidisciplinary, incorporating elements of Maximum parsimony and Optimality criterion. His research in Theoretical computer science is mostly focused on Communication complexity. His research integrates issues of Tree, Protein Interaction Networks, Artificial intelligence and KEGG in his study of Phylogenetic tree.
Benny Chor spends much of his time researching Computational biology, Combinatorics, Genome, Genetics and Artificial intelligence. His Combinatorics research integrates issues from Prefix order and Phylogenetic tree. His work focuses on many connections between Genome and other disciplines, such as CRISPR, that overlap with his field of interest in Graph.
Many of his research projects under Genetics are closely connected to Logarithm and Generalization with Logarithm and Generalization, tying the diverse disciplines of science together. His Artificial intelligence research incorporates themes from RNA and Natural language processing. Benny Chor conducted interdisciplinary study in his works that combined Order and Discrete mathematics.
Benny Chor mostly deals with Artificial intelligence, Genetics, Computational biology, Software and Genome. Benny Chor interconnects Tree and Violin in the investigation of issues within Artificial intelligence. His work carried out in the field of Genetics brings together such families of science as Logarithmic growth and Combinatorics.
Benny Chor has included themes like Artificial neural network, Recurrent neural network, RNA, Reconstruction method and Phylogenetic network in his Computational biology study. His studies deal with areas such as Science education, Engineering ethics, Bioinformatics and Computational thinking as well as Software. His Genome research incorporates elements of Evolutionary pressure and Phylogenetic tree.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Private information retrieval
B. Chor;O. Goldreich;E. Kushilevitz;M. Sudan.
foundations of computer science (1995)
Private information retrieval
B. Chor;O. Goldreich;E. Kushilevitz;M. Sudan.
foundations of computer science (1995)
Private information retrieval
Benny Chor;Eyal Kushilevitz;Oded Goldreich;Madhu Sudan.
Journal of the ACM (1998)
Private information retrieval
Benny Chor;Eyal Kushilevitz;Oded Goldreich;Madhu Sudan.
Journal of the ACM (1998)
Discovering local structure in gene expression data: the order-preserving submatrix problem.
Amir Ben-Dor;Benny Chor;Richard M. Karp;Zohar Yakhini.
Journal of Computational Biology (2003)
Discovering local structure in gene expression data: the order-preserving submatrix problem.
Amir Ben-Dor;Benny Chor;Richard M. Karp;Zohar Yakhini.
Journal of Computational Biology (2003)
Verifiable secret sharing and achieving simultaneity in the presence of faults
Benny Chor;Shafi Goldwasser;Silvio Micali;Baruch Awerbuch.
foundations of computer science (1985)
Verifiable secret sharing and achieving simultaneity in the presence of faults
Benny Chor;Shafi Goldwasser;Silvio Micali;Baruch Awerbuch.
foundations of computer science (1985)
Tracing traitors
B. Chor;A. Fiat;M. Naor;B. Pinkas.
IEEE Transactions on Information Theory (2000)
Tracing traitors
B. Chor;A. Fiat;M. Naor;B. Pinkas.
IEEE Transactions on Information Theory (2000)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Weizmann Institute of Science
Technion – Israel Institute of Technology
Ben-Gurion University of the Negev
Technion – Israel Institute of Technology
University of Bergen
MIT
Harvard University
Weizmann Institute of Science
University of Waterloo
BitRipple
University of Granada
University of Arizona
Swedish University of Agricultural Sciences
Centre national de la recherche scientifique, CNRS
Ghent University
Wageningen University & Research
University of Rochester
University of Copenhagen
University of Maryland Center For Environmental Sciences
Leidos (United States)
Utrecht University
University of Kentucky
The University of Texas MD Anderson Cancer Center
Duke University
University of Arizona
National Institute for Astrophysics