Search

Medical Images has evolved from time to time and the need to protect sensitive information related to such images have also grown significantly. Nowadays data being the primary asset of an individual, protecting them has posed new challenges from time and again. With the advancement of the digital medium, the medical image has been at greater risk and there is an urgent need to protect the information and the raw pixel data of such images. This research focuses on ensuring the confidentiality of DICOM medical images and protecting the Electronic Patient Report (EPR) by applying both cryptographic and steganographic protection techniques. The encryption keys are generated using the Logistic Chaotic Map and Non-Linear Feedback Shift Register. the electronic patient report (EPR) is converted into a 9-space-format using Continued Fraction of Ramanujan conjecture and then using steganography techniques EPR is embedded into the Most Significant Bits of Medical Images. The final encrypted image contains the EPR as well as encrypted medical image. The key sequence used in order to encrypt the medical image is highly pseudo random and the Key Space Analysis depicted that the algorithm is very strong. This work has paved a better way of securely storing 16-bit DICOM medical images and EPR into the Picture Archive and Communication System repository. The proposed security model has shown promising results in comparison to other research and the various analysis did show significant improvements over past studies.

In modern days, word files are used to carry out information storage and other multiple operations. The word file allows the users to write valuable text and information in plain text format. When such documents unknowingly falls in the wrong hands. Stealing of that valuable data is obvious. To prevent such situation, this paper proposes a cryptographic technique which uses random key values to generate ciphertext in the docx file itself. Then it uses inverted hash table to translate this ciphertext numbers into hash values. A hash table is re-created at the receiver side. In the whole process a key = (a, b) along with the hash key = (h) is transmitted to the receiver for decryption. The key values are generated by Random Key Generator (RKG) which uses a table to generate random key values based on the initial seed values. During decryption same sequence of key values are generated. The hash table translates the hash values into ciphertext numbers and then returns back the original plain text. The strength of the cryptosystem has been analyzed on various criteria and parameters which gave very promising results.

DNA based steganography plays a vital role in the field of privacy and secure communication. Here, we propose a DNA properties-based mechanism to send data hidden inside a video file. Initially, the video file is converted into image frames. Random frames are then selected and data is hidden in these at random locations by using the Least Significant Bit substitution method. We analyze the proposed architecture in terms of peak signal-to-noise ratio as well as mean squared error measured between the original and steganographic files averaged over all video frames. The results show minimal degradation of the steganographic video file. Keywords: Chaotic map, DNA, Linear congruential generator, Video steganography, Least significant bit

Cybercrimes and phishing scams have increased multi-folds over the past few years. Now a days, hackers are coming up with new techniques to hack accounts and gain sensitive information about people and organisations. Social networking site like Twitter is one such tool. And due to its large audience hackers use such sites to reach large number of people. They use such sites to circulate malicious URLs, phishing mails etc. which serve as the entry point into the target system. And with the introduction of Twitter Bots, this work got even easier. Twitter bots can send tweets without any human intervention after a fixed regular interval of time. Also their frequency of tweets is much more than humans and therefore they are frequently used by hackers to spread malicious URLs. And due to large number of active members, these malicious URLs are reaching out to more people, therefore increasing the phishing scams and frauds. So this paper proposes a model which will use different algorithms of machine learning, first to detect twitter bots and then find out which of them is posting malicious URLs. In the proposed model, some features have been suggested which distinguishes a twitter bot account from a benign account. Based on those statistical features, model will be trained. The model will help us to filter out the malicious bots which are harmful for legitimate users.

Medical Image protection is one of the primary concerns of health care services. There has been a lot of research in this field in the past decade. But unfortunately, in India, the implementation is very poor and unstructured. In this paper, a secured model for MRI image encryption and decryption using DNA Encoding and Logistic Chaotic Map is proposed. Initially a key is generated using logistic map function to generate a sequence K1,i this sequence is multiplied with a factor of 255, another sequence K2,i generated from Linear Feedback Right Shift Register (LFRSR) using an initial seed value, then both the sequences are XORed to form the key. After the key is generated the sequence is again XORed with the 8-bit image pixel of the MRI Image. The generated cipher is then converted into a DNA sequence using DNA Encoding. The generated text of DNA sequence is then passed to the network. This sequence is extremely secure and robust, the Root Mean Square Error (RMSE) value measured between the original and encrypted sequence is very high.

