메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 644-647

Authenticated query flooding in sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; QUERY LANGUAGES; TELECOMMUNICATION NETWORKS;

EID: 33750315272     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PERCOMW.2006.23     Document Type: Conference Paper
Times cited : (9)

References (9)
  • 1
    • 0032661699 scopus 로고    scopus 로고
    • Multicast security: A taxonomy and some efficient constructions
    • New York, NY, Mar. IEEE
    • R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas. Multicast security: A taxonomy and some efficient constructions. In Proc. IEEE INFOCOM'99, volume 2, pages 708-716, New York, NY, Mar. 1999. IEEE.
    • (1999) Proc. IEEE INFOCOM'99 , vol.2 , pp. 708-716
    • Canetti, R.1    Garay, J.2    Itkis, G.3    Micciancio, D.4    Naor, M.5    Pinkas, B.6
  • 5
    • 84901201715 scopus 로고    scopus 로고
    • Moteiv, Inc. Telos revision B datasheet. Available at http://www.moteiv.com/products/docs/telos-revb-datasheet.pdf.
    • Telos Revision B Datasheet
  • 7
    • 24644449780 scopus 로고    scopus 로고
    • Efficient cooperative signatures: A novel authentication scheme for sensor networks
    • number 3450 in LNCS, April
    • S. Seys and B. Preneel. Efficient cooperative signatures: A novel authentication scheme for sensor networks. In 2nd International Conference on Security in Pervasive Computing, number 3450 in LNCS, pages 86 - 100, April 2005.
    • (2005) 2nd International Conference on Security in Pervasive Computing , pp. 86-100
    • Seys, S.1    Preneel, B.2
  • 8
    • 1042289031 scopus 로고    scopus 로고
    • The number of neighbors needed for connectivity of wireless networks
    • F. Xue and P. R. Kumar. The number of neighbors needed for connectivity of wireless networks. Wirel. Netw., 10(2):169-181, 2004.
    • (2004) Wirel. Netw. , vol.10 , Issue.2 , pp. 169-181
    • Xue, F.1    Kumar, P.R.2
  • 9
    • 84943553152 scopus 로고    scopus 로고
    • Establishing pair-wise keys for secure communication in ad hoc networks: A probabilistic approach
    • November
    • S. Zhu, S. Xu, S. Setia, and S. Jajodia. Establishing pair-wise keys for secure communication in ad hoc networks: A probabilistic approach. In IEEE International Conference on Network Protocols, November 2003.
    • (2003) IEEE International Conference on Network Protocols
    • Zhu, S.1    Xu, S.2    Setia, S.3    Jajodia, S.4


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