Photo of Prof. Benny Chor

Prof. Benny Chor

Contact information
Research interests
Computational Biology; Cryptography and Pseudorandomness; Randomized Distributed Algorithms.
Selected publications

CHOR, B., HENDY, M., HOLLAND, B., and PENNY, D., �Multiple maxima of likelihood in phylogenetic trees: an analytic approach�, Molecular Biology and Evolution, in press.

BEN-DOR, A., CHOR, B., and PELLEG,D., �Radiation hybrid ordering (RHO)�, Genome Research, Vol. 10, No. 3,pp. 365-378, 2000.

CHOR, B., GOLDREICH, O., KUSHILEVITZ, E., and SUDAN, M., �Private information retrieval�, Journal of ACM, Vol. 45, No. 6, pp. 965-981, 1998 (Available online at

CHOR, B., and NELSON, L., �Solvability in asynchronous environments II: finite interactive tasks", SIAM Journal on Computing, Vol. 29, No. 2, pp. 351-377, 1999 (Available online at

CHOR, B., and SUDAN, M., �A geometric approach to betweenness�, SIAM Journal on Discrete Mathematics, Vol. 11, No. 4, pp. 511-523, 1998.

BEN-DOR, A., CHOR, B., GRAUR, D., OPHIR, R., and PELLEG, D., �From four-taxon trees to phylogenies: The case of mammalian evolution�, Vol. 5, No. 3, pp. 377-390, 1998.

CHOR, B., GERÉB-GRAUS, M., and KUSHILEVITZ, E. �Private computations over the integers�, SIAM Journal on Computing, Vol. 24, No. 2, pp. 376-386, 1995.

BEIMEL, A., and CHOR, B., �Universally ideal secret sharing schemes�, IEEE Transactions on Information Theory, Vol. 40, No. 3, pp. 786-794, 1994.

CHOR, B., and GOLDREICH, O., �Unbiased bits from sources of weak randomness and probabilistic communication complexity�, SIAM Journal on Computing, Vol. 17, No. 2, pp. 230-261, 1988.

ALEXI, W., CHOR, B., GOLDREICH, O., and SCHNORR, C.P., �RSA/Rabin Functions: Certain parts are as hard as the whole�, SIAM Journal on Computing, Vol. 17, No. 2, pp. 194-209, 1988.

BEN-DOR, A., and CHOR, B., �On constructing radiation hybrid maps�, Journal of Computational Biology, Vol. 4, No. 4, pp. 517-533, 1997.

CHOR, B., and GILBOA, N., �Computationally Private Information retrieval�, Proceedings of the 29th ACM Symposium on Theory of Computation, pp. 304-313, 1997.