Motivated by a recently introduced HIMMO key predistribution scheme, we investigate the limits of various attacks on the polynomial interpolation problem with mixed modular operations and hidden moduli. We firstly review the classical attack and consider it in a quantum-setting. Then, we introduce new techniques for finding out the secret moduli and consider quantum speed-ups.

In this technical report, we analyze wireless sensor networks (WSN) under node capture and cloning attacks. Assuming that WSNs use symmetric keys, with key assignment based on a random key predistribution scheme, we provide extensive probabilistic analysis of WSNs under the attack. We define and characterize the following parameters: the number of nodes an adversary needs to capture in order to...

One method of improving safety of transmissions between simple sensing devices is to assign sets of cryptographic keys to them. Methods of distributions of such keys are called key predistribution schema. The basic probabilistic key predistribution schema from Eschenauer and Gligor (2002) can be described as follows: we have a pool K of cryptographic symmetric keys of cardinality n; each device...

Key predistribution is a popular technique for key distribution in sensor networks. The schemes available in current literature using this approach are for nodes with no or limited mobility. In this paper we present two key predistribution based scheme for heterogeneous networks i.e. networks which consist of nodes which are stationary as well as highly mobile. The existing schemes make use of ...

Security schemes of pairwise key establishment plays a fundamental role in research on security issue in wireless sensor networks. However, establishing pairwise keys in wireless sensor networks is not a trivial task, particularly due to the resource constraints on sensors. In this paper, we prose an efficient key distribution scheme, in which each sensor node randomly selects two key pools fro...

Owing to the security requirements of wireless sensor network, the background of Wireless Sensor Network (WSN) is to be analyzed with different threats and attack models. Physical compromising of sensor nodes by an adversary is an emerging problem in sensor network and accordingly, it is necessary to provide an environment with efficient key management techniques due to resource constraints on ...

Wireless networks are more vulnerable to security threats than wired networks. Since sensors are resource constrained, the use of traditional cryptographic key management techniques is not practical. Hence keys are distributed in sensor nodes prior to their deployment. This method, called key predistribution, was investigated recently in a number of studies. This chapter restricts the discussio...

Since LU decomposition-based key predistribution schemes can be compressed easily, they are very appropriate for source-limited sensor networks. But existing schemes have two flaws: (1) they all focus on key establishment without considering key or key material update, thus they can’t support extra nodes addition or deletion and their supported network size is limited; (2) they are vulnerable t...