SCOPUS 정보 검색 플랫폼

Volumn E82-A, Issue 1, 1999, Pages 11-20

Efficient private information retrieval

Author keywords

Communication complexity; Covering codes; Information retrieval; Privacy; Time complexity

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DATA PRIVACY; DATABASE SYSTEMS; INFORMATION RETRIEVAL; INTERACTIVE COMPUTER SYSTEMS;

COMMUNICATION COMPLEXITY; PRIVATE INFORMATION RETRIEVAL;

SECURITY OF DATA;

EID: 0032620922 PISSN: 09168508 EISSN: None Source Type: Journal
DOI: None Document Type: Article

Times cited : (24)

References (10)

1
- 84951063457
- Proc. ICALP, Lecture Notes in Computer Science, vol. 1256, pp.401-409, 1997.
- A. Ambainis, "Upper bound on the communication complexity of private information retrieval," Proc. ICALP, Lecture Notes in Computer Science, vol. 1256, pp.401-409, 1997.
- "Upper Bound on the Communication Complexity of Private Information Retrieval,"
- Ambainis, A.¹

2
- 84898945449
- Proc. 20th ACM Symposium on Theory of Computing, pp.113-131, 1988.
- M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson, "Multi-prover interactive proofs: How to remove intractability assumptions," Proc. 20th ACM Symposium on Theory of Computing, pp.113-131, 1988.
- S. Goldwasser, J. Kilian, and A. Wigderson, "Multi-prover Interactive Proofs: how to Remove Intractability Assumptions,"
- Ben-Or, M.¹

3
- 0030645563
- Proc. 29th ACM Symposium on Theory of Computing, pp.304-313, 1997.
- B. Chor and N. Gilboa, "Computationally information retrieval," Proc. 29th ACM Symposium on Theory of Computing, pp.304-313, 1997.
- And N. Gilboa, "Computationally Information Retrieval,"
- Chor, B.¹

4
- 0029541045
- Proc. 36th IEEE Symposium on Foundations of Computer Science, pp.41-50, 1995.
- B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, "Private information retrieval," Proc. 36th IEEE Symposium on Foundations of Computer Science, pp.41-50, 1995.
- O. Goldreich, E. Kushilevitz, and M. Sudan, "Private Information Retrieval,"
- Chor, B.¹

5
- 0021409284
- Journal of Computer and System Sciences, vol.28, pp.270299, 1984.
- S. Goldwasser and S. Micali, "Probabilistic encryption," Journal of Computer and System Sciences, vol.28, pp.270299, 1984.
- And S. Micali, "Probabilistic Encryption,"
- Goldwasser, S.¹

6
- 0025115363
- Proc. 22nd ACM Symposium on Theory of Computing, pp.395-404, 1990.
- J. Hâstad, "Pseudo-random generators with uniform assumptions," Proc. 22nd ACM Symposium on Theory of Computing, pp.395-404, 1990.
- "Pseudo-random Generators with Uniform Assumptions,"
- Hâstad, J.¹

7
- 0024866111
- Proc. 30th IEEE Symposium on Foundations of Computer Science, pp.12-24, 1989.
- R. Impagliazzo, L.A. Levin, and M. Luby, "Pseudo-random generation from one-way functions," Proc. 30th IEEE Symposium on Foundations of Computer Science, pp.12-24, 1989.
- L.A. Levin, and M. Luby, "Pseudo-random Generation from One-way Functions,"
- Impagliazzo, R.¹

8
- 0031378815
- Proc. 38th IEEE Symposium on Foundations of Computer Science, pp.364-373, 1997.
- E. Kushilevitz and R. Ostrovsky, "Replication is not needed: Single database, computationally-private information retrieval," Proc. 38th IEEE Symposium on Foundations of Computer Science, pp.364-373, 1997.
- And R. Ostrovsky, "Replication Is not Needed: Single Database, Computationally-private Information Retrieval,"
- Kushilevitz, E.¹

9
- 85027152755
- Cambridge University Press, 1995.
- R. Motwani and P. Raghavan, "Randomized Algorithms," Cambridge University Press, 1995.
- And P. Raghavan, "Randomized Algorithms,"
- Motwani, R.¹

10
- 85027110741
- 9th edition, North-Holland, 1990.
- F.J. MacWilliams and N.J. A. Sloane, "The Theory of ErrorCorrecting Codes," 9th edition, North-Holland, 1990.
- And N.J. A. Sloane, "The Theory of ErrorCorrecting Codes,"
- MacWilliams, F.J.¹

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