Good Level Of Security Research Articles

INTEGRATION OF CFEA-COMPRESSION TECHNIQUE INTO ASYMMETRIC KEY CRYPTOSYSTEMS

In order to provide good level of security, modern cryptosystems need to implement large numbers and complicated mathematical operations. As a consequence, efficiency becomes a new major issue in cryptography. By using proper parameters, some of established asymmetric cryptosystems are believed to be able to provide a good level of security. Since that, aim to develop a mechanism to accelerate encryption and decryption processes of asymmetric cryptosystem without altering their original encryption and decryption algorithms become a big consideration. The aim of this paper is to propose the integration of a compression technique that named as CFEA-Compression technique into some established asymmetric key cryptosystem such as RSA, El-Gamal and Elliptic Curve cryptosystems. CFEA-technique is a combination of Continued Fraction and Euclidean Algorithm (CFEA) which is able to reduce the number of plaintext and ciphertext prior the encryption and decryption procedures.

KEAMANAN AUTHENTIKASI HOTSPOT MENGGUNAKAN CAPTCHA

Hotspot networking SMKMuhammadiyah2Malang do not have a good security system that can be used by unauthorized users. With the issue of the security system research and design that has a hotspot network's security level better than before. The purpose of this study is to secure hotspot network of ilegal users by adding a captcha in the authentication process using MikroTik hotspot. 
 Data collection methods used to analyze the data and make the information that will be used to determine the problems faced. System development method using the waterfall method.
 The use of captcha on the authentication process hotspot login page in SMK Muhammadiyah 2 Malang using Mikrotik has not been able to provide evidence of the power system network security hotspot. This is evidenced by the test using a brute force attack techniques. The testing process using the same time frame with the type of passwords that are very weak and not obtained differences of the results achieved. Hotpsot proxy authentication security system based captive portal using only user and password as the authentication process already has a good level of security even without using captcha.
 Keyword:Networking Security, authentication, hotspot, captcha.

A steganography embedding method based on edge identification and XOR coding

In this paper, we present a novel image steganography algorithm that combines the strengths of edge detection and XOR coding, to conceal a secret message either in the spatial domain or an Integer Wavelet Transform (IWT) based transform domain of the cover image. Edge detection enables the identification of sharp edges in the cover image that when embedding in would cause less degradation to the image quality compared to embedding in a pre-specified set of pixels that do not differentiate between sharp and smooth areas. This is motivated by the fact that the human visual system (HVS) is less sensitive to changes in sharp contrast areas compared to uniform areas of the image. The edge detection method presented here is capable of estimating the exact edge intensities for both the cover and stego images (before and after embedding the message), which is essential when extracting the message. The XOR coding, on the other hand, is a simple, yet effective, process that helps in reducing differences between the cover and stego images. In order to embed three secret message bits, the algorithm requires four bits of the cover image, but due to the coding mechanism, no more than two of the four bits will be changed when producing the stego image. The proposed method utilizes the sharpest regions of the image first and then gradually moves to the less sharp regions. Experimental results demonstrate that the proposed method has achieved better imperceptibility results than other popular steganography methods. Furthermore, when applying a textural feature steganalytic algorithm to differentiate between cover and stego images produced using various embedding rates, the proposed method maintained a good level of security compared to other steganography methods.

Security System for DNS using Cryptography

Domain Name System is a protocol that resolves hostnames to IP Addresses over the Internet. DNS, being an open source, it is less secure and it has no means of determining whether domain name data comes from an authorised domain owner. So, these vulnerabilities lead to a number of attacks, such as, cache poisoning, cache spoofing etc. Hence, there is a need of securing DNS. Digital Signatures are a good way of authyenticating the domain owners. The paper presents the Domain Name System security concept,. Digital Signature algorithms helps in providing good level of security to DNS. Software like OpenDNSSEC, BIND, Secure64 etc. It involves the signing of DNS using cryptographical algorithms (e.g., RSA, DSA etc.). Further, ECDSA is one way that provides same level of security, as security provided by RSA for low power and portable devices. So, here we proposing a new ECDSA implementation that can be used to secure DNS.

