An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) - Benny Chor; Charles E. Leiserson; Ronald L. Rivest (FOCS, 1982)

On the Cryptographic Security of Single RSA Bits - Michael Ben-Or; Benny Chor; Adi Shamir (STOC, 1983)

RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. - Benny Chor; Oded Goldreich 001 (CRYPTO, 1984)

RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure - Werner Alexi; Benny Chor; Oded Goldreich 001; Claus-Peter Schnorr (FOCS, 1984)

The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. - Benny Chor; Oded Goldreich 001; Shafi Goldwasser (CRYPTO, 1985)

Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract) - Benny Chor; Oded Goldreich 001 (FOCS, 1985)

The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) - Benny Chor; Oded Goldreich 001; Johan Håstad; Joel Friedman; Steven Rudich; Roman Smolensky (FOCS, 1985)

Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) - Benny Chor; Shafi Goldwasser; Silvio Micali; Baruch Awerbuch (FOCS, 1985)

Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). - Benny Chor; Michael Merritt; David B. Shmoys (PODC, 1985)

A Simple and Efficient Randomized Byzantine Agreement Algorithm. - Benny Chor; Brian A. Coan (IEEE Trans. Software Eng., 1985)

Two issues in public key cryptography : RSA bit security and a new knapsack type system - Benny Chor (1985)

An application of number theory to the organization of raster-graphics memory. - Benny Chor; Charles E. Leiserson; Ronald L. Rivest; James B. Shearer (J. ACM, 1986)

On Processor Coordination Using Asynchronous Hardware. - Benny Chor; Amos Israeli; Ming Li 001 (PODC, 1987)

Achieving Independence in Logarithmic Number of Rounds. - Benny Chor; Michael O. Rabin (PODC, 1987)

RSA and Rabin Functions: Certain Parts are as Hard as the Whole. - Werner Alexi; Benny Chor; Oded Goldreich 001; Claus-Peter Schnorr (SIAM J. Comput., 1988)

Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. - Benny Chor; Oded Goldreich 001 (SIAM J. Comput., 1988)

On the Influence of Single Participant in Coin Flipping Schemes. - Benny Chor; Mihály Geréb-Graus (SIAM J. Discret. Math., 1988)

A knapsack-type public key cryptosystem based on arithmetic in finite fields. - Benny Chor; Ronald L. Rivest (IEEE Trans. Inf. Theory, 1988)

On the Theory of Average Case Complexity (abstract). - Shai Ben-David; Benny Chor; Oded Goldreich 001; Michael Luby (SCT, 1989)

Secret Sharing Over Infinite Domains (Extended Abstract). - Benny Chor; Eyal Kushilevitz (CRYPTO, 1989)

Solvability in Asynchronous Environments (Extended Abstract) - Benny Chor; Lior Moscovici (FOCS, 1989)

A Zero-One Law for Boolean Privacy (extended abstract) - Benny Chor; Eyal Kushilevitz (STOC, 1989)

Randomization in Byzantine Agreement. - Benny Chor; Cynthia Dwork (Adv. Comput. Res., 1989)

Simple constant-time consensus protocols in realistic failure models. - Benny Chor; Michael Merritt; David B. Shmoys (J. ACM, 1989)

On the power of two-point based sampling. - Benny Chor; Oded Goldreich 001 (J. Complex., 1989)

Privacy, Additional Information, and Communication. - Reuven Bar-Yehuda; Benny Chor; Eyal Kushilevitz (SCT, 1990)

Private Computations Over the Integers (Extended Abstract) - Benny Chor; Mihály Geréb-Graus; Eyal Kushilevitz (FOCS, 1990)

An Improved Parallel Algorithm for Integer GCD. - Benny Chor; Oded Goldreich 001 (Algorithmica, 1990)

Resiliency of Interactive Distributed Tasks (Extended Abstract). - Benny Chor; Lee-Bath Nelson (PODC, 1991)

A Zero-One Law for Boolean Privacy. - Benny Chor; Eyal Kushilevitz (SIAM J. Discret. Math., 1991)

Universally Ideal Secret Sharing Schemes (Preliminary Version). - Amos Beimel; Benny Chor (CRYPTO, 1992)

On the Theory of Average Case Complexity. - Shai Ben-David; Benny Chor; Oded Goldreich 001; Michael Luby (J. Comput. Syst. Sci., 1992)

Interaction in Key Distribution Schemes (Extended Abstract). - Amos Beimel; Benny Chor (CRYPTO, 1993)

