Wireless sensor network is composed of a number of sensor devices which can communicate with each other through radio wave. The sensor devices are limited with computation ability, communication ability, and memory capacity and battery power. This makes the implementation of any task in Wireless Sensor Network is very challenging. Amid various requirements, secure communication in Wireless sensor Network is a major requirement. Suppose two or more sensor nodes want to communicate with each other securely, they need such an environment which can fulfill all the security requirements amid the constraints mentioned earlier. Therefore, secure communication in this network is not an easy task. Two or more nodes can communicate using any cryptography scheme which can be applicable to this network. Nodes under communication process have to use one or more key for encryption and decryption. Single key for the entire network can serve for encryption and decryption of shared information. However compromising of that key may reveal the whole communication in the network. Therefore, although a single key for an entire network provides a certain range of security to the communication of the network, the resiliency of the network is very low which is not at all acceptable for secure communication. Keeping shared keys for every other node in the network is another option. However, increment of number of nodes in the network increases the key ring size of each node. Although it provides maximum resiliency, however, it suffers from non scalability due to memory constraints of sensor node. Another scheme is public key cryptography, which requires public key and private key for secure communication. It provides good resiliency to the network. However, it consumes much computation which is a limitation for its application in wireless sensor network. udKey pre-distribution is an optimum scheme which loads a finite number of keys to each node taking from a set of predefined keys before deployment of the network. Pair of node which wants to communicate with each other searches for existence of any common key between them and if find start communication using that common key. If no such common key found, they establish a path for exchange of temporarily generated key and start communication using that key. Several key pre-distribution schemes have been proposed for distributing keys for secure communication. udPre-key distribution with merging of blocks is one of the major key pre-distribution schemes. We have studied that merging of nodes randomly incurred an amount of communication cost due to its randomness. We propose a scheme which will merge different blocks in a deterministic way yields a pattern of block ids in a node. Our aim is to decrease the communication task during key establishment. For our case, the communication cost during common key establishment is only O(1) which is constant, whereas in case of random merging it is O(z), where z is the merging factor. Therefore, scheme proposed by us mostly suitable for this type of network. udAgain in case of those communications which require temporary key, the communication is not secure due to the fact that if any intermediate nodes in the path between actual communicators become compromise, then the newly generated communication is revealed to the attacker. We have proposed two schemes which provide security to such temporarily generated key. One of them is Identity based public key cryptography for path key establishment which exchange the newly generated temporary key using Identity based public key encryption process using ηT pairing as bilinear tool. Although Public key encryption along with pairing needs only once for a particular session, however, due to public key encryption, it may not be appropriate for Wireless Sensor Networks. Therefore, we have revised our scheme and proposed another scheme Identity based symmetric key cryptography for path key establishment. This scheme consumes less computation cost due to symmetric approach for encryption of temporarily generated key. Therefore, this scheme is more appropriate for application in wireless Sensor Networks. udThus for the purpose of our thesis work, we have proposed a scheme which optimize the Key-pre Distribution strategy by using Deterministic technique of merging blocks to form node and hence facilitates less communication cost for pair-wise common key establishment. Again, for securing temporary key during Path Key Establishment, we have proposed two schemes which provide full security to the temporary key. ud
展开▼
机译:无线传感器网络由许多可以通过无线电波相互通信的传感器设备组成。传感器设备的计算能力,通信能力,存储容量和电池电量受到限制。这使得在无线传感器网络中执行任何任务都非常具有挑战性。在各种需求中,无线传感器网络中的安全通信是主要需求。假设两个或多个传感器节点希望彼此安全地通信,则它们需要一个能够满足前面提到的约束条件下所有安全要求的环境。因此,在该网络中进行安全通信不是一件容易的事。两个或多个节点可以使用适用于此网络的任何加密方案进行通信。通信过程中的节点必须使用一个或多个密钥进行加密和解密。整个网络的单个密钥可用于共享信息的加密和解密。但是,对该密钥的破坏可能会揭示网络中的整个通信。因此,尽管用于整个网络的单个密钥为网络的通信提供了一定范围的安全性,但是网络的弹性非常低,这对于安全通信是完全不可接受的。为网络中的每个其他节点保留共享密钥是另一种选择。但是,网络中节点数量的增加会增加每个节点的密钥环大小。尽管它提供最大的弹性,但是由于传感器节点的内存限制,它具有不可扩展性。另一种方案是公钥密码术,它需要公钥和私钥才能进行安全通信。它为网络提供了良好的弹性。然而,它消耗大量计算,这限制了其在无线传感器网络中的应用。 udKey预分配是一种最佳方案,它在部署网络之前从一组预定义的密钥中为每个节点加载有限数量的密钥。想要彼此通信的节点对搜索它们之间是否存在任何公共密钥,如果找到则使用该公共密钥开始通信。如果没有找到这样的公用密钥,则它们将建立用于交换临时生成的密钥的路径,并使用该密钥开始通信。已经提出了几种用于安全通信的密钥分配的密钥预分配方案。 ud带有块合并的预密钥分发是主要的密钥预分发方案之一。我们已经研究过,由于节点的随机性,节点的随机合并会产生一定的通信成本。我们提出了一种方案,该方案将以确定性方式合并不同的块,从而在节点中产生块ID的模式。我们的目的是减少密钥建立期间的通信任务。对于我们的情况,在公共密钥建立期间的通信成本只有O(1),它是恒定的,而在随机合并的情况下,它的通信成本是O(z),其中z是合并因子。因此,我们提出的方案最适合这种类型的网络。 ud同样在那些需要临时密钥的通信中,由于以下事实的通信是不安全的:如果实际通信者之间的路径中的任何中间节点都受到威胁,则新生成的通信会泄露给攻击者。我们提出了两种方案来为这种临时生成的密钥提供安全性。其中之一是用于路径密钥建立的基于身份的公共密钥加密,它使用基于ηT配对作为双线性工具的基于身份的公共密钥加密过程来交换新生成的临时密钥。尽管对于一个特定的会话,公钥加密和配对只需要一次,但是,由于公钥加密,它可能不适用于无线传感器网络。因此,我们修改了方案,并提出了另一种基于身份的对称密钥加密方案,用于建立路径密钥。由于采用对称方法对临时生成的密钥进行加密,因此该方案消耗较少的计算成本。因此,该方案更适合于无线传感器网络中的应用。 因此,出于本文工作的目的,我们提出了一种方案,该方案利用合并块的确定性技术来优化密钥分配策略,从而形成节点,从而降低了成对公共密钥建立的通信成本。再次,为了在路径密钥建立期间保护临时密钥,我们提出了两种为临时密钥提供完全安全性的方案。 ud
展开▼