An Investigation of Local Descriptors for Biometric Spoofing Detection

Biometric authentication systems are quite vulnerable to sophisticated spoofing attacks. To keep a good level of security, reliable spoofing detection tools are necessary, preferably implemented as software modules. The research in this field is very active, with local descriptors, based on the analysis of microtextural features, gaining more and more popularity, because of their excellent performance and flexibility. This paper aims at assessing the potential of these descriptors for the liveness detection task in authentication systems based on various biometric traits: fingerprint, iris, and face. Besides compact descriptors based on the independent quantization of features, already considered for some liveness detection tasks, we will study promising descriptors based on the joint quantization of rich local features. The experimental analysis, conducted on publicly available data sets and in fully reproducible modality, confirms the potential of these tools for biometric applications, and points out possible lines of development toward further improvements.

Improving the Security of Image Encryption by using Two Chaotic Maps

ABSTRACT During the recent years several chaotic image encryption algorithms based on one dimensional (1- D ) have been proposed, but the drawbacks of small key space, low speed, and low security in 1- D chaotic cryptosystems are obvious. This paper proposes a new image encryption technique based on 1- D and 2- D chaotic maps which provide more security and big key space. The 1- D chaotic system is induced from a mathematical combination between the logistic map and the cubic chaotic map. It has the advantage of bigger key space and high security analysis such as key space analysis, statistical analysis and sensitivity analysis were carried out. The proposed system uses 1- D and 2- D chaotic maps for simultaneous encryption of the components R, G, B of the colored image; these three components affect each other. So, the security and confidentiality of image data become more important. The security of digital images and performance speed has become more important since the communications of digital information over network occur more frequently. An image encryption has applications in various fields for example; the internet communication, the multimedia systems, the medical imaging, Tele-medicine and the military communication. The image encryption's aim is to convert the original image to another image that is hard to understand. However, image encryption differs from text encryption due to some intrinsic features of images which include bulk data capacities, high redundancy, strong correlations among pixels, etc. These features make conventional cipher systems such as DES, AES and RSA unsuitable for practical image encryption [1]. The chaos theory is used in cryptography due to its intrinsic features. These properties of chaos includes: sensitivity to initial condition and control parameters, random like behavior and mixing property, etc [2]. Several chaos based image encryption approaches have been described. The first is the confusion approach where the position of pixels scrambled without changing the values of pixels, the application of this approach does not guarantee a good level of security [3]. The second approach is the diffusion which aims to change the value of each pixel in the whole image [4]. Other approach shuffles the positions of plain-image in spatial domain by cat map [5-7]. To enhance the security, the majority of methods propose to mix between more than one approach simultaneously. Some conditions should be fulfilled such as a large key space, randomness of the cipher-image and a high sensitivity on the initial conditions. In [8], an image encryption scheme based on improved 3-

KAJIAN YII FRAMEWORK DALAM PENGEMBANGAN WEBSITE PERGURUAN TINGGI

Along with the development of technology in building a website , usually in the PHP programming language , people tend to write the coding from scratch . It seems like Perguruan Tinggi Raharja website which has 4 ( four ) such problems in terms of appearance , contains , security and technology . Because the Perguruan Tinggi Raharja website is still under construction using conventional methods , which take a long time can eventually lead to problems such as complexity in the preparation of the program code . Where it can lead to the development of the website and the length of time it is difficult to perform more maintenance because the code of the compiled program does not have a good standard of application development . As a solution presented four (4 ) solution of the above problems is the infrastructure including a website , view websites , website content and dashboard system , this can be managed more easily by applying a PHP based frameworks like Yii Framework . Yii Framework is a framework that contains functions and classes using the MVC method contained therein . MVC is a method that separates the parts of a web application consists of a Model , View , and Controller . With the Yii Framework significant benefits obtained as easily perform all types of web application development because Yii is very light and comes with a caching solution that is satisfactory , and it is suitable for developing applications with high traffic . In terms of safety also has a pretty good level of security , including the prevention of cross- site scripting ( XSS ) , cross-site request forgery , and the prevention of attacks of cookies . With the construction of university websites using Yii Framework Prog expected to improve the performance of a website as a future spotlight Pribadi Raharja information .

