Volgen
Benny Chor
Benny Chor
Professor of Computer Science, Tel-Aviv University
Geverifieerd e-mailadres voor cs.tau.ac.il
Titel
Geciteerd door
Geciteerd door
Jaar
Private information retrieval
B Chor, E Kushilevitz, O Goldreich, M Sudan
Journal of the ACM (JACM) 45 (6), 965-981, 1998
32971998
VERIFIABLE SECRET SHARING AND ACHIEVING SIMULTANEITY IN THE PRESENCE OF FAULTS.
B Choc, S Goldwasser, S Micali, B Awerbuch
Annual Symposium on Foundations of Computer Science (Proceedings), 383-395, 1985
13921985
Tracing traitors
B Chor, A Fiat, M Naor
Advances in Cryptology—CRYPTO’94: 14th Annual International Cryptology …, 1994
9501994
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
9322002
Unbiased bits from sources of weak randomness and probabilistic communication complexity
B Chor, O Goldreich
SIAM Journal on Computing 17 (2), 230-261, 1988
8171988
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
5551985
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
4851988
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
4691988
Computationally private information retrieval
B Chor, N Gilboa
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
4391997
Tracing traitors
B Chor, A Fiat, M Naor, B Pinkas
IEEE Transactions on Information Theory 46 (3), 893-910, 2000
3852000
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
3341989
Private information retrieval by keywords
B Chor, N Gilboa, M Naor
Technion-IIT, Department of Computer Science, 1997
3211997
On the power of two-point based sampling
B Chor, O Goldreich
Journal of Complexity 5 (1), 96-106, 1989
2701989
A zero-one law for boolean privacy
B Chor, E Kushilevitz
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
2691989
Genomic DNA k-mer spectra: models and modalities
B Chor, D Horn, N Goldman, Y Levy, T Massingham
Genome biology 10, 1-10, 2009
2632009
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
2552005
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
2352006
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
1682005
Randomization in byzantine agreement
B Chor
Randomness and Computation, 1989
1681989
Universally ideal secret-sharing schemes
A Beimel, B Chor
IEEE Transactions on Information Theory 40 (3), 786-794, 1994
162*1994
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20