Follow
Benny Chor
Title
Cited by
Cited by
Year
Private information retrieval
B Chor, E Kushilevitz, O Goldreich, M Sudan
Journal of the ACM (JACM) 45 (6), 965-981, 1998
31411998
Verifiable secret sharing and achieving simultaneity in the presence of faults
B Chor, S Goldwasser, S Micali, B Awerbuch
26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 383-395, 1985
13531985
Tracing traitors
B Chor, A Fiat, M Naor
Advances in Cryptology—CRYPTO’94: 14th Annual International Cryptology …, 1994
9311994
Discovering local structure in gene expression data: the order-preserving submatrix problem
A Ben-Dor, B Chor, R Karp, Z Yakhini
Proceedings of the sixth annual international conference on Computational …, 2002
9302002
Unbiased bits from sources of weak randomness and probabilistic communication complexity
B Chor, O Goldreich
SIAM Journal on Computing 17 (2), 230-261, 1988
8041988
The bit extraction problem or t-resilient functions
B Chor, O Goldreich, J Hasted, J Freidmann, S Rudich, R Smolensky
26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 396-407, 1985
5471985
A knapsack-type public key cryptosystem based on arithmetic in finite fields
B Chor, RL Rivest
IEEE Transactions on Information Theory 34 (5), 901-909, 1988
4781988
RSA and Rabin functions: Certain parts are as hard as the whole
W Alexi, B Chor, O Goldreich, CP Schnorr
SIAM Journal on Computing 17 (2), 194-209, 1988
4661988
Computationally private information retrieval
B Chor, N Gilboa
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
4231997
Tracing traitors
B Chor, A Fiat, M Naor, B Pinkas
IEEE Transactions on Information Theory 46 (3), 893-910, 2000
3752000
On the theory of average case complexity
S Ben-David, B Chor, O Goldreich
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
3251989
Private information retrieval by keywords
B Chor, N Gilboa, M Naor
Technion-IIT, Department of Computer Science, 1997
3001997
A zero-one law for boolean privacy
B Chor, E Kushilevitz
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
2641989
On the power of two-point based sampling
B Chor, O Goldreich
Journal of Complexity 5 (1), 96-106, 1989
2611989
Tight lower bounds for certain parameterized NP-hard problems
J Chen, B Chor, M Fellows, X Huang, D Juedes, IA Kanj, G Xia
Information and Computation 201 (2), 216-231, 2005
2402005
Genomic DNA k-mer spectra: models and modalities
B Chor, D Horn, N Goldman, Y Levy, T Massingham
Genome biology 10, 1-10, 2009
2382009
The average common substring approach to phylogenomic reconstruction
I Ulitsky, D Burstein, T Tuller, B Chor
Journal of Computational Biology 13 (2), 336-350, 2006
2222006
Randomization in Byzantine agreement
B Chor
Randomness and Computation, 1989
1691989
Universally ideal secret-sharing schemes
A Beimel, B Chor
IEEE Transactions on Information Theory 40 (3), 786-794, 1994
164*1994
Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps
B Chor, M Fellows, D Juedes
Graph-Theoretic Concepts in Computer Science: 30th International Workshop …, 2005
1622005
The system can't perform the operation now. Try again later.
Articles 1–20