메뉴 건너뛰기




Volumn , Issue , 2010, Pages

SafeQ: Secure and efficient query processing in sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

DATA ITEMS; EVENT DRIVEN; NOVEL TECHNIQUES; STORAGE NODES; TWO-TIERED SENSOR NETWORKS;

EID: 77953310348     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462094     Document Type: Conference Paper
Times cited : (82)

References (36)
  • 4
    • 33748074817 scopus 로고    scopus 로고
    • Data storage placement in sensor networks
    • B. Sheng, Q. Li, and W. Mao, "Data storage placement in sensor networks," in Proc. 7th ACM MobiHoc, 2006, pp. 344-355.
    • (2006) Proc. 7th ACM MobiHoc , pp. 344-355
    • Sheng, B.1    Li, Q.2    Mao, W.3
  • 5
    • 46849090119 scopus 로고    scopus 로고
    • An approximation algorithm for data storage placement in sensor networks
    • B. Sheng, C. C. Tan, Q. Li, and W. Mao, "An approximation algorithm for data storage placement in sensor networks," in Proc. WASA, 2007, pp. 71-78.
    • Proc. WASA, 2007 , pp. 71-78
    • Sheng, B.1    Tan, C.C.2    Li, Q.3    Mao, W.4
  • 6
    • 51349098378 scopus 로고    scopus 로고
    • Verifiable privacy-preserving range query in two-tiered sensor networks
    • B. Sheng and Q. Li, "Verifiable privacy-preserving range query in two-tiered sensor networks," in Proc. IEEE INFOCOM, 2008, pp. 46-50.
    • Proc. IEEE INFOCOM, 2008 , pp. 46-50
    • Sheng, B.1    Li, Q.2
  • 8
    • 84874396168 scopus 로고    scopus 로고
    • "Rise project," http://www.cs.ucr.edu/rise.
    • Rise Project
  • 9
    • 84870655865 scopus 로고    scopus 로고
    • "Intel lab data," http://berkeley.intel-research.net/labdata.
    • Intel Lab Data
  • 12
    • 0036361105 scopus 로고    scopus 로고
    • Executing sql over encrypted data in the database-service-provider model
    • H. Hacigümüş, B. Iyer, C. Li, and S. Mehrotra, "Executing sql over encrypted data in the database-service-provider model," in Proc. ACM SIGMOD, 2002, pp. 216-227.
    • Proc. ACM SIGMOD, 2002 , pp. 216-227
    • Hacigümüş, H.1    Iyer, B.2    Li, C.3    Mehrotra, S.4
  • 16
    • 33745120364 scopus 로고    scopus 로고
    • Secure conjunctive keyword search over encrypted data
    • P. Golle, J. Staddon, and B. Waters, "Secure conjunctive keyword search over encrypted data," in Proc. 2nd ACNS, 2004, pp. 31-45.
    • Proc. 2nd ACNS, 2004 , pp. 31-45
    • Golle, P.1    Staddon, J.2    Waters, B.3
  • 20
    • 29844457793 scopus 로고    scopus 로고
    • Verifying completeness of relational query results in data publishing
    • H. Pang, A. Jain, K. Ramamritham, and K.-L. Tan, "Verifying completeness of relational query results in data publishing," in Proc. ACM SIGMOD, 2005, pp. 407-418.
    • Proc. ACM SIGMOD, 2005 , pp. 407-418
    • Pang, H.1    Jain, A.2    Ramamritham, K.3    Tan, K.-L.4
  • 21
    • 34548160016 scopus 로고    scopus 로고
    • Authentication of outsourced databases using signature aggregation and chaining
    • M. Narasimha and G. Tsudik, "Authentication of outsourced databases using signature aggregation and chaining," in Proc. DASFAA, 2006.
    • Proc. DASFAA, 2006
    • Narasimha, M.1    Tsudik, G.2
  • 22
    • 33746749406 scopus 로고    scopus 로고
    • Authenticating multi-dimensional query results in data publishing
    • W. Cheng, H. Pang, and K.-L. Tan, "Authenticating multi-dimensional query results in data publishing," in Data and Applications Security 2006, 2006, pp. 60-73.
    • (2006) Data and Applications Security 2006 , pp. 60-73
    • Cheng, W.1    Pang, H.2    Tan, K.-L.3
  • 23
    • 57049158746 scopus 로고    scopus 로고
    • Access control friendly query verification for outsourced data publishing
    • H. Chen, X. Man, W. Hsu, N. Li, and Q. Wang, "Access control friendly query verification for outsourced data publishing," in Proc. ESORICS, 2008, pp. 177-191.
    • Proc. ESORICS, 2008 , pp. 177-191
    • Chen, H.1    Man, X.2    Hsu, W.3    Li, N.4    Wang, Q.5
  • 24
    • 84920380941 scopus 로고    scopus 로고
    • Protocols for public key cryptosystems
    • R. Merkle, "Protocols for public key cryptosystems," in Proc. IEEE S&P, 1980, pp. 122-134.
    • Proc. IEEE S&P, 1980 , pp. 122-134
    • Merkle, R.1
  • 29
    • 0035278163 scopus 로고    scopus 로고
    • Algorithms for packet classification
    • P. Gupta and N. McKeown, "Algorithms for packet classification, " IEEE Network, vol. 15, no. 2, pp. 24-32, 2001.
    • (2001) IEEE Network , vol.15 , Issue.2 , pp. 24-32
    • Gupta, P.1    McKeown, N.2
  • 30
    • 33751232321 scopus 로고    scopus 로고
    • Fast binary and multiway prefix searches for packet forwarding
    • Y.-K. Chang, "Fast binary and multiway prefix searches for packet forwarding," Computer Networks, vol. 51, no. 3, pp. 588-605, 2007.
    • (2007) Computer Networks , vol.51 , Issue.3 , pp. 588-605
    • Chang, Y.-K.1
  • 31
    • 0003196107 scopus 로고    scopus 로고
    • Hmac: Keyed-hashing for message authentication
    • H. Krawczyk, M. Bellare, and R. Canetti, "Hmac: Keyed-hashing for message authentication," RFC 2104, 1997.
    • (1997) RFC 2104
    • Krawczyk, H.1    Bellare, M.2    Canetti, R.3
  • 32
    • 0003195066 scopus 로고
    • The md5 message-digest algorithm
    • R. Rivest, "The md5 message-digest algorithm," RFC 1321, 1992.
    • (1992) RFC 1321
    • Rivest, R.1
  • 33
    • 1542265638 scopus 로고    scopus 로고
    • Us secure hash algorithm 1 (sha1)
    • D. Eastlake and P. Jones, "Us secure hash algorithm 1 (sha1)," RFC 3174, 2001.
    • (2001) RFC 3174
    • Eastlake, D.1    Jones, P.2
  • 34
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. Bloom, "Space/time trade-offs in hash coding with allowable errors," Communications of ACM, vol. 13, no. 7, pp. 422-426, 1970.
    • (1970) Communications of ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.1
  • 36
    • 77953314322 scopus 로고    scopus 로고
    • "Tossim," http://www.cs.berkeley.edu/pal/research/tossim.html.
    • Tossim


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