The aim of this technical report is to complement the work in [To et al. 2014] by proposing a Group Key Exchange protocol so that the Querier and TDSs (and TDSs themselves) can securely create and exchange the shared key. Then, the security of this protocol is formally proved using the game-based model. Finally, we perform the comparison between this protocol and other related works.

In this work, we introduce an active attack on a Group Key Exchange protocol by Burmester and Desmedt. The attacker obtains a copy of the shared key, which is created in a collaborative manner with the legal users in a communication group.

key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. to establish a secure communication, two nodes must share common key from their key-rings. otherwise, they can find a key- path in which ens...

Signcryption tag-KEM (Key Encapsulation Mechanism with a tag) is an authenticated tag-KEM for generic construction of hybrid signcryption. Signcryption tagKEM allows the sender to encapsulate a symmetric key along with a tag so that the receiver can authenticate the sender, the key, and the tag. We present a definition for the security of signcryption tag-KEM which is suitable for a recent sign...

This paper introduces a special type of symmetric cryptosystem called multi-encryption scheme. It allows users to encrypt multiple plaintexts into a single ciphertext. Each plaintext is protected with its own secret key, meaning that they can be decrypted individually by applying the decryption function with the corresponding key to the ciphertext. Compared to encrypting the ciphertexts one-by-...

In this paper, we propose a new dynamic cryptographic key generation scheme for access control in a hierarchy with frequently inserted and deleted security classes. Our scheme, based on the Chinese remainder theorem and an available symmetric cryptosystem, can achieve the following four goals: First, a so-called trusted third party for generating keys is not needed in the system. Second, each s...

An association scheme is amorphous if it has as many fusion schemes as possible. Symmetric amorphous schemes were classified by A. V. Ivanov [A. V. Ivanov, Amorphous cellular rings II, in Investigations in algebraic theory of combinatorial objects, pages 39–49. VNIISI, Moscow, Institute for System Studies, 1985] and commutative amorphous schemes were classified by T. Ito, A. Munemasa and M. Yam...

The fast evolution of processor performance necessitates a permanent evolution of all the multi-processor components, even for small to medium-scale symmetric multiprocessors (SMP) build around shared busses. This kind of multiprocessor is especially attractive because the problem of data coherency in caches can be solved by a class of snooping protocols specific to these shared-bus architectur...

Wireless sensor network is a tremendous emerging technology provides communication services for environmental monitoring and target tracking for mass public and military. With increasing of this smart network popularity sensor network faced various challenges and threats. The inclusion of wireless sensor nodes also incurs different types of security threats in network. Mostly networks are using...