We present a new computational problem in this paper, namely the order of a group element problem which is based on the factorization problem, and we analyze its applications in cryptography. We present a new one-way function and from this function we propose a homomorphic probabilistic scheme for encryption. Our scheme, provably secure under the new computational problem in the standard model.

Role-Based Access Control (RBAC) is one of the most used models in designing and implementation of security policies, in large networking systems. Basic RBAC model does not consider temporal aspects which are so important in such policies. Temporal RBAC (TRBAC) is proposed to deal with these temporal aspects. Despite the elegance of these models, designing a security policy remains a challenge. Designers must ensure the consistency and the correctness of the policy. The use of formal methods provides techniques for proving that the designed policy is consistent. In this paper, we present a formal modelling/analysis approach of TRBAC policies. This approach uses Hierarchical Timed Coloured Petri Nets (HTCPN) formalism to model the TRBAC policy, and the CPN-tool to analyse the generated models. The timed aspect, in HTCPN, facilitates the consideration of temporal constraints introduced in TRBAC. The hierarchical aspect of HTCPN makes the model “manageable”, in spite of the complexity of TRBAC policy specification. The analysis phase allows the verification of many important properties about the TRBAC security policy.

Several contention-based MAC protocols for WSNs have been proposed. The control channel is accessed with carrier sense multiple access with collision avoidance (CSMA/CA) method. The complexity of this method and its criticality motivate the formal specification and verification of its basic algorithms. Most existing works do not deal with all possible aspects such as topology, number of nodes, node behaviour, and number of possible retransmissions. In this paper, we propose a stochastic generic model for the 802.11 MAC protocol for an arbitrary network topology which is independent of the number of sensors. In addition to the qualitative evaluation that proves the correctness of the model, we will make a quantitative evaluation using the statistical model checking to measure the probabilistic performance of the protocol.

Nowadays, the distributed computing plays an important role in the data mining process. To make systems scalable it is important to develop mechanisms that distribute the workload among several sites in a flexible way. Moreover, the acronym ERP refers to the systems and software packages used by organisations to manage day-by-day business activities. ERP systems are designed for the defined schema that usually has a common database. In this paper, we present a collaborative multi-agent based system for association rules mining from distributed databases. In our proposed approach, we combine the multi-agent system with association rules as a data mining technique to build a model that can execute the association rules mining in a parallel and distributed way from the centralised ERP database. The autonomous agents used to provide a generic and scalable platform. This will help business decision-makers to take the right decisions and provide a perfect response time using multi-agent system. The platform has been compared with the classic association rules algorithms and has proved to be more efficient and more scalable.

In this paper, we propose a new and practical variant of ElGamal encryption which is secure against every passive and active adversary. Under the hardiness of the decisional Diffie-Hellman assumption, we can prove that the proposed scheme is secure against an adaptive chosen ciphertext attacks in the standard model. Such security verifies not only the confidentiality but also verifies the integrity and the authentication of communications. We display that the modified scheme furthermore achieves anonymity as well as strong robustness.

In this work, we propose a secure version of ElGamal public key cryptosystem, and prove that it is semantically secure assuming the hardness of what we call the two-dimensional decisional Diffie-Hellman (2DDDH) problem, this cryptosystem is distinguished by the speed of encryption and decryption processes and by its resistance to active adversaries. Since the 2DDDH problem is harder than the decisional Diffie-Hellman (DDH) problem (as it will be seen), one may conclude that our model reinforces the exchange security compared to the existed cryptosystems falling within the same context, also we discuss the difficult problems that guarantee its security.