Pub Date : 2018-05-03DOI: 10.1504/IJICS.2018.10012576
Soumitra Roy, Arup Kumar Pal
Among the various watermarking schemes, the reversible watermarking scheme has drawn extensive attention in the recent years for its application in sensitive issues like medical, military and typical law-enforcement images. Cover image dependent embedding capacity and lack of robustness are the most crucial concerns of the reversible watermarking methods. To overcome these issues, a discrete cosine transform (DCT) and histogram shifting based robust reversible image watermarking scheme using Arnold scrambling is presented in this paper. Initially, the image is decomposed into non-overlapping blocks and consequently DCT are applied to each block to embed a binary bit of watermark into each transformed block by modifying one pair of middle significant AC coefficients. In this initial step, location map is also generated for the cover image restoration purpose in the extracting side. Then, this location map is embedded in the cover image using histogram modification technique. In the receiver side, at first location map is generated from an image using histogram modification method and watermark is recovered from the corresponding image. Using location map reversible image is reversed in the following extracting phase of the proposed method. The proposed reversible watermarking scheme has also been experimented to verify the robustness property against several image processing attacks and satisfactory results are achieved.
{"title":"A robust reversible image watermarking scheme in DCT domain using Arnold scrambling and histogram modification","authors":"Soumitra Roy, Arup Kumar Pal","doi":"10.1504/IJICS.2018.10012576","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012576","url":null,"abstract":"Among the various watermarking schemes, the reversible watermarking scheme has drawn extensive attention in the recent years for its application in sensitive issues like medical, military and typical law-enforcement images. Cover image dependent embedding capacity and lack of robustness are the most crucial concerns of the reversible watermarking methods. To overcome these issues, a discrete cosine transform (DCT) and histogram shifting based robust reversible image watermarking scheme using Arnold scrambling is presented in this paper. Initially, the image is decomposed into non-overlapping blocks and consequently DCT are applied to each block to embed a binary bit of watermark into each transformed block by modifying one pair of middle significant AC coefficients. In this initial step, location map is also generated for the cover image restoration purpose in the extracting side. Then, this location map is embedded in the cover image using histogram modification technique. In the receiver side, at first location map is generated from an image using histogram modification method and watermark is recovered from the corresponding image. Using location map reversible image is reversed in the following extracting phase of the proposed method. The proposed reversible watermarking scheme has also been experimented to verify the robustness property against several image processing attacks and satisfactory results are achieved.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116016736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-03DOI: 10.1504/IJICS.2018.10012572
Amita, A. Kaur, Marut Kumar
Due to advancement in communication technology, data are transmitted over the network which is either confidential or private. So, the information security is one of the most critical factors considered when secret data is transmitted between two parties. Another important issue is the bandwidth utilisation for data transmission. Image steganography is a widely used technique for data hiding. It is used in critical applications like military and medical areas. Most of the work is done in uncompressed images, which leads to high storage and large bandwidth required for transmission. Keeping these two factors in mind, this paper presents the multilevel histogram shifting technique in the compressed domain with the addition of adaptive block division scheme to improve the embedding capacity as well as reduce the utilisation of the bandwidth. In this method, absolute moment block truncation coding (AMBTC) compression technique has been used for compression because of its good compression ratio.
{"title":"Reversible data hiding in absolute moment block truncation coding compressed images using adaptive multilevel histogram shifting technique","authors":"Amita, A. Kaur, Marut Kumar","doi":"10.1504/IJICS.2018.10012572","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012572","url":null,"abstract":"Due to advancement in communication technology, data are transmitted over the network which is either confidential or private. So, the information security is one of the most critical factors considered when secret data is transmitted between two parties. Another important issue is the bandwidth utilisation for data transmission. Image steganography is a widely used technique for data hiding. It is used in critical applications like military and medical areas. Most of the work is done in uncompressed images, which leads to high storage and large bandwidth required for transmission. Keeping these two factors in mind, this paper presents the multilevel histogram shifting technique in the compressed domain with the addition of adaptive block division scheme to improve the embedding capacity as well as reduce the utilisation of the bandwidth. In this method, absolute moment block truncation coding (AMBTC) compression technique has been used for compression because of its good compression ratio.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124353487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-03DOI: 10.1504/IJICS.2018.10012568
Shashank Gupta, B. Gupta
The authors introduced a universal and an automated server-side flexible framework, XSS-explorer, which automatically scrutinises the web applications in order to discover XSS attack vectors. XSS-explorer is capable enough for exploring and recognising all the injection points of web application and produces explicit XSS attack injection investigations for all such injection points. Our approach is based on methods permitting precise filling of injection points of forms with usable info. The identification of such injection points permits our technique to retrieve each possible web page of application, allowing a wider exploration and accelerating the discovery frequency of XSS attack vectors. We evaluate efficiency of our scheme on a suite of open source multimedia applications by applying F-test hypothesis and F-measure. These evaluations indorse that precise filling of the injection points by only usable info confirms an enhanced efficiency of the tests, thus accelerating the recognition rate of XSS attacks.
{"title":"Robust injection point-based framework for modern applications against XSS vulnerabilities in online social networks","authors":"Shashank Gupta, B. Gupta","doi":"10.1504/IJICS.2018.10012568","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012568","url":null,"abstract":"The authors introduced a universal and an automated server-side flexible framework, XSS-explorer, which automatically scrutinises the web applications in order to discover XSS attack vectors. XSS-explorer is capable enough for exploring and recognising all the injection points of web application and produces explicit XSS attack injection investigations for all such injection points. Our approach is based on methods permitting precise filling of injection points of forms with usable info. The identification of such injection points permits our technique to retrieve each possible web page of application, allowing a wider exploration and accelerating the discovery frequency of XSS attack vectors. We evaluate efficiency of our scheme on a suite of open source multimedia applications by applying F-test hypothesis and F-measure. These evaluations indorse that precise filling of the injection points by only usable info confirms an enhanced efficiency of the tests, thus accelerating the recognition rate of XSS attacks.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126083741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-03DOI: 10.1504/IJICS.2018.10012578
Dulal C. Kar, Anusha Madhuri Nakka, A. Katangur
We present a novel approach for audio steganography that preserves first-order statistical properties of cover audio after embedding a secret message. This approach can avoid detection by histogram-based or similar statistical attacks. This approach partitions the audio samples in the cover audio, which is followed by reordering of the samples in each partition through an encoding process for embedding the secret message. Partitioning of samples is governed by a specified error limit on individual samples, and the error limit is determined from signal-to-noise ratio that needs to be maintained in the stego audio to avoid detection by an automated system or human auditory system. Experimental results on effectiveness as well as on capacity are presented using 8-bit and 16-bit audio as covers. It is shown that the proposed approach can achieve high capacity while maintaining its effectiveness against attacks.
{"title":"A new statistical attack resilient steganography scheme for hiding messages in audio files","authors":"Dulal C. Kar, Anusha Madhuri Nakka, A. Katangur","doi":"10.1504/IJICS.2018.10012578","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012578","url":null,"abstract":"We present a novel approach for audio steganography that preserves first-order statistical properties of cover audio after embedding a secret message. This approach can avoid detection by histogram-based or similar statistical attacks. This approach partitions the audio samples in the cover audio, which is followed by reordering of the samples in each partition through an encoding process for embedding the secret message. Partitioning of samples is governed by a specified error limit on individual samples, and the error limit is determined from signal-to-noise ratio that needs to be maintained in the stego audio to avoid detection by an automated system or human auditory system. Experimental results on effectiveness as well as on capacity are presented using 8-bit and 16-bit audio as covers. It is shown that the proposed approach can achieve high capacity while maintaining its effectiveness against attacks.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133126131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-03DOI: 10.1504/IJICS.2018.10012569
Yujuan Sun, Xiaofeng Zhang, Muwei Jian
The three-dimensional reconstruction from single input image is quite difficult due to many unknown parameters, such as the light conditions, the surface normal and albedo of the object. However, there are overall similar characteristics for different human faces, such as the shapes and the positions of the eyes, nose; mouth and ears are generally identical. The similar characteristics has been used in this paper to relax the numbers of the input face images, and reconstruct the 3D shape based on a couple statistical model. Moreover, the light condition of the single input image can be different from that of training database. The experiment results show the effectiveness of the proposed method.
{"title":"3D reconstruction of human face from an input image under random lighting condition","authors":"Yujuan Sun, Xiaofeng Zhang, Muwei Jian","doi":"10.1504/IJICS.2018.10012569","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012569","url":null,"abstract":"The three-dimensional reconstruction from single input image is quite difficult due to many unknown parameters, such as the light conditions, the surface normal and albedo of the object. However, there are overall similar characteristics for different human faces, such as the shapes and the positions of the eyes, nose; mouth and ears are generally identical. The similar characteristics has been used in this paper to relax the numbers of the input face images, and reconstruct the 3D shape based on a couple statistical model. Moreover, the light condition of the single input image can be different from that of training database. The experiment results show the effectiveness of the proposed method.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117108866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-03DOI: 10.1504/IJICS.2018.10012575
R. Raja, T. S. Sinha, Rajkumar Patra, S. Tiwari
In the recent times, it has been found from the literature that, only front-view of human-face images are used for the authentication of the human being. Very little amount of work has been carried out using side-view and temporal-view of the human-face for the authentication of the human being. The main fact lies in the mentality of present youth, who are very busy in taking the photographs with different poses. Generally the poses are taken from side-view. Hence in the present paper, the main focus has been kept, in the authentication process using methods of recent trends in the field of engineering. The main objective is to handle the variability in human-face appearances due to changes in the viewing direction. Poses, illumination conditions, and expressions are considered as three main parameters, which are processed for the overall authentication process. For the overall processing, extensive feature set like texture, contrast, correlation and shape are extracted by employing modified region growing algorithm and texture feature by local Gabor XOR pattern (LGXP) and artificial neural network (ANN) technique. The present work has been analysed using the data of different subjects with varying ages.
{"title":"Physiological trait-based biometrical authentication of human-face using LGXP and ANN techniques","authors":"R. Raja, T. S. Sinha, Rajkumar Patra, S. Tiwari","doi":"10.1504/IJICS.2018.10012575","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012575","url":null,"abstract":"In the recent times, it has been found from the literature that, only front-view of human-face images are used for the authentication of the human being. Very little amount of work has been carried out using side-view and temporal-view of the human-face for the authentication of the human being. The main fact lies in the mentality of present youth, who are very busy in taking the photographs with different poses. Generally the poses are taken from side-view. Hence in the present paper, the main focus has been kept, in the authentication process using methods of recent trends in the field of engineering. The main objective is to handle the variability in human-face appearances due to changes in the viewing direction. Poses, illumination conditions, and expressions are considered as three main parameters, which are processed for the overall authentication process. For the overall processing, extensive feature set like texture, contrast, correlation and shape are extracted by employing modified region growing algorithm and texture feature by local Gabor XOR pattern (LGXP) and artificial neural network (ANN) technique. The present work has been analysed using the data of different subjects with varying ages.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121661232","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-03DOI: 10.1504/IJICS.2018.10012571
Vandana Mohindru, Yashwant Singh
Wireless sensor networks (WSN) consist of small size sensor nodes with limited sensing, processing, communication, and storage capabilities. These sensor nodes are vulnerable to the node clone attack where the attacker compromises the node and extracts secret information from the node and replicate the large numbers of clones of captured node throughout the sensor network. Therefore, providing security in such networks is of utmost importance. The main challenge to achieve this is to make the security solution energy efficient so that it is feasible to implement in such resource constrained nodes in WSN. In this paper, an energy efficient algorithm is proposed for node authentication. The aim of node authentication algorithm is to authenticate the sensor nodes before message communication within WSN so that cloned nodes are identified in the initial step of the communication. This algorithm uses encryption decryption operations and also XOR, extraction, bitwise shift operations. The performance of the proposed algorithm is analysed in terms of communication, storage, and computation overheads metrics. Finally, performance of the proposed algorithm is analysed with the other node authentication algorithms.
{"title":"Node authentication algorithm for securing static wireless sensor networks from node clone attack","authors":"Vandana Mohindru, Yashwant Singh","doi":"10.1504/IJICS.2018.10012571","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012571","url":null,"abstract":"Wireless sensor networks (WSN) consist of small size sensor nodes with limited sensing, processing, communication, and storage capabilities. These sensor nodes are vulnerable to the node clone attack where the attacker compromises the node and extracts secret information from the node and replicate the large numbers of clones of captured node throughout the sensor network. Therefore, providing security in such networks is of utmost importance. The main challenge to achieve this is to make the security solution energy efficient so that it is feasible to implement in such resource constrained nodes in WSN. In this paper, an energy efficient algorithm is proposed for node authentication. The aim of node authentication algorithm is to authenticate the sensor nodes before message communication within WSN so that cloned nodes are identified in the initial step of the communication. This algorithm uses encryption decryption operations and also XOR, extraction, bitwise shift operations. The performance of the proposed algorithm is analysed in terms of communication, storage, and computation overheads metrics. Finally, performance of the proposed algorithm is analysed with the other node authentication algorithms.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130966876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-03DOI: 10.1504/IJICS.2018.10012574
M. Shafiq, Xiangzhan Yu, A. Laghari
In this research paper, we present the first classification study to classify WeChat application service flow traffic (text messages, picture messages, audio call and video call traffic) classification and secondly to find out the effectiveness of big dataset and small dataset as well as to find out effective machine learning classifiers. We firstly capture WeChat traffic and then extract 44 features then we combine capture traffic to make full instance of dataset. Then we make reduce instances of dataset from the full instance of dataset to show the effectiveness of large dataset and small dataset. Then we execute well known machine learning classifiers. Using statistical test, we use Wilcoxon and Friedman statistical test for the datasets and ML classifiers to find more deeply its effectiveness. Experimental results show that reduce instance dataset show high accuracy result compared to full instance and C4.5 classifier perform effectively as compared to other classifiers.
{"title":"WeChat traffic classification using machine learning algorithms and comparative analysis of datasets","authors":"M. Shafiq, Xiangzhan Yu, A. Laghari","doi":"10.1504/IJICS.2018.10012574","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012574","url":null,"abstract":"In this research paper, we present the first classification study to classify WeChat application service flow traffic (text messages, picture messages, audio call and video call traffic) classification and secondly to find out the effectiveness of big dataset and small dataset as well as to find out effective machine learning classifiers. We firstly capture WeChat traffic and then extract 44 features then we combine capture traffic to make full instance of dataset. Then we make reduce instances of dataset from the full instance of dataset to show the effectiveness of large dataset and small dataset. Then we execute well known machine learning classifiers. Using statistical test, we use Wilcoxon and Friedman statistical test for the datasets and ML classifiers to find more deeply its effectiveness. Experimental results show that reduce instance dataset show high accuracy result compared to full instance and C4.5 classifier perform effectively as compared to other classifiers.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115279791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-02DOI: 10.1504/IJICS.2018.10010648
C. P. Kumar, R. Selvakumar, R. K. Bhattar
Ensuring reliability and security has been a challenge in modern communication systems. To achieve these challenges, a novel reliable and secure communication system is designed in this paper. Reliability is achieved by constructing a class of error correcting codes called concatenated kernel codes. Security in terms of source authentication is achieved from using graph nature of trellis employing techniques from graph theory namely fundamental cut-set and fundamental circuit. It has been shown that the proposed communication framework achieves the goal of reliability and security considering the channel noise and cryptanalytic attacks. The theoretical basis of the proposed framework is validated and its performance is evaluated through simulations.
{"title":"Reliable and secure communication using fundamental cut-sets and fundamental circuits","authors":"C. P. Kumar, R. Selvakumar, R. K. Bhattar","doi":"10.1504/IJICS.2018.10010648","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10010648","url":null,"abstract":"Ensuring reliability and security has been a challenge in modern communication systems. To achieve these challenges, a novel reliable and secure communication system is designed in this paper. Reliability is achieved by constructing a class of error correcting codes called concatenated kernel codes. Security in terms of source authentication is achieved from using graph nature of trellis employing techniques from graph theory namely fundamental cut-set and fundamental circuit. It has been shown that the proposed communication framework achieves the goal of reliability and security considering the channel noise and cryptanalytic attacks. The theoretical basis of the proposed framework is validated and its performance is evaluated through simulations.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114831857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-02DOI: 10.1504/IJICS.2018.10005506
A. Bhattacharjya, Xiaofeng Zhong, J. Wang
In future internet architectures, end-to-end (E2E) secured personal messaging is essential. So here an E2E user two-way authenticated double encrypted messaging architecture based on hybrid RSA for private messaging is proposed. Our P2P protocol works over TCP protocol for creating direct connections in between, with IPv4 broadcast options to discover peers on the same LAN. Our protocol implements perfect forward secrecy using Diffie-Hellman key exchange with renegotiation capability in every session with optimal asymmetric encryption padding and random salts. For making hybrid RSA with double encryption, in encryption level, main RSA is integrated with efficient RSA to give more statistical complexity. In the decryption process, the CRT is used for very high efficiency with integration with shared RSA. Our architecture also gives a hassle-free, secure, peer-to-peer, strong and reliable platform with E2E encryption for private messaging and it can also work with future internet architectures.
{"title":"An end-to-end user two-way authenticated double encrypted messaging scheme based on hybrid RSA for the future internet architectures","authors":"A. Bhattacharjya, Xiaofeng Zhong, J. Wang","doi":"10.1504/IJICS.2018.10005506","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10005506","url":null,"abstract":"In future internet architectures, end-to-end (E2E) secured personal messaging is essential. So here an E2E user two-way authenticated double encrypted messaging architecture based on hybrid RSA for private messaging is proposed. Our P2P protocol works over TCP protocol for creating direct connections in between, with IPv4 broadcast options to discover peers on the same LAN. Our protocol implements perfect forward secrecy using Diffie-Hellman key exchange with renegotiation capability in every session with optimal asymmetric encryption padding and random salts. For making hybrid RSA with double encryption, in encryption level, main RSA is integrated with efficient RSA to give more statistical complexity. In the decryption process, the CRT is used for very high efficiency with integration with shared RSA. Our architecture also gives a hassle-free, secure, peer-to-peer, strong and reliable platform with E2E encryption for private messaging and it can also work with future internet architectures.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126267159","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：