A Communication-Privacy Tradeoff for Modular Addition. - Benny Chor; Eyal Kushilevitz (Inf. Process. Lett., 1993)

Secret Sharing Over Infinite Domains. - Benny Chor; Eyal Kushilevitz (J. Cryptol., 1993)

Privacy, additional information and communication. - Reuven Bar-Yehuda; Benny Chor; Eyal Kushilevitz; Alon Orlitsky (IEEE Trans. Inf. Theory, 1993)

Tracing Traitors. - Benny Chor; Amos Fiat; Moni Naor (CRYPTO, 1994)

Resilience of General Interactive Tasks. - Benny Chor; Lee-Bath Nelson (PODC, 1994)

The Random Oracle Hypothesis Is False. - Richard Chang 001; Benny Chor; Oded Goldreich 001; Juris Hartmanis; Johan Håstad; Desh Ranjan; Pankaj Rohatgi (J. Comput. Syst. Sci., 1994)

On the Structure of the Privacy Hierarchy. - Benny Chor; Mihály Geréb-Graus; Eyal Kushilevitz (J. Cryptol., 1994)

Wait-Free Consensus Using Asynchronous Hardware. - Benny Chor; Amos Israeli; Ming Li 001 (SIAM J. Comput., 1994)

Universally ideal secret-sharing schemes. - Amos Beimel; Benny Chor (IEEE Trans. Inf. Theory, 1994)

Secret Sharing with Public Reconstruction (Extended Abstract). - Amos Beimel; Benny Chor (CRYPTO, 1995)

The Privacy of Dense Symmetric Functions. - Benny Chor; Netta Shani (Comput. Complex., 1995)

Private Computations over the Integers. - Benny Chor; Mihály Geréb-Graus; Eyal Kushilevitz (SIAM J. Comput., 1995)

Communication in key distribution schemes. - Amos Beimel; Benny Chor (IEEE Trans. Inf. Theory, 1996)

On constructing radiation hybrid maps (extended abstract). - Amir Ben-Dor; Benny Chor (RECOMB, 1997)

Computationally Private Information Retrieval (Extended Abstract). - Benny Chor; Niv Gilboa (STOC, 1997)

On Constructing Radiation Hybrid Maps. - Amir Ben-Dor; Benny Chor (J. Comput. Biol., 1997)

From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution. - Amir Ben-Dor; Benny Chor; Dan Graur; Ron Ophir; Dan Pelleg (RECOMB, 1998)

From Quartets to Phylogenetic Trees. - Benny Chor (SOFSEM, 1998)

Private Information Retrieval by Keywords. - Benny Chor; Niv Gilboa; Moni Naor (IACR Cryptol. ePrint Arch., 1998)

Private Information Retrieval. - Benny Chor; Eyal Kushilevitz; Oded Goldreich 001; Madhu Sudan 001 (J. ACM, 1998)

Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships. - Amir Ben-Dor; Benny Chor; Dan Graur; Ron Ophir; Dan Pelleg (J. Comput. Biol., 1998)

A Geometric Approach to Betweenness. - Benny Chor; Madhu Sudan 001 (SIAM J. Discret. Math., 1998)

Secret Sharing with Public Reconstruction. - Amos Beimel; Benny Chor (IEEE Trans. Inf. Theory, 1998)

Solvability in Asynchronous Environments II: Finite Interactive Tasks. - Benny Chor; Lee-Bath Nelson (SIAM J. Comput., 1999)

Multiple maxima of likelihood in phylogenetic trees: an analytic approach. - Benny Chor; Michael D. Hendy; Barbara R. Holland; David Penny (RECOMB, 2000)

On the number of ordered factorizations of natural numbers. - Benny Chor; Paul Lemke; Ziv Mador (Discret. Math., 2000)

Tracing traitors. - Benny Chor; Amos Fiat; Moni Naor; Benny Pinkas (IEEE Trans. Inf. Theory, 2000)

Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites. - Benny Chor; Michael D. Hendy; David Penny (WABI, 2001)

On Privacy and Partition Arguments. - Benny Chor; Yuval Ishai (Inf. Comput., 2001)

Maximum likelihood on four taxa phylogenetic trees: analytic solutions. - Benny Chor; Amit Khetan; Sagi Snir (RECOMB, 2003)

Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. - Amir Ben-Dor; Benny Chor; Richard M. Karp; Zohar Yakhini (J. Comput. Biol., 2003)

