메뉴 건너뛰기




Volumn , Issue , 2004, Pages 262-271

Batch codes and their applications

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;

EID: 4544231738     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007396     Document Type: Conference Paper
Times cited : (233)

References (35)
  • 3
    • 33745511846 scopus 로고
    • Hiding instances in multioracle queries
    • LNCS 415
    • D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In Proc. 7th STACS, LNCS 415, pages 37-48, 1990.
    • (1990) Proc. 7th STACS , pp. 37-48
    • Beaver, D.1    Feigenbaum, J.2
  • 5
    • 4344573261 scopus 로고    scopus 로고
    • Reducing the servers' computation in private information retrieval: PIR with preprocessing
    • Proc. CRYPTO 2000, LNCS 1880, pages 56-74. To appear in
    • 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.
    • Journal of Cryptology.
    • Beimel, A.1    Ishai, Y.2    Malkin, T.3
  • 6
    • 1642602228 scopus 로고    scopus 로고
    • Computationally private information retrieval with poly logarithmic communication
    • LNCS 1592
    • C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with poly logarithmic communication. In Proc. EUROCRYPT '99, LNCS 1592, pages 402-414.
    • Proc. EUROCRYPT '99 , pp. 402-414
    • Cachin, C.1    Micali, S.2    Stadler, M.3
  • 7
  • 8
    • 0036041924 scopus 로고    scopus 로고
    • Randomness conductors and constant-degree expansion beyond the degree/2 barrier
    • 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.
    • (2002) Proc. 34th STOC , pp. 659-668
    • Capalbo, M.1    Reingold, O.2    Vadhan, S.3    Wigderson, A.4
  • 10
    • 0032201622 scopus 로고    scopus 로고
    • 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.
    • (1998) Journal Version: J. of the ACM , vol.45 , pp. 965-981
  • 12
    • 80051636706 scopus 로고    scopus 로고
    • Single database private information retrieval implies oblivious transfer
    • G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single Database Private Information Retrieval Implies Oblivious Transfer. In Proc. EUROCRYPT 2000, pages 122-138.
    • (2000) Proc. EUROCRYPT , pp. 122-138
    • Di Crescenzo, G.1    Malkin, T.2    Ostrovsky, R.3
  • 13
    • 0022080529 scopus 로고
    • A randomized protocol for signing contracts
    • S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. C. ACM, 28:637-647, 1985.
    • (1985) C. ACM , vol.28 , pp. 637-647
    • Even, S.1    Goldreich, O.2    Lempel, A.3
  • 15
    • 84937574654 scopus 로고    scopus 로고
    • A random server model for private information retrieval
    • LNCS 1518
    • 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.
    • (1998) Proc. 2nd RANDOM , pp. 200-217
    • Gertner, Y.1    Goldwasser, S.2    Malkin, T.3
  • 16
    • 0031624875 scopus 로고    scopus 로고
    • Protecting data privacy in private information retrieval schemes
    • 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.
    • (1998) Proc. 30th STOC , pp. 151-160
    • Gertner, Y.1    Ishai, Y.2    Kushilevitz, E.3    Malkin, T.4
  • 17
    • 0034205020 scopus 로고    scopus 로고
    • 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.
    • (2000) Journal Version: J. of Computer and System Sciences , vol.60 , Issue.3 , pp. 592-629
  • 19
    • 0030706544 scopus 로고    scopus 로고
    • P=BPP unless E has subexponential circuits: Derandomizing the XOR lemma
    • R. Impagliazzo, A. Wigderson. P=BPP unless E has Subexponential Circuits: Derandomizing the XOR Lemma. In Proc. 29th STOC, pages 220-229, 1997.
    • (1997) Proc. 29th STOC , pp. 220-229
    • Impagliazzo, R.1    Wigderson, A.2
  • 20
    • 0033720713 scopus 로고    scopus 로고
    • On the efficiency of local decoding procedures for error-correcting codes
    • J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proc. 32nd STOC, pages 80-86, 2000.
    • (2000) Proc. 32nd STOC , pp. 80-86
    • Katz, J.1    Trevisan, L.2
  • 21
    • 0026963441 scopus 로고
    • A note on efficient zero-knowledge proofs and arguments
    • Extended Abstract
    • J. Kilian. A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract). In Proc. 24th STOC, pages 723-732, 1992.
    • (1992) Proc. 24th STOC , pp. 723-732
    • Kilian, J.1
  • 22
    • 0031378815 scopus 로고    scopus 로고
    • Replication is not needed: Single database, computationally-private information retrieval
    • E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proc. 38th FOCS, pages 364-373, 1997.
    • (1997) Proc. 38th FOCS , pp. 364-373
    • Kushilevitz, E.1    Ostrovsky, R.2
  • 25
    • 0034819509 scopus 로고    scopus 로고
    • Communication preserving protocols for secure function evaluation
    • M. Naor, and K. Nissim. Communication preserving protocols for secure function evaluation. In Proc. 33rd STOC, pages 590-599, 2001.
    • (2001) Proc. 33rd STOC , pp. 590-599
    • Naor, M.1    Nissim, K.2
  • 26
    • 0032669864 scopus 로고    scopus 로고
    • Oblivious transfer and polynomial evaluation
    • M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31st STOC, pages 245-254, 1999.
    • (1999) Proc. 31st STOC , pp. 245-254
    • Naor, M.1    Pinkas, B.2
  • 27
    • 84957096920 scopus 로고    scopus 로고
    • Oblivious transfer with adaptive queries
    • LNCS 1666
    • M. Naor and B. Pinkas. Oblivious transfer with adaptive queries. In Proc. CRYPTO '99, LNCS 1666, pages 573-590.
    • Proc. CRYPTO '99 , pp. 573-590
    • Naor, M.1    Pinkas, B.2
  • 28
    • 0003462641 scopus 로고
    • How to exchange secrets by oblivious transfer
    • Harvard Aiken Computation Laboratory
    • M. O. Rabin. How to exchange secrets by oblivious transfer. Technical report TR-81, Harvard Aiken Computation Laboratory, 1981.
    • (1981) Technical Report , vol.TR-81
    • Rabin, M.O.1
  • 29
    • 0004982539 scopus 로고
    • Efficient dispersal of information for security, load balancing, and fault tolerance
    • M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 38, pages 335-348, 1985.
    • (1985) J. ACM , vol.38 , pp. 335-348
    • Rabin, M.O.1
  • 30
    • 0035175916 scopus 로고    scopus 로고
    • Simple extractors for all min-entropies and a new pseudo-random generator
    • 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.
    • (2001) Proc. 42nd FOCS , pp. 648-657
    • Shaltiel, R.1    Umans, C.2
  • 32
    • 0032686554 scopus 로고    scopus 로고
    • Pseudorandom generators without the XOR lemma
    • Extended Abstract
    • M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom Generators Without the XOR Lemma (Extended Abstract). In Proc. 31st STOC, pages 537-546, 1999.
    • (1999) Proc. 31st STOC , pp. 537-546
    • Sudan, M.1    Trevisan, L.2    Vadhan, S.3
  • 33
    • 0034832181 scopus 로고    scopus 로고
    • Loss-less condensers, unbalanced expanders, and extractors
    • A. Ta-Shma, C. Umans, and D. Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proc. 33rd STOC, pages 143-152, 2001.
    • (2001) Proc. 33rd STOC , pp. 143-152
    • Ta-Shma, A.1    Umans, C.2    Zuckerman, D.3
  • 35
    • 0019591034 scopus 로고
    • Should tables be sorted?
    • A. C. C. Yao. Should tables be sorted? J. of the ACM, 28(3):615-628, 1981.
    • (1981) J. of the ACM , vol.28 , Issue.3 , pp. 615-628
    • Yao, A.C.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.