H. Luo, P.Zerfos, J.Kong, S. Lu and L.Zhang, Self-securing Ad Hoc Wireless Networks, 7th IEEE Symposium on Computers and Communications (ISCC'02), July 2002, Italy. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Formally Verified Decentralized Key Management.. - Law, Corin, Etalle.. (2003) (1 citation) (Correct)
.... the set of master keys, the corresponding pseudorandom number generator and the seed are easily exposed and hence the active key of any cell can be found out. The requirement of nodes being able to discover their coordinates is also too demanding for our case. Luo et al. s localized trust model [9] is not exactly a key management architecture proposal, but it can be regarded as such. This model is based on (k, n) threshold secret sharing, wherein a system secret key (of a public private key pair) is shared among every n nodes, and a node is only trusted if it acquires a certificate issued ....
H. Luo, P. Zerfos, J. Kong, S. Lu, and L. Zhang. Self-securing ad hoc wireless networks. In 7th IEEE Symp. on Computers and Communications, pages 567--574, 2002.
Secure Routing in Wireless Sensor Networks: Attacks and.. - Karlof, Wagner (2002) (26 citations) (Correct)
....are several reasons for why this is so, but they all relate to the differences between sensor and ad hoc networks enumerated in the previous section. Some ad hoc network security mechanisms for authentication and secure routing protocols are based on public key cryptography [8] 10] 11] 12] [13], 14] 15] 16] Public key cryptography is too expensive for sensor nodes. Security protocols for sensors networks must rely exclusively on efficient symmetric key cryptography. Secure routing protocols for ad hoc networks based on symmetric key cryptography have been proposed [17] 18] ....
H. Luo, P. Zefros, J. Kong, S. Lu, and L. Zhang, "Self-securing ad hoc wireless networks," in Seventh IEEE Symposium on Computers and Communications (ISCC '02), 2002.
Secure Routing in Wireless Sensor Networks: Attacks and.. - Karlof, Wagner (2002) (26 citations) (Correct)
....are several reasons for why this is so, but they all relate to the differences between sensor and ad hoc networks enumerated in the previous section. Some ad hoc network security mechanisms for authentication and secure routing protocols are based on public key cryptography [8] 10] 11] 12] [13], 14] 15] 16] Public key cryptography is too expensive for sensor nodes. Security protocols for sensors networks must rely exclusively on efficient symmetric key cryptography. Secure routing protocols for ad hoc networks based on symmetric key cryptography have been proposed [17] 18] ....
H. Luo, P. Zefros, J. Kong, S. Lu, and L. Zhang, "Self-securing ad hoc wireless networks," in Seventh IEEE Symposium on Computers and Communications (ISCC '02), 2002.
Sprite: A Simple, Cheat-Proof, Credit-Based System for.. - Zhong, Chen, Yang (2002) (9 citations) (Correct)
....through a wireless overlay network [25] e.g. using GPRS in a wide area environment, while switching to 802.11 or Bluetooth in an indoor environment. To identify each node, we assume that each node has a certificate issued by a scalable certificate authority such as those proposed in [26] [27]. For concreteness of presentation, we assume that the sender knows the full path from the sender to the destination, using a secure ad hoc routing protocol based on DSR [28] 29] 30] The incentive issues of route discovery will be investigated in Section VI. When a node sends its own ....
H. Luo, P. Zerfos, J. Kong, S. Lu, and L. Zhang, "Self-securing ad-hoc wireless networks," in ISCC, 2002. [Online]. Available: http://www.cs.ucla.edu/jkong/publications/ISCC02.pdf
Distributed Authentication for Peer-to-Peer Networks - Gokhale, Dasgupta (2003) (1 citation) (Correct)
....and trust management) is based on the notion of trust and it is not well defined for ad hoc networks. Centralized security solutions for ad hoc networks could be significantly vulnerable [2] Recently, a lot of effort has been put in providing security infrastructure for ad hoc networks [2, 3, 4, 5]. These efforts aim at distributing CA functionality to a set of nodes in the network. In this paper, we propose, troups, a cryptographically secure, fault tolerant, scalable trust model for resilient peer to peer networks. Our design employs a secure group based approach for the creation of a ....
....is illustrated in Section 3. Section 4 provides the security protocols for this trust model. It also illustrates that the constructs are cryptographically secure. The implementation of the verification protocol and performance results are provided in Section 5. 2 Background Recent publications [2, 4, 5] propose the idea of making existing authentication models in the Internet (Hierarchical and PGP) 1] suitable for mobile ad hoc networks. 2.1 Threshold Cryptography In [2, 4] the use of threshold cryptography is proposed to distribute CA functionality to various nodes. In [4] private key of ....
[Article contains additional citation context not shown here]
Luo, Zerfos, Kong, Lu and Zhang, "Selfsecuring Ad Hoc Wireless Networks," ISCC '02
Key Management with Group-Wise Pre-Deployed Keying and.. - Law, Etalle, Hartel (2002) (Correct)
....# such that g input (key) # # (g # input (share 1 ) g # input (share t 1 ) 1) The RSA signature function is homomorphic, and thus satisfies this property. The bottomline of this insight is that a distributed public key infrastructure that is similar to Luo et al. s local trust model [5] can now be established. In this model, every node has a public private key pair and is only trusted if it owns a certificate (carrying its identity and public key) signed by t 1 trusted neighbours. For pairwise keying, Di#e Hellman derived or RSA protocols can be used, whereas one of the many ....
H. Luo, P. Zerfos, J. Kong, S. Lu, and L. Zhang. Self-securing ad hoc wireless networks. In The 7th IEEE Symposium on Computers and Communications, 2002.
Trust Model Based Self-Organized Routing Protocol for Secure Ad Hoc .. - Li Self-citation (Kong) (Correct)
No context found.
H. Luo, P. Zerfos, J. Kong, S. Lu, and L. Zhang. Self-securing ad hoc wireless networks. In IEEE ISCC02, 2002. 58
Cooperation in Mobile Ad Hoc Networks - Hu (2005) (Correct)
No context found.
H. Luo, P.Zerfos, J.Kong, S. Lu and L.Zhang, Self-securing Ad Hoc Wireless Networks, 7th IEEE Symposium on Computers and Communications (ISCC'02), July 2002, Italy.
Providing Efficient Certification Services Against .. - Zhu, Wang, Wan.. (Correct)
No context found.
Haiyun Luo, Jiejun Kong, Petros Zerfos, Songwu Lu, and Lixia Zhang, "Self-securing ad hoc wireless networks," in Seventh IEEE Symposium on Computers and Communications (ISCC'02), 2002.
On the Utility of Distributed Cryptography in P2P and.. - Narasimha, Tsudik, Yi (2003) (Correct)
No context found.
H. Luo, P. Zerfos, J. Kong, S. Lu, and L. Zhang. Self-securing ad hoc wireless networks. In ISCC, 2002.
Admission Control in Peer-to-Peer: Design and Performance.. - Saxena, Tsudik, Yi (2003) (1 citation) (Correct)
No context found.
H. Luo, P. Zerfos, J. Kong, S. Lu, and L. Zhang. Self-securing Ad Hoc Wireless Networks. In Seventh IEEE Symposium on Computers and Communications (ISCC '02), 2002.
A Cluster-Based Security Architecture for Ad Hoc Networks - Bechler, Hof, Kraft.. (2004) (Correct)
No context found.
H. Luo, P. Zerfos, J. Kong, S. Lu, and L. Zhang, "Self-securing ad hoc wireless networks," in Proc. 7th IEEE Symp. on Comp. and Communications (ISCC), Taormina, 2002.
Secure Cooperative Routing in Mobile Ad-hoc Networks - Ngai (2002) (Correct)
No context found.
Jiejun Kong Songwu Lu Lizia Zhung Haiyun Luo, Petros Zerfos. Selfsecuring ad hoc wireless networks. ISCC, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC