صلاح عبدالهادي كاظم البيرماني

Cognitive radio networks are intelligent networks that can sense the environment and adapt the communication parameters accordingly. These networks find their applications in co-existence of different wireless networks, interference mitigation, and dynamic spectrum access. Unlike traditional wireless networks, cognitive radio networks additionally have their own set of unique security threats and challenges, such as selfish misbehaviours, self-coexistence, license user emulation and attacks on spectrum managers; accordingly the security protocols developed for these networks must have abilities to counter these attacks. This paper presents a novel cognitive authentication protocol, called CoG-Auth, aimed to provide security in cognitive radio networks against threats to self co-existence. CoG-Auth does not require presence of any resource enriched base stations or centralised certification authorities, thus enabling it to be applicable to both infrastructure and ad hoc cognitive radio networks. The CoG-Auth design employs key hierarchy; such as temporary keys, partial keys and session keys to fulfil the fundamental requirements of security. CoG-Auth is compared with IEEE 802.16e standard PKMv2 for performance analysis; it is shown that CoG-Auth is secure, more efficient, less computational intensive, and performs better in terms of authentication time, successful authentication and transmission rate.

In addition to standard authentication and data confidentiality requirements, Cognitive Radio Networks (CRNs) face distinct security issues such as primary user emulation and spectrum management attacks. A compromise of these will result in a denial of service, eavesdropping, forgery, or replay attack. These attacks must be considered while designing a secure media access control (MAC) protocol for CR networks. This paper presents a novel secure CR MAC protocol: the presented protocol is analysed for these security measures using formal logic methods such as Burrows-Abadi-Needham (BAN) logic. It is shown that the proposed protocol functions effectively to provide strong authentication and detection against malicious users leading to subsequent secure communication.

In this paper we use public key cryptosystems to keep the message by hiding the identity of the Customer's public key by pseudo key from Room of trust worthy. The key center generated from two public keys in the Room of Distribution Center. The Public key use to encryption and the private key for decryption of Ciphertext, the secretary is signing the message sent by the customer blindly without learn any think about the Customer and the message by check the validity of the Customer from the server of the database.By sending the Ciphertext through multiple Authority Rooms (group of users authentications) without breaking the public key of the message because its transfer blindly through the Authority Room after check the validity of the sender ID and its Authority Room IDR.Each Authority Room has two keys, public key of the previous Authority Room (to recover the Ciphertext) and its own private key (for signing the Ciphertext) then resend the signing message to the next Authority Room.This method is fit to multiple Customers, Managers and for multiple Authority Rooms to transfer the message from the sender to the receiver and encrypted the message by receiver public key hiding and blindly signing after transfer through multiple Authority Rooms, in this paper we used RSA algorithm for encryption and signing process.

Fixed public key distribution centers are liable to continuous attacks for key compromise either because they depend on a centralized server or rely on ad hoc trust relationship. Changing the key distribution center (KDC) frequently among a group of servers shall improve the key security tremendously. This may be achieved either randomly or through some pre-defined procedure. This paper suggests an election policy to select frequently one of several different servers as the KDC depending on various vital parameters. Such parameters would include weights given to each server, the time used, numbers of expected attacks on that server, etc. The KDC election method would serve as a deceiving measure to the enemy, as the time to elect and change the key distribution center can be made shorter than the required time to compromise the key.

Databases have inherently vast capabilities, ranging from safe and easy access logical storage to up to date data. This paper is dedicated to explore means and concepts of Role-Based Access Control (RBAC) and decision permission concepts. It focuses mainly on Role Based Access Control and its application to the Databases objects. After presenting a short overview of RBAC, it is implemented on the database objects by allowing authorized users to access the database information and preventing unauthorized users from doing so. This criterion is becoming valuable asset nowadays within all organizations. In addition to the inclusion of decision permission as a new parameter, the concept of authorization rooms is proposed. It has proved to enhance system flexibility and transforms the system from static to dynamic status. Another important objective of this work is to enhance data confidentiality by extracting maximum business value from the Role-Based Access Control. This is achieved using a security protection mechanism that provides a secure access to data stored in the databases, and prevents any suspicious activities and fraudulent actions by internal employees with intention of revealing highly sensitive information (information theft). It is noticed that the protection is achieved through effective control over the database objects.