Formal verification of a software countermeasure against instruction skip attacks

Fault attacks against embedded circuits enabled to define many new attack paths against secure circuits. Every attack path relies on a specific fault model which defines the type of faults that the attacker can perform. On embedded processors, a fault model consisting in an assembly instruction skip can be very useful for an attacker and has been obtained by using several fault injection means. To avoid this threat, some countermeasure schemes which rely on temporal redundancy have been proposed. Nevertheless, double fault injection in a long enough time interval is practical and can bypass those countermeasure schemes. Some fine-grained countermeasure schemes have also been proposed for specific instructions. However, to the best of our knowledge, no approach that enables to secure a generic assembly program in order to make it fault-tolerant to instruction skip attacks has been formally proven yet. In this paper, we provide a fault-tolerant replacement sequence for almost all the instructions of the Thumb-2 instruction set and provide a formal verification for this fault tolerance. This simple transformation enables to add a reasonably good security level to an embedded program and makes practical fault injection attacks much harder to achieve.

An Energy Efficient Acknowledgement Based Ids For Manet

Mobile adhoc network is an infrastructureless network with a dynamic native where the nodes are free to move and hence it is susceptible to various attacks. Previous system is an acknowledgement based intrusion detection system where there is a high energy condumption due to the inefficient path selection where the selected nodes energy is drained before completing the communication and also due to the flooding of hello packets to unavailable nodes. The previous IDS also has the disadvantage of pre distribution of keys which can be easily accessed by the malicious attacker which can forge the acknowledgement packets which is confirming the packet delivery. The acknowledgement packet is when forged, the false information will be delivered to the source about the honest nodes which has already successfully forwarded the packet. This project deals with the problem of high energy consumption and also attack caused by pre distribution of the keys. The acknowledgement packets are digitally signed using a session key in order to avoid the forging of the acknowledgement packets. The energy consumption is reduced by using an energy efficient path selection method where efficient nodes are selected and also by suppressing the hello packets which is sent to the unavailable nodes. Simulation tool used in this project is ns2.35 .Simulation result shows that the proposed scheme provide a reasonably good level of security and reduced energy consumption than the existing system.This system is used in the military applications,banking etc.

ETRU: NTRU over the Eisenstein integers

NTRU is a public-key cryptosystem based on polynomial rings over $$\mathbb Z .$$ Z . Replacing $$\mathbb Z $$ Z with the ring of Eisenstein integers yields ETRU. We prove through both theory and implementation that ETRU is faster and has smaller keys for the same or better level of security than does NTRU.

A New Pseudo-Random Number Generator Based on Two Chaotic Maps

A new pseudo-random number generator (PRNG) is proposed. The principle of the method consists in mixing chaotic maps produced from an input initial vector. The algorithm uses permutations whose positions are computed and indexed by a chaotic function based on linear congruences. The performance of this scheme is evaluated through statistical analysis. Such a cryptosystem lets appear significant cryptographic qualities for a good security level.

Enhanced efficient group key transfer scheme for wireless sensor networks

Wireless sensor networks (WSNs) have become a motivating technology as it can be constructed without communication infrastructures. WSN operates in harsh environment; therefore information security in infrastructureless WSN is one of the most important challenges. WSN possess different network architectures. Cluster-based WSN architecture is found to be efficient with reduced transmission power and low energy consumption. To enhance the purpose of cluster based WSN, it is necessary to protect the communication within a cluster. This paper focuses on cluster-based key management scheme. Further in this paper, a mathematical model is used to securely share key among the communicating entities in a group. Moreover, the proposed scheme prevents impersonators from accessing any information exchanged within a group. Security analysis shows that proposed scheme maintain a good level of security. Performance evaluation illustrate that proposed scheme is performed with minimum computation and communication overhead. Key words: Group key, intra cluster, authentication, interpolation, sensor network.

Anonymous multipath routing protocol based on secret sharing in mobile ad hoc networks

