메뉴 건너뛰기




Volumn , Issue , 2013, Pages 314-325

Secure and efficient range queries on outsourced databases using R̂-trees

Author keywords

[No Author keywords available]

Indexed keywords

ENCRYPTED DATABASE; HALF-SPACE; OUTSOURCED DATABASES; PLAINTEXT; RANGE QUERY;

EID: 84881329100     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2013.6544835     Document Type: Conference Paper
Times cited : (113)

References (28)
  • 2
    • 85122602758 scopus 로고    scopus 로고
    • Chapman & Hall/Crc Cryptography and Network Security Series. Chapman & Hall/CRC
    • J. Katz and Y. Lindell, Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series). Chapman & Hall/CRC, 2007.
    • (2007) Introduction to Modern Cryptography
    • Katz, J.1    Lindell, Y.2
  • 3
    • 67649651664 scopus 로고    scopus 로고
    • Outsourcing search services on private spatial data
    • M. L. Yiu, G. Ghinita, C. S. Jensen, and P. Kalnis, "Outsourcing search services on private spatial data," in ICDE, 2009, pp. 1140-1143.
    • (2009) ICDE , pp. 1140-1143
    • Yiu, M.L.1    Ghinita, G.2    Jensen, C.S.3    Kalnis, P.4
  • 4
    • 84925827178 scopus 로고    scopus 로고
    • Privacy-preserving logarithmic-time search on encrypted data in cloud
    • Y. Lu, "Privacy-preserving logarithmic-time search on encrypted data in cloud," in NDSS, 2012.
    • (2012) NDSS
    • Lu, Y.1
  • 6
    • 44449129423 scopus 로고    scopus 로고
    • Predicate encryption supporting disjunctions, polynomial equations, and inner products
    • J. Katz, A. Sahai, and B. Waters, "Predicate encryption supporting disjunctions, polynomial equations, and inner products," in EUROCRYPT, 2008, pp. 146-162.
    • (2008) EUROCRYPT , pp. 146-162
    • Katz, J.1    Sahai, A.2    Waters, B.3
  • 7
    • 57949088292 scopus 로고    scopus 로고
    • Conjunctive, subset, and range queries on encrypted data
    • D. Boneh and B. Waters, "Conjunctive, subset, and range queries on encrypted data," IACR Cryptology ePrint Archive, vol. 2006, p. 287, 2006.
    • (2006) IACR Cryptology ePrint Archive , vol.2006 , pp. 287
    • Boneh, D.1    Waters, B.2
  • 9
    • 84861186664 scopus 로고    scopus 로고
    • Secure multidimensional range queries over outsourced data
    • B. Hore, S. Mehrotra, M. Canim, and M. Kantarcioglu, "Secure multidimensional range queries over outsourced data," The VLDB Journal, vol. 21, pp. 333-358, 2012.
    • (2012) The VLDB Journal , vol.21 , pp. 333-358
    • Hore, B.1    Mehrotra, S.2    Canim, M.3    Kantarcioglu, M.4
  • 11
    • 70350649061 scopus 로고    scopus 로고
    • Predicate privacy in encryption systems
    • E. Shen, E. Shi, and B. Waters, "Predicate privacy in encryption systems," in TCC, 2009, pp. 457-473.
    • (2009) TCC , pp. 457-473
    • Shen, E.1    Shi, E.2    Waters, B.3
  • 12
    • 80051880293 scopus 로고    scopus 로고
    • Authorized private keyword search over encrypted data in cloud computing
    • IEEE Computer Society
    • M. Li, S. Yu, N. Cao, and W. Lou, "Authorized private keyword search over encrypted data in cloud computing," in ICDCS. IEEE Computer Society, 2011, pp. 383-392.
    • (2011) ICDCS , pp. 383-392
    • Li, M.1    Yu, S.2    Cao, N.3    Lou, W.4
  • 13
    • 85065578926 scopus 로고    scopus 로고
    • A privacy-preserving index for range queries
    • B. Hore, S. Mehrotra, and G. Tsudik, "A privacy-preserving index for range queries," in VLDB, 2004, pp. 720-731.
    • (2004) VLDB , pp. 720-731
    • Hore, B.1    Mehrotra, S.2    Tsudik, G.3
  • 15
    • 80052002672 scopus 로고    scopus 로고
    • Order-preserving encryption revisited: Improved security analysis and alternative solutions
    • A. Boldyreva, N. Chenette, and A. O'Neill, "Order-preserving encryption revisited: Improved security analysis and alternative solutions," in CRYPTO, 2011, pp. 578-595.
    • (2011) CRYPTO , pp. 578-595
    • Boldyreva, A.1    Chenette, N.2    O'Neill, A.3
  • 16
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • ACM
    • A. Guttman, "R-trees: A dynamic index structure for spatial searching," in INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA. ACM, 1984, pp. 47-57.
    • (1984) International Conference on Management of Data , pp. 47-57
    • Guttman, A.1
  • 17
    • 0021900602 scopus 로고
    • A general approach to d-dimensional geometric queries
    • extended abstract
    • A. C.-C. Yao and F. F. Yao, "A general approach to d-dimensional geometric queries (extended abstract)," in STOC, 1985, pp. 163-168.
    • (1985) STOC , pp. 163-168
    • Yao, A.C.-C.1    Yao, F.F.2
  • 19
    • 0001473437 scopus 로고
    • On estimation of a probability density function and mode
    • E. Parzen, "On estimation of a probability density function and mode," The Annals of Mathematical Statistics, vol. 33, no. 3, pp. 1065-1076, 1962.
    • (1962) The Annals of Mathematical Statistics , vol.33 , Issue.3 , pp. 1065-1076
    • Parzen, E.1
  • 20
    • 0002369909 scopus 로고    scopus 로고
    • Empirical choice of histograms and kernel density estimators
    • M. Rudemo, "Empirical choice of histograms and kernel density estimators," Scandinavian Journal of Statistics, vol. 9, no. 2, pp. pp. 65-78.
    • Scandinavian Journal of Statistics , vol.9 , Issue.2 , pp. 65-78
    • Rudemo, M.1
  • 24
    • 0029706786 scopus 로고    scopus 로고
    • A model for the prediction of r-tree performance
    • Y. Theodoridis and T. K. Sellis, "A model for the prediction of r-tree performance," in PODS, 1996, pp. 161-171.
    • (1996) PODS , pp. 161-171
    • Theodoridis, Y.1    Sellis, T.K.2
  • 27
    • 0036606530 scopus 로고    scopus 로고
    • A framework for generating network-based moving objects
    • DOI 10.1023/A:1015231126594
    • T. Brinkhoff, "A framework for generating network-based moving objects," Geoinformatica, vol. 6, pp. 153-180, June 2002. (Pubitemid 34609430)
    • (2002) GeoInformatica , vol.6 , Issue.2 , pp. 153-180
    • Brinkhoff, T.1


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