Benny Chor |
|
---|---|
Author's Web Page ![]() | |
11 papers in database with 1051 citations ![]() ![]() H-number: 10 | |
Journal Papers |
|
1. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz, On the Structure of the Privacy Hierarchy, Journal of Cryptology,
Volume 7(1), pp. 53 - 60,
Springer, 1994. [ ![]() | |
2. Benny Chor, Eyal Kushilevitz, Secret Sharing Over Infinite Domains, Journal of Cryptology,
Volume 6(2), pp. 87 - 95,
Springer, 1993. [ ![]() | |
3. Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr, RSA and Rabin Functions: Certain Parts are as Hard as the Whole, SIAM Journal on Computing,
Volume 17(2), pp. 194 - 209,
Society for Industrial and Applied Mathematics, 1988. [ ![]() ![]() ![]() | |
Conference Papers |
|
1. Amos Beimel, Benny Chor, Secret Sharing with Public Reconstruction (Extended Abstract), pp. 353 - 366, CRYPTO 1995. [ ![]() ![]() | |
2. Benny Chor, Amos Fiat, Moni Naor, Tracing Traitors, pp. 257 - 270, CRYPTO 1994. [ ![]() ![]() ![]() ![]() ![]() | |
3. Amos Beimel, Benny Chor, Interaction in Key Distribution Schemes (Extended Abstract), pp. 444 - 455, CRYPTO 1993. [ ![]() ![]() | |
4. Amos Beimel, Benny Chor, Universally Ideal Secret Sharing Schemes (Preliminary Version), pp. 183 - 195, CRYPTO 1992. [ ![]() ![]() | |
5. Benny Chor, Eyal Kushilevitz, Secret Sharing Over Infinite Domains (Extended Abstract), pp. 299 - 306, CRYPTO 1989. [ ![]() ![]() | |
6. Benny Chor, Oded Goldreich, Shafi Goldwasser, The Bit Security of Modular Squaring Given Partial Factorization of the Modulos, pp. 448 - 457, CRYPTO 1985. [ ![]() ![]() | |
7. Benny Chor, Oded Goldreich, RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure, pp. 303 - 313, CRYPTO 1984. [ ![]() ![]() | |
8. Benny Chor, Ronald L. Rivest, A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields, pp. 54 - 65, CRYPTO 1984. [ ![]() ![]() ![]() ![]() |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals