메뉴 건너뛰기




Volumn 6056 LNCS, Issue , 2010, Pages 107-123

Multi-query computationally-private information retrieval with constant communication rate

Author keywords

Computationally private information retrieval; lower bound on communication; multi query CPIR

Indexed keywords

CLIENT SERVER; COMMUNICATION RATE; COMPUTATIONALLY-PRIVATE INFORMATION RETRIEVAL; CONSTANT FACTORS; DATABASE SIZE; LOWER BOUNDS; MULTI-QUERY CPIR; NATURAL EXTENSION; NON-TRIVIAL; PRIVACY PROBLEMS;

EID: 79955529260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13013-7_7     Document Type: Conference Paper
Times cited : (36)

References (13)
  • 1
    • 24944522481 scopus 로고    scopus 로고
    • A tool kit for finding small roots of bivariate polynomials over the integers
    • Advances in Cryptology - EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Proceedings
    • Blömer, J., May, A.: A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 251-267. Springer, Heidelberg (2005) (Pubitemid 41313957)
    • (2005) Lecture Notes in Computer Science , vol.3494 , pp. 251-267
    • Blomer, J.1    May, A.2
  • 2
    • 1642602228 scopus 로고    scopus 로고
    • Computational private information retrieval with polylogarithmic communication
    • Stern, J. (ed.). Springer, Heidelberg
    • Cachin, C., Micali, S., Stadler, M.: Computational Private Information Retrieval with Polylogarithmic Communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402-414. Springer, Heidelberg (1999)
    • (1999) EUROCRYPT 1999. LNCS , vol.1592 , pp. 402-414
    • Cachin, C.1    Micali, S.2    Stadler, M.3
  • 4
    • 84947916423 scopus 로고    scopus 로고
    • Finding a small root of a bivariate integer equation; Factoring with high bits known
    • Coppersmith, D.: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. In: Maurer [11], pp. 178-189
    • Maurer [11] , pp. 178-189
    • Coppersmith, D.1
  • 5
    • 84947924912 scopus 로고    scopus 로고
    • Finding a small root of a univariate modular equation
    • Coppersmith, D.: Finding a Small Root of a Univariate Modular Equation. In: Maurer [11], pp. 155-165
    • Maurer [11] , pp. 155-165
    • Coppersmith, D.1
  • 6
    • 26444512068 scopus 로고    scopus 로고
    • Single-database private information retrieval with constant communication rate
    • Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005. Proceedings
    • Gentry, C., Ramzan, Z.: Single-Database Private Information Retrieval with Constant Communication Rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803-815. Springer, Heidelberg (2005) (Pubitemid 41436148)
    • (2005) Lecture Notes in Computer Science , vol.3580 , pp. 803-815
    • Gentry, C.1    Ramzan, Z.2
  • 9
    • 0031378815 scopus 로고    scopus 로고
    • Replication is not needed: Single database, computationally-private information retrieval
    • Miami Beach, Florida, October 20-22, IEEE Computer Society, Los Alamitos
    • Kushilevitz, E., Ostrovsky, R.: Replication is Not Needed: Single Database, Computationally-Private Information Retrieval. In: 38th Annual Symposium on Foundations of Computer Science, Miami Beach, Florida, October 20-22, pp. 364-373. IEEE Computer Society, Los Alamitos (1997)
    • (1997) 38th Annual Symposium on Foundations of Computer Science , pp. 364-373
    • Kushilevitz, E.1    Ostrovsky, R.2
  • 10
    • 33645970169 scopus 로고    scopus 로고
    • An oblivious transfer protocol with log-squared communication
    • Zhou, J., López, J., Deng, R.H., Bao, F. (eds.). Springer, Heidelberg
    • Lipmaa, H.: An Oblivious Transfer Protocol with Log-Squared Communication. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 314-328. Springer, Heidelberg (2005)
    • (2005) ISC 2005. LNCS , vol.3650 , pp. 314-328
    • Lipmaa, H.1
  • 11
    • 0002914851 scopus 로고    scopus 로고
    • Springer, Heidelberg
    • Maurer, U. (ed.): EUROCRYPT 1996. LNCS, vol. 1070. Springer, Heidelberg (1996)
    • (1996) EUROCRYPT 1996. LNCS , vol.1070
    • Maurer, U.1
  • 13
    • 84919085619 scopus 로고
    • An improved algorithm for computing logarithms over gf(p) and its cryptographic significance
    • Pohlig, S., Hellman, M.: An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance. IEEE Transactions on Information Theory 24, 106-110 (1978)
    • (1978) IEEE Transactions on Information Theory , vol.24 , pp. 106-110
    • Pohlig, S.1    Hellman, M.2


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