Adding Hidden Nodes to Gene Networks (Extended Abstract). - Benny Chor; Tamir Tuller (WABI, 2004)

Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps. - Benny Chor; Mike Fellows; David W. Juedes (WG, 2004)

Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. - Louigi Addario-Berry; Benny Chor; Michael T. Hallett; Jens Lagergren; Alessandro Panconesi; Todd Wareham (J. Bioinform. Comput. Biol., 2004)

Maximum likelihood of evolutionary trees: hardness and approximation. - Benny Chor; Tamir Tuller (ISMB (Supplement of Bioinformatics), 2005)

Information Theoretic Approaches to Whole Genome Phylogenies. - David Burstein; Igor Ulitsky; Tamir Tuller; Benny Chor (RECOMB, 2005)

Maximum Likelihood of Evolutionary Trees Is Hard. - Benny Chor; Tamir Tuller (RECOMB, 2005)

Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds. - Tamir Tuller; Efrat Oron; Erez Makavy; Daniel A. Chamovitz; Benny Chor (WABI, 2005)

Tight lower bounds for certain parameterized NP-hard problems. - Jianer Chen; Benny Chor; Mike Fellows; Xiuzhen Huang; David W. Juedes; Iyad A. Kanj; Ge Xia (Inf. Comput., 2005)

Biological Networks: Comparison, Conservation, and Evolutionary Trees. - Benny Chor; Tamir Tuller (RECOMB, 2006)

Finding a maximum likelihood tree is hard. - Benny Chor; Tamir Tuller (J. ACM, 2006)

Maximum Likelihood Molecular Clock Comb: Analytic Solutions. - Benny Chor; Amit Khetan; Sagi Snir (J. Comput. Biol., 2006)

The Average Common Substring Approach to Phylogenomic Reconstruction. - Igor Ulitsky; David Burstein; Tamir Tuller; Benny Chor (J. Comput. Biol., 2006)

Connected Coloring Completion for General Graphs: Algorithms and Complexity. - Benny Chor; Michael R. Fellows; Mark A. Ragan; Igor Razgon; Frances A. Rosamond; Sagi Snir (COCOON, 2007)

Genetic code symmetry and efficient design of GC-constrained coding sequences. - Matan Gavish; Amnon Peled; Benny Chor (Bioinform., 2007)

Analytic solutions for three taxon ML trees with variable rates across sites. - Benny Chor; Michael D. Hendy; David Penny (Discret. Appl. Math., 2007)

Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length. - Benny Chor; Tamir Tuller (J. Comput. Biol., 2007)

Large-scale analysis of Arabidopsis transcription reveals a basal co-regulation network. - Osnat Atias; Benny Chor; Daniel A. Chamovitz (BMC Syst. Biol., 2009)

Genomic DNA k-mer Spectra: Models and Modalities. - Benny Chor; David Horn 001; Nick Goldman; Yaron Levy; Tim Massingham (RECOMB, 2010)

Approximate Maximum Parsimony and Ancestral Maximum Likelihood. - Noga Alon; Benny Chor; Fabio Pardi; Anat Rapoport (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

Linear Separability of Gene Expression Data Sets. - Giora Unger; Benny Chor (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

CS1001.py: a topic-based introduction to computer science. - Benny Chor; Rani Hod (ITiCSE, 2012)

Detecting Phylogenetic Signals in Eukaryotic Whole Genome Sequences. - Eyal Cohen; Benny Chor (J. Comput. Biol., 2012)

Preface: RECOMB 2012. - Benny Chor (J. Comput. Biol., 2013)

String graph construction using incremental hashing. - Ilan Ben-Bassat; Benny Chor (Bioinform., 2014)

Computational Thinking in Life Science Education. - Amir Rubinstein; Benny Chor (PLoS Comput. Biol., 2014)

Representative Selection in Nonmetric Datasets. - Elad Liebman; Benny Chor; Peter Stone 001 (Appl. Artif. Intell., 2015)

Representative Selection in Non Metric Datasets. - Elad Liebman; Benny Chor; Peter Stone 001 (CoRR, 2015)

Teaching Computer Science in the Community. - Benny Chor; Assaf Zaritsky (ICDCIT, 2016)

Extending partial haplotypes to full genome haplotypes using chromosome conformation capture data. - Shay Ben-Elazar; Benny Chor; Zohar Yakhini (Bioinform., 2016)

CRISPR Detection From Short Reads Using Partial Overlap Graphs. - Ilan Ben-Bassat; Benny Chor (J. Comput. Biol., 2016)

A deep neural network approach for learning intrinsic protein-RNA binding preferences. - Ilan Ben-Bassat; Benny Chor; Yaron Orenstein (Bioinform., 2018)