Batch codes and their applications

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 262-271

  Ishai, Yuval ^a   Ostrovsky, Rafail ^b   Kushilevitz, Eyal ^a   Sahai, Amit ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

Coding; Distributed storage; Load balancing; Locally decodable codes; Private information retrieval

Indexed keywords

ALGORITHMS; DECODING; ENCODING (SYMBOLS); INFORMATION RETRIEVAL; INFORMATION THEORY; NETWORK PROTOCOLS; PRESS LOAD CONTROL; PROBLEM SOLVING;

DISTRIBUTED STORAGE; LOAD BALANCING; LOCALLY DECODABLE CODES; PRIVATE INFORMATION RETRIEVAL;

CRYPTOGRAPHY;

EID: 4544231738     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007396     Document Type: Conference Paper

References (35)

1. M. Ajtai, J. Komlos, and E. Szemeredi, Deterministic simulation in LOGSPACE. In Proc. 19th STOC, pages 132-140, 1987.
2. N. Alon, T. Kaufman, M. Krivelevich, S. Litsyn, and D. Ron. Testing low-degree polynomials over GF(2). In Proc. RANDOM 2003, pages 188-199.
3. D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In Proc. 7th STACS, LNCS 415, pages 37-48, 1990.
4. 1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. In Proc. 43rd FOCS, pages 261-270, 2002.
5. A. Beimel, Y. Ishai, and T. Malkin. Reducing the servers' computation in private information retrieval: PIR with preprocessing. In Proc. CRYPTO 2000, LNCS 1880, pages 56-74. To appear in Journal of Cryptology.
6. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with poly logarithmic communication. In Proc. EUROCRYPT '99, LNCS 1592, pages 402-414.
7. R. Canetti, Y. Ishai, R. Kumar, M. Reiter, R. Rubinfeld, and R. Wright. Selective Private Function Evaluation with Applications to Private Statistics In Proc. 20th PODC, pages 293-304, 2001.
8. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness Conductors and Constant-Degree Expansion Beyond the Degree/2 Barrier. In Proc. 34th STOC, pages 659-668, 2002.
9. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. 36th FOCS, pages 41-51, 1995. Journal version: J. of the ACM, 45:965-981, 1998.
10. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. 36th FOCS, pages 41-51, 1995. Journal version: J. of the ACM, 45:965-981, 1998.
11. B. Chor, N. Gilboa, and M. Naor Private information retrieval by keywords. Manuscript, 1998.
12. G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single Database Private Information Retrieval Implies Oblivious Transfer. In Proc. EUROCRYPT 2000, pages 122-138.
13. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. C. ACM, 28:637-647, 1985.
14. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. Strauss, and R. Wright. Secure Multiparty Computation of Approximations. In Proc. 28th ICALP, pages 927-938, 2001.
15. Y. Gertner, S. Goldwasser, and T. Malkin. A random server model for private information retrieval. In Proc. 2nd RANDOM, LNCS 1518, pages 200-217, 1998.
16. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes, In Proc. 30th STOC, pages 151-160, 1998. Journal version: J. of Computer and System Sciences, 60(3):592-629, 2000.
17. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes, In Proc. 30th STOC, pages 151-160, 1998. Journal version: J. of Computer and System Sciences, 60(3):592-629, 2000.
18. O. Goldreich. Secure multi-party computation. Available at http://philby.ucsb.edu/cryptolib/BOOKS, February 1999.
19. R. Impagliazzo, A. Wigderson. P=BPP unless E has Subexponential Circuits: Derandomizing the XOR Lemma. In Proc. 29th STOC, pages 220-229, 1997.
20. J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proc. 32nd STOC, pages 80-86, 2000.
21. J. Kilian. A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract). In Proc. 24th STOC, pages 723-732, 1992.
22. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proc. 38th FOCS, pages 364-373, 1997.
23. Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, and Avi Wigderson. Extractors: optimal up to constant factors. In Proc. 35th STOC, pages 602-611, 2003.
24. F.J. Mac Williams and N.J. Sloane. The Theory of Error Correcting Codes. North-Holland, Amsterdam, 1977.
25. M. Naor, and K. Nissim. Communication preserving protocols for secure function evaluation. In Proc. 33rd STOC, pages 590-599, 2001.
26. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31st STOC, pages 245-254, 1999.
27. M. Naor and B. Pinkas. Oblivious transfer with adaptive queries. In Proc. CRYPTO '99, LNCS 1666, pages 573-590.
28. M. O. Rabin. How to exchange secrets by oblivious transfer. Technical report TR-81, Harvard Aiken Computation Laboratory, 1981.
29. M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 38, pages 335-348, 1985.
30. R. Shaltiel and C. Umans. Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. In Proc. 42nd FOCS, pages 648-657, 2001.
31. M. Sipser and D. A. Spielman. Expander codes. IEEE Transactions on Information Theory, 42(6): 1710-1722, 1996.
32. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom Generators Without the XOR Lemma (Extended Abstract). In Proc. 31st STOC, pages 537-546, 1999.
33. A. Ta-Shma, C. Umans, and D. Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proc. 33rd STOC, pages 143-152, 2001.
34. A. Ta-Shma, D. Zuckerman, and S. Safra. Extractors from Reed-Muller Codes. In Proc. 42nd FOCS, pages 638-647, 2001.
35. A. C. C. Yao. Should tables be sorted? J. of the ACM, 28(3):615-628, 1981.