메뉴 건너뛰기




Volumn , Issue , 2011, Pages 326-330

Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs

Author keywords

Key predistribution; Pairwise keys; Security; Steiner Trades

Indexed keywords

COMBINATORIAL APPROACH; COMBINATORIAL DESIGN; CONNECTIVITY GRAPH; KEY CHAIN; KEY DISTRIBUTION; KEY ESTABLISHMENTS; KEY MANAGEMENT; KEY POOL; KEY PRE-DISTRIBUTION; LOW-STORAGE; MOBILE SENSOR NETWORKS; NOVEL CONCEPT; PAIRWISE KEY; PAIRWISE-KEYS; PASSIVE MONITORING; SECURITY; STEINER TRADES;

EID: 79960859750     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935175     Document Type: Conference Paper
Times cited : (43)

References (21)
  • 1
    • 51249087814 scopus 로고    scopus 로고
    • TinyECC: A configurable library for elliptic curve cryptography in wireless sensor networks
    • IEEE Computer Society
    • A. Liu and P. Ning, "TinyECC: A configurable library for elliptic curve cryptography in wireless sensor networks," in IPSN. IEEE Computer Society, 2008, pp. 245-256.
    • (2008) IPSN , pp. 245-256
    • Liu, A.1    Ning, P.2
  • 3
    • 0038487088 scopus 로고    scopus 로고
    • Random key predistribution schemes for sensor networks
    • IEEE Computer Society
    • H. Chan, A. Perrig, and D. X. Song, "Random key predistribution schemes for sensor networks," in IEEE Symposium on Security and Privacy. IEEE Computer Society, 2003, pp. 197-213.
    • (2003) IEEE Symposium on Security and Privacy , pp. 197-213
    • Chan, H.1    Perrig, A.2    Song, D.X.3
  • 4
    • 85028765277 scopus 로고
    • Perfectly-secure key distribution for dynamic conferences
    • Advances in Cryptology: Proceedings of CRYPTO'92, Santa Barbara, CA
    • C. Blundo, A. D. Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, "Perfectly-secure key distribution for dynamic conferences," In Advances in Cryptology: Proceedings of CRYPTO'92, Santa Barbara, CA, Lecture Notes in Computer Science, vol. 740, pp. 471-486, 1993.
    • (1993) Lecture Notes in Computer Science , vol.740 , pp. 471-486
    • Blundo, C.1    Santis, A.D.2    Herzberg, A.3    Kutten, S.4    Vaccaro, U.5    Yung, M.6
  • 7
    • 35048867517 scopus 로고    scopus 로고
    • Combinatorial design of key distribution mechanisms for wireless sensor networks
    • ESORICS, ser., P. Samarati, P. Y. A. Ryan, D. Gollmann, and R. Molva, Eds. Springer
    • S. A. Çamtepe and B. Yener, "Combinatorial design of key distribution mechanisms for wireless sensor networks," in ESORICS, ser. Lecture Notes in Computer Science, P. Samarati, P. Y. A. Ryan, D. Gollmann, and R. Molva, Eds., vol. 3193. Springer, 2004, pp. 293-308.
    • (2004) Lecture Notes in Computer Science , vol.3193 , pp. 293-308
    • Çamtepe, S.A.1    Yener, B.2
  • 8
    • 23944461491 scopus 로고    scopus 로고
    • A one round protocol for tripartite diffie-hellman
    • A. Joux, "A one round protocol for tripartite diffie-hellman," J. Cryptology, vol. 17, no. 4, pp. 263-276, 2004.
    • (2004) J. Cryptology , vol.17 , Issue.4 , pp. 263-276
    • Joux, A.1
  • 10
    • 84943553152 scopus 로고    scopus 로고
    • Establishing pairwise keys for secure communication in ad hoc networks: A probabilistic approach
    • IEEE Computer Society
    • S. Zhu, S. Xu, S. Setia, and S. Jajodia, "Establishing pairwise keys for secure communication in ad hoc networks: A probabilistic approach," in ICNP. IEEE Computer Society, 2003, pp. 326-335.
    • (2003) ICNP , pp. 326-335
    • Zhu, S.1    Xu, S.2    Setia, S.3    Jajodia, S.4
  • 11
    • 34548396246 scopus 로고    scopus 로고
    • Secure pairwise key establishment in largescale sensor networks: An area partitioning and multigroup key predistribution approach
    • D. Huang and D. Medhi, "Secure pairwise key establishment in largescale sensor networks: An area partitioning and multigroup key predistribution approach," TOSN, vol. 3, no. 3, pp. 16:1-16:34, 2007.
    • (2007) TOSN , vol.3 , Issue.3 , pp. 161-1634
    • Huang, D.1    Medhi, D.2
  • 12
    • 25844435733 scopus 로고    scopus 로고
    • PIKE: Peer intermediaries for key establishment in sensor networks
    • IEEE
    • H. Chan and A. Perrig, "PIKE: peer intermediaries for key establishment in sensor networks," in INFOCOM. IEEE, 2005, pp. 524-535.
    • (2005) INFOCOM , pp. 524-535
    • Chan, H.1    Perrig, A.2
  • 14
    • 24944550584 scopus 로고    scopus 로고
    • A combinatorial approach to key predistribution for distributed sensor networks
    • New Orleans, LA, USA
    • J. Lee and D. R. Stinson, "A combinatorial approach to key predistribution for distributed sensor networks," in IEEE Wireless Communications and Networking Conference, WCNC 2005, New Orleans, LA, USA, 2005, pp. 1200-1205.
    • (2005) IEEE Wireless Communications and Networking Conference, WCNC 2005 , pp. 1200-1205
    • Lee, J.1    Stinson, D.R.2
  • 15
    • 38149112542 scopus 로고    scopus 로고
    • Key predistribution using partially balanced designs in wireless sensor networks
    • ISPA, ser., I. Stojmenovic, R. K. Thulasiram, L. T. Yang, W. Jia, M. Guo, and R. F. de Mello, Eds., Springer
    • S. Ruj and B. Roy, "Key predistribution using partially balanced designs in wireless sensor networks," in ISPA, ser. Lecture Notes in Computer Science, I. Stojmenovic, R. K. Thulasiram, L. T. Yang, W. Jia, M. Guo, and R. F. de Mello, Eds., vol. 4742. Springer, 2007, pp. 431-445.
    • (2007) Lecture Notes in Computer Science , vol.4742 , pp. 431-445
    • Ruj, S.1    Roy, B.2
  • 16
    • 79960856104 scopus 로고    scopus 로고
    • Springer-Verlag, ch. Key Predistribution in Wireless Sensor Networks when Sensors are within Communication Range. (In Press)
    • S. Ruj, A. Nayak, and I. Stojmenovic, Theoretical Aspects of Distributed Computing in Sensor Networks. Springer-Verlag, 2010, ch. Key Predistribution in Wireless Sensor Networks when Sensors are within Communication Range. (In Press).
    • (2010) Theoretical Aspects of Distributed Computing in Sensor Networks
    • Ruj, S.1    Nayak, A.2    Stojmenovic, I.3
  • 20
    • 38049169746 scopus 로고    scopus 로고
    • On minimum possible volumes of strong steiner trades
    • N. Hamilton and A. Khodkar, "On minimum possible volumes of strong steiner trades," Australasian Journal of Combinatorics, vol. 20, pp. 197-203, 1999.
    • (1999) Australasian Journal of Combinatorics , vol.20 , pp. 197-203
    • Hamilton, N.1    Khodkar, A.2
  • 21
    • 33748959977 scopus 로고    scopus 로고
    • Establishing pairwise keys in heterogeneous sensor networks
    • IEEE
    • P. Traynor, H. Choi, G. Cao, S. Zhu, and T. L. Porta, "Establishing pairwise keys in heterogeneous sensor networks," in INFOCOM. IEEE, 2006.
    • (2006) INFOCOM
    • Traynor, P.1    Choi, H.2    Cao, G.3    Zhu, S.4    Porta, T.L.5


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