Because the intrinsic characteristics of mobile ad hoc networks (MANETs) cause several vulnerabilities, anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns. Until recently, lots of anonymous routing protocols have been proposed. However, most of them are single path or use one path at a time, and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously. Thus an anonymous multipath routing protocol based on secret sharing is proposed. The protocol provides identity anonymity, location anonymity, data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process. Meanwhile, a hash function is introduced to detect active attacks in the data transmission process. The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks (such as interception and physical destroy attacks). Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.

Efficient hardware architecture for the AES-CCM protocol of the IEEE 802.11i standard

Applications of wireless communications networks are emerging continuously. To offer a good level of security in these applications, new standards for wireless communications propose solutions based on cryptographic algorithms working on special modes of operation. This work presents a custom hardware architecture for the AES-CCM protocol (AES-CCMP) which is the basis for the security architecture of the IEEE 802.11i standard. AES-CCMP is based on the AES-CCM algorithm that performs the Advanced Encryption Standard (AES) in CTR with CBC-MAC mode (CCM mode), plus specialized data formatting modules, providing different security services through iterative and complex operations. Results of implementing the proposed architecture targeting FPGA devices are presented and discussed. A comparison against similar works shows significant improvements in terms of both throughput and efficiency.

Advances in vehicular communications networks [Guest Editorial

The articles in this special issue focus on advances in vehicular communications networks. The first four deal with the refinement of several different important mechanisms in vehicular communication protocols, with the aim of controlling and reducing the overall network offered load, while guaranteeing a good level of accuracy, efficiency, and security. The last article proposes a system architecture, called VISIONS, that makes use of the 3G network to disseminate control information. The control information helps routing protocols improve their route selections.

SEARCH-BASED CHAOTIC PSEUDORANDOM BIT GENERATOR

This paper proposes the construction of a new chaotic pseudorandom bit generator, which forms the main building block of a chaotic stream cipher. The design of the algorithm is based on a single chaotic map whose numerical orbit indirectly contributes towards the generation of the keystream. The latter is produced from the numerical orbit by applying a technique that searches for iterates in specific intervals [a,b], for some real numbers a and b, and outputs 0 or 1 based on the iterate preceding the targeted iterate. The generator suggested here is built up from a quadratic map. We analyze the cycle length of the keystreams and investigate the resistance of the generator to well-known cryptanalytic attacks. Furthermore, the statistic characteristics of the keystreams are examined numerically using the NIST statistical test suite. The numerical and theoretical results demonstrate that the proposed technique results in generating keystreams possessing very good cryptographic properties and high level of security against existing cryptanalytic attacks. Empirical results show that the search technique leads to the generation of keystreams possessing good randomness properties when applied to any chaotic map whose orbits have good randomness properties such as the quadratic map, tent map and sawtooth map.

Predistribution and local collaboration-based group rekeying for wireless sensor networks

When a sensor network is deployed in a hostile environment, an adversary may launch such attacks as eavesdropping the communications and compromising sensor nodes. Using the compromised nodes, he may inject false sensing reports or modify the reports sent by other nodes. To defend against these attacks, researchers have proposed symmetric group key-based schemes. In these schemes, however, if a large number of nodes are compromised, many (sub)group keys will be revealed. This greatly endangers the filtering schemes, making them very ineffective or even useless. To address this problem, we propose a family of predistribution and local collaboration-based group rekeying (PCGR) schemes, which update the compromised group keys to prevent the compromised nodes from understanding the communications between noncompromised nodes or injecting false data. These schemes are designed based on a simple while controversial idea – preload future group keys into sensor nodes before their deployment. To protect the preloaded keys from being disclosed by compromised nodes, we propose a novel technique that requires neighboring nodes to collaborate to derive the future group keys. To the best of our knowledge, our schemes are the first set of distributed group rekeying schemes for sensor networks without involving online key servers. Extensive analysis and simulations are conducted to evaluate the proposed schemes, and the results show that the proposed schemes can achieve a good level of security, outperform several previous group rekeying schemes, and significantly improve the effectiveness of false data filtering.

An Asymmetric Key-Based Security Architecture for Wireless Sensor Networks

In spite of previous common assumptions about the incompatibility of public key cryptography (PKC) schemes with wireless sensor networks (WSNs), recent works have shown that they can be utilized for such networks in some manner. The major challenge of employing a PKC-based scheme in a wireless sensor network is posed by the resource limitations of the tiny sensors. Considering this sensor feature, in this paper we propose an efficient PKC-based security architecture with relatively lower resource requirements than those of previously proposed PKC schemes for WSN. In addition, our scheme aims to provide robust security in the network. Our security architecture comprises two basic components; a key handshaking scheme based on simple, linear operations and the derivation of a decryption key by a receiver node. Our architecture enables node-to-base-station and node-to-node secure communications. Analysis and simulation results show that our proposed architecture ensures a good level of security for network communications, and can be effectively implemented with the limited computational, memory, and energy budgets of current-generation sensor nodes.

Call for Papers: ‘Security in Mobile Wireless Networks’

Security has become a primary concern to provide protected communication in mobile networks. Unlike the wired networks, the unique characteristics of mobile networks pose a number of nontrivial challenges to security design, such as open peer-to-peer network architecture, shared wireless medium, stringent resource constraints, highly dynamic network topology, and absence of a trusted infrastructure. Ubiquitous roaming impacts on a radio access system by requiring that it supports handover between neighbouring cells and different networks. Also, mobile networks are more exposed to interferences than wired networks. There are several components that contribute to this: adjacent channels, co-channels, Doppler shifts, multipath, and fading. This SI aims at identifying and exploring different issues and challenges related to security aspects in mobile networks. What are the impacts (benefits or inconvenience) of mobility on security? What are the appropriate mobility models to have a good level of security? Are classical IDS approaches appropriate for mobile environments? How can security be managed in mobility pattern and/or behaviour prediction? Topics of Interest Secure mobile PHY/MAC protocols Secure mobile-routing protocols Security under resource constraints (e.g. energy, bandwidth, memory, and computation constraints) Performance and security tradeoffs in mobile networks Secure roaming across administrative domains Key management in mobile scenarios Cryptographic protocols Authentication and access control in mobile networks Intrusion detection and tolerance in mobile network Trust establishment, negotiation, and management Secure mobile location services Secure clock distribution Privacy and anonymity Denial of service in mobile networks Prevention of traffic analysis Important Dates Papers submission deadline: 30 September 2008 Notification of decisions: 28 February 2009 Final manuscript due: 31 March 2009 Publication: The 4th quarter of 2009 Instructions for Authors and Review Process Papers must represent high-quality and previously unpublished work. Original research papers are solicited in all areas of Wireless and Networks Security. All submissions will be peer reviewed by at least three experts working in the areas. The guidelines for prospective authors can be found online at http://www.interscience.wiley.com/journal/security. Prospective authors should submit their papers online at http://mc.manuscriptcentral.com/scn. When submitting the papers, the authors should make sure to choose the Manuscript type as ‘Special Issue’ and enter the ‘Running Head’ and the ‘Special Issue title’ as ‘SCN-SI-007’ and ‘SecureMobile’, respectively.

Anonymous and Non-Repudiation E-Payment Protocol

There are many proposals offer anonymous and non-repudiation e-payment protocols. But they have the drawbacks that the anonymity can be misused by fraudulent to perform a perfect crimes. Currently, the hot research concentrates on the accepting of e-payment protocols where the anonymity of the coins is cancelable via a trusted authority in the case of criminal entities. In the article we suggest an efficient protocol for e-payment scheme that offers a good level of security with appreciate to its efficiency. The proposed protocol prevents the blind office and the bank from impersonate an entity, so that the entity could not repudiate it when the entity misused a coin. Another benefit is that it is constructed from efficient cryptography schemes so that its security can simply be analyzed. The strength of this scheme is in its easiness. So, we claim that the suggested protocol is more efficient than the existing schemes, since it allows to both a blind office and a bank to impersonate an entity to find and to spend a coin without to be noticed. It might cause a repudiation difficulty where the entity can repudiate his bad activities by proposing that both the bank and the blind office acted inaccurately. Other relevant issues related to the new protocol will be discussed in the section of the security of the scheme.