This article is described a new Public Key Encryption with Keyword Search (PEKS) scheme, which is semantically secure against chosen keyword attack, without assuming random oracle. The security of our scheme depends on the complexity assumption of Strong Diffie-Hellman (SDH). The computation operation for constructing cipher text and trapdoor of keyword is simpler than the most schemes introduc...

Article history: Received 5 June 2009 Received in revised form 25 July 2010 Accepted 4 August 2010 Available online 10 August 2010

Let D0(R+ ) denote the space of cadlag paths f : R+ → R with f(0) = 0. For f, g ∈ D0(R+ ), define f ⊗ g ∈ D0(R+ ) and f g ∈ D0(R+ ) by (f ⊗ g)(t) = inf 0≤s≤t [f(s) + g(t) − g(s)], and (f g)(t) = sup 0≤s≤t [f(s) + g(t) − g(s)]. Unless otherwise deleniated by parentheses, the default order of operations is from left to right; for example, when we write f ⊗ g ⊗ h, we mean (f ⊗ g) ⊗ h. Define a seq...

Random key graphs represent topologies of secure wireless sensor networks that apply the seminal Eschenauer– Gligor random key predistribution scheme to secure communication between sensors. These graphs have received much attention and also been used in diverse application areas beyond secure sensor networks; e.g., cryptanalysis, social networks, and recommender systems. Formally, a random key...

Three parties, Alice, Bob and Eve, know the sequences of ran-generated by a discrete memoryless source according to some probability distribution P XY Z. Motivated by Wyner's and Csiszz ar and KK orner's pioneering definition of, and work on, the secrecy capacity of a broadcast channel, the secret key rate of P XY Z was deened by Maurer as the maximal rate M=N at which Alice and Bob can generat...

In this paper, we propose an efficient watermarking scheme for H.264/SVC, where the watermarking is performed by using a block-based approach. The embedding process of watermark in the proposed scheme is performed in the encoder of H.264/SVC. The blocks for watermarking embedding are selected by considering both the length of the watermark signal and the size of the input video frame. The water...

Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. We present three new mechanisms for key establishment using the framework of pre-distributing a random set of keys to each node. First, in the q-composite keys s...

Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. We present three new mechanisms for key establishment using the framework of pre-distributing a random set of keys to each node. First, in the q-composite keys s...

Random key graphs, also called uniform random intersection graphs, have been used for modeling a variety of different applications since their introduction in wireless sensor networks. In this paper, we review some of their recent applications and suggest several new ones, under the full visibility assumption; i.e., under the assumption that all nodes are within communication range of each othe...