Efficient key distribution is an important problem for secure group communications. In this paper, that is processing and computing key computation phase to g-party case which extends to 2-party case in key distribution scheme (KDS) . It is a distribution protocol, divided into two phases : a distribution phase and a key computation phase . In the key computation phase some subset of users G in U, referred to as a conference, computes a common key using the secrete information received by the trusted authority TA and the messages ‘seen’ over the network during a phase. Before providing users with private information, does not know which conference G will recover a common key later. In this paper we use key pre-distribution scheme to generate common key of users in conference and development mathematical method to compute key computation phase for g-party case. The goal of this paper to improvement key distribution and treatment of the weakness of partition in key computation phase of Blundo.

Internet is the most hazardous environment for data security. Everybody may have the chance to unveil anybody’s secret messages when interested if one is given the skill and resources, no matter how strong security system is used. With the great increase in the number of applications present on the internet and the increased number of cypercustomer, it is highly profitable to predict that a security attack on messages is likely to occur within certain time, compromising information or encryption keys. This paper presents a new direction in security that enables internet users to forecast an attack against a secret key. This technique suggests an algorithm that includes vital and extremely important factors. In order to perform this task, the lifetime of the used key, the frequency of key usage, the number of messages encrypted with the same key and the message routing can be considered. The forecasting algorithm can be equipped with an alarming tool to safeguard the users. This technique will be useful for any enterprise in order to forecast the security attacks and in order to change the key before it can be compromised, so they can budget to defend against the attacks. This procedure provides insufficient information and will be considered as useful tool for approaching perfect security according to Shanon criteria

Public key schemes use two keys, i.e. public key used for encryption and private key used for decryption. But still there is a major problem in these schemes, as cryptanalyst has access to the public key and the sender's identity, which might help him or her to break the system. This paper presents a method for public key hiding, i.e. the public key of the receiver will not be used directly in the encryption process rather a pseudo key will be used. This scheme guarantees reducing the risk of breaking both the encryption algorithm and the public-private key pair. Furthermore, this pseudo public key is generated independent of the sender, i.e. as blind signature is achieved by using another key as well as reduces breaking encryption method. This method is designed and experimented with to fit a group users-group manager environment.

Information might be required to be sent to the recipients, as signature authentic but without neither revealing the identity of the sender nor the privacy of the message content. Blind signatures provide an answer to such a problem. This paper presents a method of blind signature that facilitates the sender authenticity, message content privacy and communication path information. This method relies on implementing a supervising third party that certifies sender authenticity for group users. Results have demonstrated an encouraging reasonable security.

Abstract. The main problem in Reaction Automata Direct Graph (RADG) is the static design the purpose of this chapter is to develops RADG algorithm to become more efficient by enhancing characteristics to cover large networks, use of the key in the encryption process increase the complexity against the attacker on networks and improved the single Reaction states in RADG to Multi-Reaction states which is up the speed of the algorithm finally the internal design become changeable which it was static in RADG so the RADG with our enhancement become Multi- Reaction Automata Direct Graph (MRADG), The output of the algorithm in our study result is changed from binary to points in (EC).

Signature based is one of the common techniques that are used to detect malware attack. The problem of the signature based is about the management of large database that has a new signature, in this paper we will create a new method to classify and fast retrieve malware of database, the size of database increase database is dependent on the number of signatures that are based on malware file , to solve classify database by using the concept of room based, we use this concept “room based” to manage the database. Each room based that has content Prohibition privileges of signature based on malware files, or pattern of collections of signature based of malware files.