The Experts below are selected from a list of 6195 Experts worldwide ranked by ideXlab platform
Asoke Nath - One of the best experts on this subject based on the ideXlab platform.
-
A CHALLENGE IN HIDING Encrypted Message IN LSB AND LSB+1 BIT POSITIONS IN VARIOUS Cover Files
2016Co-Authors: Joyshree Nath, Sankar Das, Shalabh Agarwal, Asoke NathAbstract:Abstract: The present work basically shows us how one can hide information in Encrypted form to any cover file such as.exe files, Microsoft office files,.dbf files, image files, audio files and video files. However, the size of the hidden Message must be very small in comparison to cover file which is an executable file. So far no one has tried to hide information inside any executable file. To make the system fully secured we first encrypt the secret Message using MSA algorithm (Nath et al.(1)) and then we hide the Encrypted Message inside the cover file. introduced a new method for hiding any Encrypted secret Message inside a cover file. For encrypting secret Message we have used new algorithm proposed by Nath et al(1). For hiding secret Message we have changed both LSB and LSB+1 bits of each byte of the cover file. A generalized method was proposed by Nath etal(2) where they embed the secret Message without going for any encryption.. The MSA(1) algorithm introduced a new randomization method for generating the randomized key matrix to encrypt plain text file and to decrypt cipher text file. The MSA (1) method also incorporates the multiple encryption and decryption process. To initiate the MSA algorithm the user has to enter a text_key, which can be of 16 characters long. This text_key is used to calculate the randomization number and the encryption number from the given text_key. The size of the encryption key matrix is 16x16 and the total number of matrices can be formed from 16 x 16 is 256! which is quite large and the MSA algorithm ensures that any of the pattern may be used for encryption as well as decryption process. To hide Encrypted secret Message in the cover file we have inserted the 8 bits of each character of Encrypted Message file in 4 consecutive bytes of the cover file such that only LSB an
-
New Secured Steganography Algorithm Using Encrypted Secret Message inside QRTM Code: System Implemented in Android Phone
2015 International Conference on Computational Intelligence and Communication Networks (CICN), 2015Co-Authors: Sayantan Majumdar, Abhisek Maiti, Asoke NathAbstract:Steganography is a method of hiding information, whereas the goal of cryptography is to make data unreadable. Both of these methodologies have their own advantages and disadvantages. Encrypted Messages are easily detectable. If someone is spying on communication channel for Encrypted Message, he/she can easily identify the Encrypted Messages. Encryption may draw unnecessary attention to the transferred Messages. This may lead to cryptanalysis of the Encrypted Message if the spy tries to know the Message. If the encryption technique is not strong enough, the Message may be deciphered. In contrast, Steganography tries to hide the data from third party by smartly embedding the data to some other file which is not at all related to the Message. Here care is to be taken to minimize the modification of the container file in the process of embedding data. But the disadvantage of steganography is that it is not as secure as cryptography. In the present method the authors have introduced three-step security. Firstly the secret Message is Encrypted using bit level columnar transposition method introduced by Nath et al and after that the Encrypted Message is embedded in some image file along with its size. Finally the modified image is encoded into a QR Code TM. The entire method has also been implemented for the Android mobile environment. This method may be used to transfer confidential Message through Android mobile phone.
-
advanced digital steganography using Encrypted secret Message and Encrypted embedded cover file
International Journal of Computer Applications, 2012Co-Authors: Joyshree Nath, Saima Ghosh, Asoke NathAbstract:In the present work the authors are proposing a new steganography method to hide any Encrypted secret Message in multiple steps. In step-1 the secret Message is Encrypted using TTJSA algorithm. In step-2 we embed this Encrypted Message inside one known image or audio file using 4-th bit from LSB substitution method. In step-3 we again encrypt the embedded cover file using TTJSA algorithm . Finally embed this Encrypted cover file in final known cover file which may be some image or audio file. In the present method the authors used data hiding and encryption in two steps to make the entire steganography method almost unbreakable. The sender and the receiver have to share a set of secret keys which should not be shared by any outsider who is not the sender or the receiver. Due to multiple time encryption and multiple time data hiding it is almost impossible for any intruder to extract secret Message from embedded cover file. Nath et al developed several steganography algorithm where the Encrypted secret Message is embedded inside some standard or non-standard cover file. It means the data hiding was done in one step but in the present study the encryption is done in two steps and data hiding is also done in two steps.. For encrypting secret Message the authors have used new algorithm namely TTJSA developed by Nath et al. In TTJSA method the authors have used bit-exchange, bit-xor and modified playfair method i.e. MSA.. For hiding Encrypted Message the authors have used substitution of bits in 4-th bit from LSB of the cover file. The present method may be used for sharing secret keys between sender and receiver and also to send some very important confidential Message from sender to receiver. In defense or in Banking sector also the present method may be used for sending some crucial and important Message. General Terms Data hiding and Retrieval.
-
Advanced Steganographic Approach for Hiding Encrypted Secret Message in LSB, LSB+1, LSB+2 and LSB+3 Bits in Non standard Cover Files
2011Co-Authors: Joyshree Nath, Sankar Das, Shalabh Agarwal, Asoke NathAbstract:In digital steganography normally image, audio or video files are the standard cover files or the host files for embedding secret Message such as text, image, audio or video. Nath et al.(2) explored the standard method for hiding secret Message inside standard cover files such as image, audio or video files. In the present work we have shown how we can hide secret Message in Encrypted form in some non standard cover files such as.exe,.com,.pdf,.doc,.xls,.mdb,.ppt files. However, the size of the secret Message must be very small in comparison to cover file. The secret Message is converted to Encrypted form using MSA algorithm(2) and then we hide the Encrypted Message inside the non standard cover file. To hide Encrypted secret Message we insert the 8 bits in 2 consecutive bytes of cover file in LSB, LSB+1, LSB+2 and LSB+3 positions. This method could be very effective to hide some information in some executable file
-
a challenge in hiding Encrypted Message in lsb and lsb 1 bitpositions in various cover files
Journal of Global Research in Computer Sciences, 2011Co-Authors: Joyshree Nath, Sankar Das, Shalabh Agarwal, Asoke NathAbstract:The present work basically shows us how one can hide information in Encrypted form to any cover file such as .exe files, Microsoft office files, .dbf files, image files, audio files and video files. However, the size of the hidden Message must be very small in comparison to cover file which is an executable file. So far no one has tried to hide information inside any executable file. To make the system fully secured we first encrypt the secret Message using MSA algorithm (Nath et al.(1)) and then we hide the Encrypted Message inside the cover file. introduced a new method for hiding any Encrypted secret Message inside a cover file. For encrypting secret Message we have used new algorithm proposed by Nath et al(1). For hiding secret Message we have changed both LSB and LSB+1 bits of each byte of the cover file. A generalized method was proposed by Nath etal(2) where they embed the secret Message without going for any encryption.. The MSA(1) algorithm introduced a new randomization method for generating the randomized key matrix to encrypt plain text file and to decrypt cipher text file. The MSA (1) method also incorporates the multiple encryption and decryption process. To initiate the MSA algorithm the user has to enter a text_key, which can be of 16 characters long. This text_key is used to calculate the randomization number and the encryption number from the given text_key. The size of the encryption key matrix is 16x16 and the total number of matrices can be formed from 16 x 16 is 256! which is quite large and the MSA algorithm ensures that any of the pattern may be used for encryption as well as decryption process. To hide Encrypted secret Message in the cover file we have inserted the 8 bits of each character of Encrypted Message file in 4 consecutive bytes of the cover file such that only LSB and LSB+1 bits are changed depending on the bit pattern of the Encrypted secret Message. To make system further secured one has to enter a password before the actual steganography process starts. We propose that our new method could be most appropriate for hiding any file in any non-standard cover file such as executable file, compiler, MS-Office files, Data Base files such as .DBF, text editor such as notepad plus the standard cover files such as image, audio, video files etc. The size of the secret Message be very small in comparison to the executable cover file. The present method may be implemented in mobile network, Bank data transactions in government sectors, in police department.
Suhas Diggavi - One of the best experts on this subject based on the ideXlab platform.
-
secret communication over broadcast erasure channels with state feedback
IEEE Transactions on Information Theory, 2015Co-Authors: Laszlo Czap, Vinod M Prabhakaran, Christina Fragouli, Suhas DiggaviAbstract:We consider a 1-to- $K$ communication scenario, where a source transmits private Messages to $K$ receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore the achievable rate region when we require that the Message to each receiver remains secret—in the information theoretical sense—from all the other receivers. We characterize the capacity of secure communication in all the cases where the capacity of the 1-to- $K$ communication scenario without the requirement of security is known. As a special case, we characterize the secret-Message capacity of a single receiver point-to-point erasure channel with public state-feedback in the presence of a passive eavesdropper. We find that in all the cases where we have an exact characterization, we can achieve the capacity using linear complexity two-phase schemes: in the first phase, we create appropriate secret keys, and in the second phase, we use them to encrypt each Message. We find that the amount of key we need is smaller than the size of the Message, and equal to the amount of Encrypted Message the potential eavesdroppers jointly collect. Moreover, we prove that a dishonest receiver that provides deceptive feedback cannot diminish the rate experienced by the honest receivers. We also develop a converse proof which reflects the two-phase structure of our achievability scheme. As a side result, our technique leads to a new outer bound proof for the nonsecure communication problem.
-
secret communication over broadcast erasure channels with state feedback
arXiv: Information Theory, 2014Co-Authors: Laszlo Czap, Vinod M Prabhakaran, Christina Fragouli, Suhas DiggaviAbstract:We consider a 1-to-$K$ communication scenario, where a source transmits private Messages to $K$ receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each transmission. We explore the achievable rate region when we require that the Message to each receiver remains secret - in the information theoretical sense - from all the other receivers. We characterize the capacity of secure communication in all the cases where the capacity of the 1-to-$K$ communication scenario without the requirement of security is known. As a special case, we characterize the secret-Message capacity of a single receiver point-to-point erasure channel with public state-feedback in the presence of a passive eavesdropper. We find that in all cases where we have an exact characterization, we can achieve the capacity by using linear complexity two-phase schemes: in the first phase we create appropriate secret keys, and in the second phase we use them to encrypt each Message. We find that the amount of key we need is smaller than the size of the Message, and equal to the amount of Encrypted Message the potential eavesdroppers jointly collect. Moreover, we prove that a dishonest receiver that provides deceptive feedback cannot diminish the rate experienced by the honest receivers. We also develop a converse proof which reflects the two-phase structure of our achievability scheme. As a side result, our technique leads to a new outer bound proof for the non-secure communication problem.
Laszlo Czap - One of the best experts on this subject based on the ideXlab platform.
-
secret communication over broadcast erasure channels with state feedback
IEEE Transactions on Information Theory, 2015Co-Authors: Laszlo Czap, Vinod M Prabhakaran, Christina Fragouli, Suhas DiggaviAbstract:We consider a 1-to- $K$ communication scenario, where a source transmits private Messages to $K$ receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore the achievable rate region when we require that the Message to each receiver remains secret—in the information theoretical sense—from all the other receivers. We characterize the capacity of secure communication in all the cases where the capacity of the 1-to- $K$ communication scenario without the requirement of security is known. As a special case, we characterize the secret-Message capacity of a single receiver point-to-point erasure channel with public state-feedback in the presence of a passive eavesdropper. We find that in all the cases where we have an exact characterization, we can achieve the capacity using linear complexity two-phase schemes: in the first phase, we create appropriate secret keys, and in the second phase, we use them to encrypt each Message. We find that the amount of key we need is smaller than the size of the Message, and equal to the amount of Encrypted Message the potential eavesdroppers jointly collect. Moreover, we prove that a dishonest receiver that provides deceptive feedback cannot diminish the rate experienced by the honest receivers. We also develop a converse proof which reflects the two-phase structure of our achievability scheme. As a side result, our technique leads to a new outer bound proof for the nonsecure communication problem.
-
secret communication over broadcast erasure channels with state feedback
arXiv: Information Theory, 2014Co-Authors: Laszlo Czap, Vinod M Prabhakaran, Christina Fragouli, Suhas DiggaviAbstract:We consider a 1-to-$K$ communication scenario, where a source transmits private Messages to $K$ receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each transmission. We explore the achievable rate region when we require that the Message to each receiver remains secret - in the information theoretical sense - from all the other receivers. We characterize the capacity of secure communication in all the cases where the capacity of the 1-to-$K$ communication scenario without the requirement of security is known. As a special case, we characterize the secret-Message capacity of a single receiver point-to-point erasure channel with public state-feedback in the presence of a passive eavesdropper. We find that in all cases where we have an exact characterization, we can achieve the capacity by using linear complexity two-phase schemes: in the first phase we create appropriate secret keys, and in the second phase we use them to encrypt each Message. We find that the amount of key we need is smaller than the size of the Message, and equal to the amount of Encrypted Message the potential eavesdroppers jointly collect. Moreover, we prove that a dishonest receiver that provides deceptive feedback cannot diminish the rate experienced by the honest receivers. We also develop a converse proof which reflects the two-phase structure of our achievability scheme. As a side result, our technique leads to a new outer bound proof for the non-secure communication problem.
Joyshree Nath - One of the best experts on this subject based on the ideXlab platform.
-
A CHALLENGE IN HIDING Encrypted Message IN LSB AND LSB+1 BIT POSITIONS IN VARIOUS Cover Files
2016Co-Authors: Joyshree Nath, Sankar Das, Shalabh Agarwal, Asoke NathAbstract:Abstract: The present work basically shows us how one can hide information in Encrypted form to any cover file such as.exe files, Microsoft office files,.dbf files, image files, audio files and video files. However, the size of the hidden Message must be very small in comparison to cover file which is an executable file. So far no one has tried to hide information inside any executable file. To make the system fully secured we first encrypt the secret Message using MSA algorithm (Nath et al.(1)) and then we hide the Encrypted Message inside the cover file. introduced a new method for hiding any Encrypted secret Message inside a cover file. For encrypting secret Message we have used new algorithm proposed by Nath et al(1). For hiding secret Message we have changed both LSB and LSB+1 bits of each byte of the cover file. A generalized method was proposed by Nath etal(2) where they embed the secret Message without going for any encryption.. The MSA(1) algorithm introduced a new randomization method for generating the randomized key matrix to encrypt plain text file and to decrypt cipher text file. The MSA (1) method also incorporates the multiple encryption and decryption process. To initiate the MSA algorithm the user has to enter a text_key, which can be of 16 characters long. This text_key is used to calculate the randomization number and the encryption number from the given text_key. The size of the encryption key matrix is 16x16 and the total number of matrices can be formed from 16 x 16 is 256! which is quite large and the MSA algorithm ensures that any of the pattern may be used for encryption as well as decryption process. To hide Encrypted secret Message in the cover file we have inserted the 8 bits of each character of Encrypted Message file in 4 consecutive bytes of the cover file such that only LSB an
-
advanced digital steganography using Encrypted secret Message and Encrypted embedded cover file
International Journal of Computer Applications, 2012Co-Authors: Joyshree Nath, Saima Ghosh, Asoke NathAbstract:In the present work the authors are proposing a new steganography method to hide any Encrypted secret Message in multiple steps. In step-1 the secret Message is Encrypted using TTJSA algorithm. In step-2 we embed this Encrypted Message inside one known image or audio file using 4-th bit from LSB substitution method. In step-3 we again encrypt the embedded cover file using TTJSA algorithm . Finally embed this Encrypted cover file in final known cover file which may be some image or audio file. In the present method the authors used data hiding and encryption in two steps to make the entire steganography method almost unbreakable. The sender and the receiver have to share a set of secret keys which should not be shared by any outsider who is not the sender or the receiver. Due to multiple time encryption and multiple time data hiding it is almost impossible for any intruder to extract secret Message from embedded cover file. Nath et al developed several steganography algorithm where the Encrypted secret Message is embedded inside some standard or non-standard cover file. It means the data hiding was done in one step but in the present study the encryption is done in two steps and data hiding is also done in two steps.. For encrypting secret Message the authors have used new algorithm namely TTJSA developed by Nath et al. In TTJSA method the authors have used bit-exchange, bit-xor and modified playfair method i.e. MSA.. For hiding Encrypted Message the authors have used substitution of bits in 4-th bit from LSB of the cover file. The present method may be used for sharing secret keys between sender and receiver and also to send some very important confidential Message from sender to receiver. In defense or in Banking sector also the present method may be used for sending some crucial and important Message. General Terms Data hiding and Retrieval.
-
Advanced Steganographic Approach for Hiding Encrypted Secret Message in LSB, LSB+1, LSB+2 and LSB+3 Bits in Non standard Cover Files
2011Co-Authors: Joyshree Nath, Sankar Das, Shalabh Agarwal, Asoke NathAbstract:In digital steganography normally image, audio or video files are the standard cover files or the host files for embedding secret Message such as text, image, audio or video. Nath et al.(2) explored the standard method for hiding secret Message inside standard cover files such as image, audio or video files. In the present work we have shown how we can hide secret Message in Encrypted form in some non standard cover files such as.exe,.com,.pdf,.doc,.xls,.mdb,.ppt files. However, the size of the secret Message must be very small in comparison to cover file. The secret Message is converted to Encrypted form using MSA algorithm(2) and then we hide the Encrypted Message inside the non standard cover file. To hide Encrypted secret Message we insert the 8 bits in 2 consecutive bytes of cover file in LSB, LSB+1, LSB+2 and LSB+3 positions. This method could be very effective to hide some information in some executable file
-
a challenge in hiding Encrypted Message in lsb and lsb 1 bitpositions in various cover files
Journal of Global Research in Computer Sciences, 2011Co-Authors: Joyshree Nath, Sankar Das, Shalabh Agarwal, Asoke NathAbstract:The present work basically shows us how one can hide information in Encrypted form to any cover file such as .exe files, Microsoft office files, .dbf files, image files, audio files and video files. However, the size of the hidden Message must be very small in comparison to cover file which is an executable file. So far no one has tried to hide information inside any executable file. To make the system fully secured we first encrypt the secret Message using MSA algorithm (Nath et al.(1)) and then we hide the Encrypted Message inside the cover file. introduced a new method for hiding any Encrypted secret Message inside a cover file. For encrypting secret Message we have used new algorithm proposed by Nath et al(1). For hiding secret Message we have changed both LSB and LSB+1 bits of each byte of the cover file. A generalized method was proposed by Nath etal(2) where they embed the secret Message without going for any encryption.. The MSA(1) algorithm introduced a new randomization method for generating the randomized key matrix to encrypt plain text file and to decrypt cipher text file. The MSA (1) method also incorporates the multiple encryption and decryption process. To initiate the MSA algorithm the user has to enter a text_key, which can be of 16 characters long. This text_key is used to calculate the randomization number and the encryption number from the given text_key. The size of the encryption key matrix is 16x16 and the total number of matrices can be formed from 16 x 16 is 256! which is quite large and the MSA algorithm ensures that any of the pattern may be used for encryption as well as decryption process. To hide Encrypted secret Message in the cover file we have inserted the 8 bits of each character of Encrypted Message file in 4 consecutive bytes of the cover file such that only LSB and LSB+1 bits are changed depending on the bit pattern of the Encrypted secret Message. To make system further secured one has to enter a password before the actual steganography process starts. We propose that our new method could be most appropriate for hiding any file in any non-standard cover file such as executable file, compiler, MS-Office files, Data Base files such as .DBF, text editor such as notepad plus the standard cover files such as image, audio, video files etc. The size of the secret Message be very small in comparison to the executable cover file. The present method may be implemented in mobile network, Bank data transactions in government sectors, in police department.
Willy Susilo - One of the best experts on this subject based on the ideXlab platform.
-
two factor data security protection mechanism for cloud storage system
IEEE Transactions on Computers, 2016Co-Authors: Joseph K Liu, Willy Susilo, Kaitai Liang, Jianghua Liu, Yang XiangAbstract:In this paper, we propose a two-factor data security protection mechanism with factor revocability for cloud storage system. Our system allows a sender to send an Encrypted Message to a receiver through a cloud storage server. The sender only needs to know the identity of the receiver but no other information (such as its public key or its certificate). The receiver needs to possess two things in order to decrypt the ciphertext. The first thing is his/her secret key stored in the computer. The second thing is a unique personal security device which connects to the computer. It is impossible to decrypt the ciphertext without either piece. More importantly, once the security device is stolen or lost, this device is revoked. It cannot be used to decrypt any ciphertext. This can be done by the cloud server which will immediately execute some algorithms to change the existing ciphertext to be un-decryptable by this device. This process is completely transparent to the sender. Furthermore, the cloud server cannot decrypt any ciphertext at any time. The security and efficiency analysis show that our system is not only secure but also practical.
-
self generated certificate public key cryptography and certificateless signature encryption scheme in the standard model extended abstract
Computer and Communications Security, 2007Co-Authors: Joseph K Liu, Willy SusiloAbstract:Certificateless Public Key Cryptography (CL-PKC) enjoys a number of features of Identity-Based Cryptography (IBC) while without having the problem of key escrow. However, it does suffer from an attack where the adversary, Carol, replaces Alice's public key by someone's public key so that Bob, who wants to send an Encrypted Message to Alice, uses Alice's identity and other's public key as the inputs to the encryption function. As a result, Alice cannot decrypt the Message while Bob is unaware of this. We call it Denial-of-Decryption (DoD) Attack as its nature is similar to the well known Denial-of-Service (DoS) Attack. Based on CL-PKC, we propose a new paradigm called Self-Generated-Certificate Public Key Cryptography (SGC-PKC) that captures the DoD Attack. We also provide a generic construction of a self-generated-certificate public key encryption scheme in the standard model. Our generic construction uses certificateless signature and certificateless encryption as the building block. In addition, we further propose a certificateless signature and a certificateless encryption scheme with concrete implementation that are all provably secure in the standard model, which are the first in the literature regardless of the generic constructions by Yum and Lee which may contain security weaknesses as pointed out by others. We believe these concrete implementations are of independent interest.
-
self generated certificate public key cryptography and certificateless signature encryption scheme in the standard model
IACR Cryptology ePrint Archive, 2006Co-Authors: Joseph K Liu, Willy SusiloAbstract:Certificateless Public Key Cryptography (CL-PKC) enjoys a number of features of Identity-Based Cryptography (IBC) while without having the problem of key escrow. However, it does suffer to an attack where the adversary, Carol, replaces Alice’s public key by someone’s public key so that Bob, who wants to send an Encrypted Message to Alice, uses Alice’s identity and other’s public key as the inputs to the encryption function. As a result, Alice cannot decrypt the Message while Bob is unaware of this. We call it Denial-of-Decryption (DoD) Attack as its nature is similar to the well known Denial-of-Service (DoS) Attack. Based on CL-PKC, we propose a new paradigm called Self-Generated-Certificate Public Key Cryptography (SGC-PKC) that captures the DoD Attack. We also provide a generic construction of a self-generated-certificate public key encryption scheme in the standard model. Our generic construction uses certificateless signature and certificateless encryption as the building block. In addition, we further propose a certificateless signature and a certificateless encryption scheme with concrete implementation that are all provably secure in the standard model, which are the first in the literature regardless of the generic constructions by Yum and Lee which may contain security weaknesses as pointed out by others. We believe these concrete implementations are of independent interest.