In this paper we introduce a Group Key Management protocol following the idea of classical that extends well-known Diffie–Hellman key agreement to group users. The is defined in non-commutative setting, more precisely, twisted dihedral ring. for an arbitrary cocycle, extending previous agreements considered two main objective work show there no lack security derived from fact larger amount publ...

A model describing secure communications architectures is developed using the formal language Z. The model is based on fundamental cryptographic properties. Some basic constraints are derived for the design of secure architectures which allow problems to the identified prior to design of security protocols. A simple criterion is derived for ensuring that all pairs of users can set up secure com...

Increasing automation and external connectivity in industrial control systems (ICS) demand a greater emphasis on software-level communication security. In this article, we propose secure-by-design development method for building ICS applications, where requirements from security standards like ISA/IEC 62443 are fulfilled by design-time abstractions called secure links. Proposed as an extension ...

Inspired by social animals, such as ants, bees and fish, which appear to exhibit what has been dubbed ‘swarm intelligence’, swarm robotic systems aim to accomplish goals that are unachievable by an individual robot. Swarm robotics have a large number of potential uses, including applications in the military, monitoring, disaster relief, healthcare and commercial applications. To be able to achi...

Many services in a distributed public network like the Internet require secure communications. Security in communications consists of confidentiality, integrity, authenticity, and non-repudiability. These aims can be achieved with cryptography. Key management plays a fundamental role in secure communications, as it is the basis of all cryptographic functions. This paper describes a pattern lang...

We translate the problem of designing a secure communications protocol for several users communicating through a relay in a wireless network into understanding certain subvarieties of products of Grassmannians. We calculate the dimension of these subvarieties and provide various results concerning their defining equations. When the relay and all of the users have the same number of antennas, th...