Cryptography has gone through tremendous evolution in recent years. But the concept of enciphering text was started in 1900 BC. There have been many modifications to older cryptography as well as profound discoveries have been made in this field. Likewise, this paper proposes a cryptographic technique that uses the idea of the Diffie-Hellman key Exchange to share a common key. This key-value behaves as a seed value in the formation of key sequences. A methodology has been proposed to encrypt paired digits using dynamic programming. Based on the shared common key, a table is generated on both sides of the sender and receiver to have a common data set. This data set helps in encryption and decryption both. The dynamic table uses the Fibonacci series and recursive functions to fill the table. Decryption needs searching operation in the receiver’s table which would search for (x, y) pair. This (x, y) pair is concatenated to produce plain text.

In this technological world, all our devices require an operating system to enable them to function properly. From digital clocks to laptops as a hardware devices, we require various types of operating systems to manages those resources. With so many devices we also need some privacy, and to do that we need good security hardware; software. But along with hardware, we need to rely on software too. Currently, Windows 10 has over 1 billion users worldwide. On the other hand we have chosen Tails that is a Linux based operating system with 25k active users and increasing day by day. Unlike windows which is centered around productivity, Tails is completely centered around anonymity. In this paper, we explore the security and anonymity issues in both the operating systems and the observations are well explained. The paper also include observations related to compatibility with hardware, installation process and various other features to identify the most suitable system in terms of security parameters.

Data Privacy is a prime concern in 21st century. To maintain secrecy of data, many cryptographic algorithms are available. Cryptography is the science or study of the techniques of secret writing, esp. code and also figures frameworks, techniques, and so forth. Cryptography is required so content can be kept secret. Here in our proposed work we have shown a simple point reflection based cryptographic technique for security of data. The user encoded the data using point reflection technique and the receiver can decode the data by applying the process in reverse direction. The encrypted message generated using the mechanism proposed here is quite sturdy and it becomes more difficult for a person to retrieve or predict the original message from the encrypted message. We used PRNG technique by which we can get the random number and also use the LFSR technique for robustness of this technique. Experimental result shows that our method gives a high security and the accuracy during the encoding and decoding process. We narrated the algorithms and explicit formulas to demonstrate that our reflection process support high practical security in cryptographic applications.

Natural disasters are the wrath of nature from which Earth has never been immune. Natural disasters like hurricanes, cyclones, earthquakes, mudslides, floods, wildfires, volcanic eruptions and weather events like extreme droughts and monsoons have struck human civilization for years. But due to Global warming and climate change due to human activities their frequency is likely to increase. These events disrupt the normal functioning of mankind, resulting in deaths of thousands and damage to infrastructure. In the wake of natural disaster all the ways of communication goes down and there is no way left to communicate with people who are stuck there and are in need of help. But with the advancement of technology and increasing use of social media in today’s era, we can somehow solve this problem. Today people are very much active on social media. Sites like Facebook and Twitter can be very much useful when a natural disaster strikes. In this paper, it is being explored how these social media sites can be useful during and after natural disaster in India. Twitter mining has been used to find out how people are using twitter in wake of a disaster like Kerala floods 2018 and Amphan Cyclone 2020 to communicate and help the people who are stuck in disaster stuck area and raise donations for them.

Dual cover steganography is an evolving technique in the field of covert data transmission. This paper focuses on the concept of using a theoretical single stranded DNA (ssDNA) as a primary cover, which is extracted from an inconspicuous cover image. We have analyzed the security loopholes and performance issues of the existing algorithm and proposed an improved algorithm on the same basis. Performance of both the algorithms are tested against several visual and statistical attacks, and parameterized in terms of both security and capacity. The comparison shows that the proposed improvements provide better overall security.

In this paper a novel data hiding method has been proposed which is based on Non-Linear Feedback Shift Register and Tinkerbell 2D chaotic map. So far, the major work in Steganography using chaotic map has been confined to image steganography where significant restrictions are there to increase payload. In our work, 2D chaotic map and NLFSR are used to developed a video steganography mechanism where data will be embedded in the segregated frames. This will increase the data hiding limit exponentially. Also, embedding position of each frame will be different from others frames which will increase the overall security of the proposed mechanism. We have achieved this randomized data hiding points by using a chaotic map. Basically, Chaotic theory which is non-linear dynamics physics is using in this era in the field of Cryptography and Steganography and because of this theory, little bit changes in initial condition makes the output totally different. So, it is very hard to get embedding position of data without knowing the initial value of the chaotic map.

Expression detection or Emotion Recognition is one of the rising fields of research on intelligent systems. Emotion plays a significant role in non-verbal communication. An efficient face and facial feature detection algorithms are required to detect emotion at that particular moment. The paperpresents a new approach to the problem of extracting the facial components from a still facial image which will be used further for Facial Expression detection. Robust extraction of such facial feature locations is a crucial problem which is used in a wide range of applications. Facial features such as lip corners, eye corners and nose tip are critical points in a human face. Thepaper approach relies on image segmentation based on skin color algorithm and fiducial point detection. First, the face region is extracted from the image by skin-color filter and window growing. Second, eyes and mouth are approximately located by projection of fiducial point. It is been observed for subjects not wearing glasses, the extraction of eyes could be correctly located in 94% of the images and in over 90% of these images they could be accurately extracted, while for subjects wearing glasses, the success rate is somewhat lower. Also, in certain moods or depending on the facial expression, the detection of lips in case of mouth opening and closing varies which can also be extracted by our method. Keywordsextraction, fiducial point, facial expression.

Voice Recognition is a fascinating field spanning several areas of computer science and mathematics. Reliable speech recognition is a hard problem, requiring a combination of many complex techniques; however modern methods have been able to achieve an impressive degree of accuracy. On the other hand, today, most of the companies or institutes are conducting their examinations online to be a part of this best ever growing world. In this system user can give any available examination at any accessible center as per his/her choice and authority also can condense manpower and process delay overhead. This paper offers one way to conduct online examination for physically challenged people who can use their voice only to register and attend the examination. In addition, in the course of this paper it has been tried to authenticate one registered user and to make the authentication process persistent throughout the examination interlude.

Authentication is a significant issue in system control in computer based communication. Human face recognition is an important branch of biometric verification and has been widely used in many applications, such as video monitor system, human-computer interaction, and door control system and network security. This paper describes a method for Student's Attendance System which will integrate with the face recognition technology using Personal Component Analysis (PCA) algorithm. The system will record the attendance of the students in class room environment automatically and it will provide the facilities to the faculty to access the information of the students easily by maintaining a log for clock-in and clock-out time.

The decision regarding widely acceptable stream cipher for hardware security is one of the challenging assignment. Trivium cipher is ironed out most of the weakness of the other stream ciphers. Beside this, our paper presents the security analysis of Trivium and some modification of cipher which gives better security level. Our primary focus is finding some particular biases of output and reasonable algebraic attack with some guessing approach. More specifically, we show some modifications which can increase its security level without changing its internal structure. For this cipher finally we obtain some new cryptanalytic result and the next part of the paper we study some algebraic analysis of Trivium cipher and we try to show that it is vulnerable to different types of attacks and try to recover the overall internal state of the stream cipher.

In this paper, a new steganography method for spatial domain has been proposed, which includes a new mapping technique for the secret messages. The algorithm coverts any kinds of message to text using bit manipulation tables, applies hill cipher techniques to it and finally hides the message into red, green and blue images of a selected image. Therefore, the proposed algorithm is a combination of encryption of the message first then hiding the message into the cover image which provides double security. The result of the proposed algorithm is analyzed and discussed using MSE, PSNR, SC, AD, MD and NAE. The histogram of the cover and stegano image is also shown.

The age-old LSB steganography is one of the easiest and most commonly used data-hiding techniques. Although higher payload delivery can be achieved, it has poor acceptance due to the perceivable impact it leaves on the cover media. Our proposed algorithm strengthens the LSB encoding by not only minimizing the perceivable distortion but also making original message reconstruction by an attacker highly impossible, due to vast key-space. The bit replacement process is guided by a selected indicator color channel, and the embedding sequence is controlled by an indicator pattern table value indexed by the secret message bits. For efficient extraction at the receiver end, the indicator and other metadata are hidden inside the same cover in the form of a header. Encryption of data and header by RC4 cipher adds another layer of security.

Cryptography is a science of encoding a secret message in a manner so that any other person other than the receiver and the sender cannot be able to decode it, whereas the steganography is the science of concealing the information in any other cover media so that an attacker cannot recognize the presence of the secret message inside the cover media. This paper proposes a method using combined technologies of cryptography and steganography by following the concept of genetic engineering based on the DNA. This approach will enhance the message security, which is the main concern in today’s world for message transmission. In this proposed algorithm, a long and strong 256-bit key is used for encryption with a strong new method of encryption, generation of DNA sequence, and a new method to conceal the encrypted DNA sequence to a cover image, which provides better security in the message against the intruders attack.

Secure data communication is the most important and essential issue in the area of message transmission over the networks. Cryptography provides the way of making secure message for confidential message transfer. Cryptography is the process of transforming the sender's message to a secret format called cipher text that only intended receiver will get understand the meaning of the secret message. There are various cryptographic or DNA based encoding algorithms have been proposed in order to make secret message for communication. But all these proposed DNA based encryption algorithms are not secure enough to provide better security as compared with the today's security requirement. In this paper, we have proposed a technique of encryption that will enhance the message security. In this proposed algorithm, a new method of DNA based encryption with a strong key of 256 bit is used. Along with this big size key various other encoding tools are used as key in the encoding process of the message like random series of DNA bases, modified DNA bases coding. Moreover a new method of round key selection is also given in this paper to provide better security in the message. The cipher text contains the extra bit of information as similar with the DNA strands that will provide better and enhanced security against intruder's attack.

Due to massive expansion of network computer systemS it became very difficult to manage those systems. Now a day's many intruders are present who take advantages of these internet facilities and that's why many unauthorized access is done. Intrusion detection system detects intrusion and also detects the malicious attacks and if any suspicious behavior is found it generate an alarm to the administrator and stops the work. In this paper we improve the intrusion detection system and use the Multiagent concept with multilevel intrusion detection system. Here we store the attack types in the database and when any types is matched with this database then it detects the intrusion. By this process no unknown attacks are detected.

Data security is one of the most significant concerned areas of communications and data transmission. The concept of making secure data is to transform a plain message that is understandable by everyone into a human unreadable format or difficult to make out by encoding message using some cryptographic algorithms. Now a day, security is one of the most significant and fundamental issues of data transmission, researchers are working on the evolvement of new cryptographic algorithms. Cryptography is the process of providing security in data while transmitting over public networks by encrypting the original data or message. Data security is concerned with the areas of communication and data transmission. An efficient direction of achieving data security can be termed as DNA based Cryptography. The encryption and decryption process proposed in this paper will use the DNA sequencing string of the DNA strands. We have proposed here how the DNA sequencing can be utilized in cryptographic algorithms and how the message can be made more secure and reliable for transmitting effectively through networks. The algorithm we have proposed here is a new algorithm which has three keys for encrypting the message along with a new method of key generation and key sharing for better security aspects. The cipher text generated by the algorithm is looks similar with the bio-logical structure of the DNA strands. Unnecessary bits are padded with the cipher text in order to make it more complex to the intruders. The encryption algorithm is designed here by using the property of DNA sequencing.

Finding the convex hull of a point set has applications in research fields as well as industrial tools. This paper presents a pre-processing algorithm for computing convex hull vertices in a 2D spatial point set. Based on the position of extreme points we divide the exterior points into four groups bounded by rectangles (p-Rect). Then inside each p-Rect we recursively find and check the extreme points to verify if they are eligible to be convex hull points or not. The process gives a small set of candidate points for convex hull computation. Efficiency of the algorithm is evaluated with respect to time and space. Performance comparison with other classical algorithms shows that implementation of this pre-processing algorithm significantly improves their performance by reducing computational overhead and time.

With the recent explosion of new technologies in the field of Cryptography, there comes the need for increasing the Security of the present voting system of India. The use of cryptographic protocols as well as biometrics provides a technical response to the security flaws of the current voting system in India. Voting is an instrument of democracy that provides an official mechanism for people to express their views to the government. And e-Voting is considered as one of the most intensely debated subjects in Information Technology. Thus, the voting system should be much more secure and it should also have the stronger authentication mechanism so as to remove fraud and cheats completely from the voting process. This paper proposes and discusses the design of a secure e-voting system based on cryptographic protocols and biometrics that can replace the traditional voting system of India.

In maintenance, assuring code quality and operation, software metrics is widely used by the various software organizations. Software metrics quantify different types of software complexity like size metrics, control flow metrics and data flow metrics. These software complexities must be continuously calculated, followed and controlled. One of the main objectives of software metrics is that measures static and dynamic metrics analysis. It is always considered that high degree of complexity in a fragment is bad in comparison to a low degree of complexity in a fragment. Software metrics can be used in different phases of the software lifecycle. In this paper we will discuss the different metrics and comparison between both static and dynamic metrics. We try to evaluate and analyze different aspects of software static and dynamic metrics in regression testing which offers of estimating the effort needed for testing.