Benny Chor | Academic Influence

Q: What Schools Are Affiliated With Benny Chor

Benny Chor is affiliated with the following schools: Tel Aviv University, Massachusetts Institute of Technology

Why Is Benny Chor Influential?

According to Wikipedia, Ben-Zion Chor was an Israeli computer scientist. He was known for his research in cryptography, including traitor tracing, randomness extractors, private information retrieval, the security level and single-bit security of RSA encryption, and secret sharing. Beyond cryptography, he also made important contributions in distributed shared-memory consensus and in the discovery of patterns in gene expression data.

(See a Problem?)

Benny Chor's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Private information retrieval (1995) (2485)
Verifiable secret sharing and achieving simultaneity in the presence of faults (1985) (884)
Tracing traitors (1994) (735)
Unbiased bits from sources of weak randomness and probabilistic communication complexity (1985) (662)
Discovering local structure in gene expression data: the order-preserving submatrix problem (2002) (618)
The bit extraction problem or t-resilient functions (1985) (370)
RSA and Rabin Functions: Certain Parts are as Hard as the Whole (1988) (346)
Private Information Retrieval by Keywords (1998) (254)
On the theory of average case complexity (1989) (241)
Computationally private information retrieval (extended abstract) (1997) (237)
Tight lower bounds for certain parameterized NP-hard problems (2004) (214)
A zero-one law for Boolean privacy (1989) (212)
Discovering local structure in gene expression data: the order-preserving submatrix problem. (2003) (209)
The Average Common Substring Approach to Phylogenomic Reconstruction (2006) (208)
On the power of two-point based sampling (1989) (200)
Genomic DNA k-mer spectra: models and modalities (2009) (186)
A knapsack-type public key cryptosystem based on arithmetic in finite fields (1988) (158)
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (1984) (151)
Randomization in Byzantine Agreement (1989) (138)
On processor coordination using asynchronous hardware (1987) (129)
The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) (1985) (122)
Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps (2004) (119)
A Geometric Approach to Betweenness (1995) (112)
Multiple maxima of likelihood in phylogenetic trees: an analytic approach (2000) (112)
Maximum likelihood of evolutionary trees: hardness and approximation (2005) (110)
Universally ideal secret-sharing schemes (1994) (108)
Maximum Likelihood of Evolutionary Trees Is Hard (2005) (82)
A Simple and Efficient Randomized Byzantine Agreement Algorithm (1985) (77)
Simple constant-time consensus protocols in realistic failure models (1989) (73)
Privacy, additional information, and communication (1990) (63)
A Communication-Privacy Tradeoff for Modular Addition (1993) (63)
Finding a maximum likelihood tree is hard (2006) (61)
Computational Thinking in Life Science Education (2014) (60)
Secret Sharing with Public Reconstruction (1998) (55)
Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships (1998) (54)
A deep neural network approach for learning intrinsic protein‐RNA binding preferences (2018) (52)
The Random Oracle Hypothesis Is False (1994) (51)
Wait-Free Consensus Using Asynchronous Hardware (1994) (50)
Achieving independence in logarithmic number of rounds (1987) (50)
An application of number theory to the organization of raster-graphics memory (1982) (49)
Maximum likelihood Jukes-Cantor triplets: analytic solutions. (2005) (47)
On Constructing Radiation Hybrid Maps (1997) (47)
Secret sharing over infinite domains (1993) (46)
On the cryptographic security of single RSA bits (1983) (45)
Genomic analysis of COP9 signalosome function in Drosophila melanogaster reveals a role in temporal regulation of gene expression (2007) (44)
Large-scale analysis of Arabidopsis transcription reveals a basal co-regulation network (2009) (44)
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure (1984) (41)
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard (2003) (40)
Communication in key distribution schemes (1996) (38)
Solvability in asynchronous environments (1989) (35)
Private computations over the integers (1990) (32)
Two Issues in Public Key Cryptography: RSA Bit Security and a New Knapsack Type System (1986) (31)
Connected Coloring Completion for General Graphs: Algorithms and Complexity (2007) (29)
An improved parallel algorithm for integer GCD (1990) (27)
Forbidden penta‐peptides (2007) (26)
RHO--radiation hybrid ordering. (2000) (25)
A Phylogenetic Approach to Music Performance Analysis (2012) (24)
A Zero-One Law for Boolean Privacy (extended abstract) (1989) (24)
Maximum likelihood on four taxa phylogenetic trees: analytic solutions (2003) (22)
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites (2001) (22)
Interaction in Key Distribution Schemes (Extended Abstract) (1993) (20)
Inversion symmetry of DNA k-mer counts: validity and deviations (2016) (20)
Linear Separability of Gene Expression Data Sets (2010) (19)
Approximate Maximum Parsimony and Ancestral Maximum Likelihood (2010) (18)
Simple constant-time consensus protocols in realistic failure models (extended abstract) (1985) (18)
Extending partial haplotypes to full genome haplotypes using chromosome conformation capture data (2016) (18)
String graph construction using incremental hashing (2014) (18)
RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure (1985) (17)
Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length (2007) (16)
From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution (1998) (15)
Molecular clock fork phylogenies: closed form analytic maximum likelihood solutions. (2004) (15)
On the number of ordered factorizations of natural numbers (2000) (15)
On the structure of the privacy hierarchy (1994) (15)
Analytic solutions for three taxon ML trees with variable rates across sites (2007) (14)
Secret Sharing Over Infinite Domains (Extended Abstract) (1989) (14)
Information Theoretic Approaches to Whole Genome Phylogenies (2005) (14)
BioNSi: A Discrete Biological Network Simulator Tool. (2016) (13)
From Quartets to Phylogenetic Trees (1998) (12)
The effective application of a discrete transition model to explore cell-cycle regulation in yeast (2013) (11)
Maximum Likelihood Molecular Clock Comb: Analytic Solutions (2006) (11)
Universally Ideal Secret Sharing Schemes (Preliminary Version) (1992) (11)
On Privacy and Partition Arguments (2001) (10)
Using Restriction Enzymes to Improve Sequencing by Hybridization (2002) (10)
Detecting Phylogenetic Signals in Eukaryotic Whole Genome Sequences (2012) (10)
Genomic analysis of COP 9 signalosome function in Drosophila melanogaster reveals a role in temporal regulation of gene expression (2007) (10)
On constructing radiation hybrid maps (extended abstract) (1997) (9)
The privacy of dense symmetric functions (1995) (8)
Solvability in Asynchronous Environments II: Finite Interactive Tasks (1999) (7)
RSA/Rabin least significant bits are \( \tfrac{1} {2} + \tfrac{1} {{poly \left( {\log N} \right)}} \) secure (Extended Abstract) (1984) (7)
On the Theory of Average Case Complexity (abstract) (1989) (7)
Biological Networks: Comparison, Conservation, and Evolutionary Trees (2006) (7)
CRISPR Detection from Short Reads Using Partial Overlap Graphs (2015) (7)
Genetic code symmetry and efficient design of GC-constrained coding sequences (2007) (7)
CS1001.py: a topic-based introduction to computer science (2012) (7)
The Bit Security of Modular Squaring Given Partial Factorization of the Modulos (1985) (7)
On the Influence of Single Participant in Coin Flipping Schemes (1988) (6)
Solvability in Asynchronous Environments (Extended Abstract) (1989) (6)
Representative Selection in Nonmetric Datasets (2015) (5)
Analytic solutions of maximum likelihood on forks of four taxa. (2007) (5)
Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds (2005) (3)
A Deep Learning Approach for Learning Intrinsic Protein-RNA Binding Preferences (2018) (3)
Secret Sharing with Public Reconstruction (Extended Abstract) (1995) (3)
Do tree split probabilities determine the branch lengths? (2015) (2)
Adding Hidden Nodes to Gene Networks (Extended Abstract) (2004) (2)
Resiliency of interactive distributed tasks (extended abstracts) (1991) (2)
Teaching Computer Science in the Community (2016) (1)
Cases in which ancestral maximum likelihood will be confusingly misleading. (2017) (1)
Inter-chromosomal k-mer distances (2021) (1)
Private Computations Over the Integers (extended abstract ) (1990) (1)
The Functional 3D Organization of Unicellular Genomes (2019) (1)
A High Quartet Distance Construction (2019) (1)
Hierarchical Partitioning of Metazoan Protein Conservation Profiles Provides New Functional Insights (2014) (1)
The effective application of a discrete transition model to explore cell-cycle regulation in yeast (2013) (1)
Maximum Likelihood Molecular Clock Comb : Analytic Solutions 1 (2006) (1)
Chromosomal Inversion Symmetry: Generalized Chargaff Rules (2015) (0)
Secure Multi-party Computation Dedication a Warning (1998) (0)
Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology (2012) (0)
Research in Computational Molecular Biology (2012) (0)
Resilience of general interactive tasks (1994) (0)
Tree split probabilities determine the branch lengths (2013) (0)
Transitive Transfer of Conndence: a Per- Fect Zero-knowledge Interactive Proto- Col for Sat and Beyond. 5.1 Additional Security for the User (1997) (0)
Inter-chromosomal k-mer distances (2021) (0)
Biological Networks: Comparison, Conservation, and Evolutionary Trees (Extended Abstract) (2006) (0)
Special RECOMB 2002 Issue (2004) (0)
ML MC Forks: Closed Form Analytic Solutions (2004) (0)
A Deep Learning Approach for Predicting Protein-RNA Binding (2018) (0)
Computational Thinking for Life Scientists (2022) (0)
A High Quartet Distance Construction (2019) (0)
Ismb/eccb 2019 Proceedings Papers Committee (2019) (0)
A High Quartets Distance Construction (2016) (0)
Teaching computational approaches for life scientists (2013) (0)
A SKETCH OF SCHNORR AND ALEXI IMPROVEMENT (2002) (0)
Preface: RECOMB 2012 (2013) (0)
Inversion symmetry of DNA k-mer counts: validity and deviations (2016) (0)
Communication in Key Distribution (1996) (0)

This paper list is powered by the following services:

Other Resources About Benny Chor

What Schools Are Affiliated With Benny Chor?

Benny Chor is affiliated with the following schools: