Study on Secrecy and Privacy Preserving Approaches over Cloud Data Outsourcing
Performing a smart usage of collection of services, applications and infrastructure composed of p... more Performing a smart usage of collection of services, applications and infrastructure composed of pool of computer resources, Cloud Computing has become promising hosting platform. Cloud architectures have cost-efficient and flexible backbones that support resource transmission, storage and computing of the applications. All these infrastructures are very useful for business, scientific and pervasive computing. The diversity of the services delivered by the cloud computing increases their vulnerability to security attacks. In order to improve the clients trust over the information and services in cloud computing environment, the assurance of security in the presence of semi-trusted and untrusted cloud provider is a critical issue. To address these issues, researchers have presented various secrecy and privacy preserving approaches. In this paper, we have surveyed recent various centralized and distributed secrecy and privacy preserving approaches for cloud computing environment.
Implementation of Automatic Variable Key with Chaos Theory and Studies Thereof
Automatic Variable Key (AVK) has been studied as a means of time variant key towards achieving pe... more Automatic Variable Key (AVK) has been studied as a means of time variant key towards achieving perfect security. This paper investigates the implementation of AVK with chaos theory with the existing cryptographic algorithms where it is not necessary to exchange the session key in sessions other than the first session. The initial key is generated using the concept of chaos theory and the key so generated is exchanged between the sender and the receiver by public key. Thereafter, the key of each of other sessions is made to change as a function of data of plaintext as in normal AVK. An experiment was performed to study the differential attack in normal cipher, cipher with normal AVK and cipher with AVK with chaos theory. The findings revealed that the differential attack was minimum in the case of cipher with AVK with chaos theory. The reduction of differential attack was due to the application of chaos theory in the initial key generation.
Chaos-based medical image encryption scheme using special nonlinear filtering function based LFSR
Multimedia Tools and Applications
In this paper, a new medical image encryption system is proposed using a special nonlinear filter... more In this paper, a new medical image encryption system is proposed using a special nonlinear filter function based linear feedback shift register (LFSR). This special nonlinear filter function based LFSR is used as a pseudo-random number generator (PRNG). In this generator, word-based effective operation has been applied to speed up the process of encryption and decryption. Firstly, the medical image is randomized by Logistic-Tent map and scrambled by Arnold transformation method. Next, the disordered image data is XORed with output sequences of specially designed PRNG to obtain cipher image. Our designed structure aims to provide high-level randomness in the cipher image content. Encryption decryption time requirements reveal the efficiency of the proposed system. Several performance measures are estimated to validate the resistance of the proposed scheme against statistical, differential, and a few common cryptanalytic attacks. The proposed encryption scheme compares favorably with several existing image encryption schemes.
In a democratic country, voting is one of the most important activ-ity. In many democracies over ... more In a democratic country, voting is one of the most important activ-ity. In many democracies over the years, there has been decrease in the number of voters coming for election because of the incon-venient voting system. An electronic voting scheme allows voters to vote securely from distance through internet by interacting with a set of authorities. However there is always a chance that an ad-versary can corrupt the users and jeopardize the voting system. In this paper, we have proposed an E-voting protocol that ensures the three most important requirements of E-voting system i.e privacy, verifiability and fairness even in case when some of the users are malicious.
Currently, short signature is receiving significant attention since it is particularly useful in ... more Currently, short signature is receiving significant attention since it is particularly useful in low-bandwidth communication environments. In this paper, a short signature scheme is proposed from weil pairing. The proposed scheme is efficient as lesser number of cost effective pairing operations involved. We analyze security and efficiency comparison of the proposed scheme with other short signature schemes.
Proceedings of the International Conference on Computing and Communication Systems
DDoS attacks deplete network bandwidth and render the services unavailable to normal users. In sp... more DDoS attacks deplete network bandwidth and render the services unavailable to normal users. In spite of various qualitative and rule based defense mechanisms, the threat persists continuously because such mechanisms do not capture the incentive oriented attacker's intentions. Game theory promises to provide incentive based decision support system to defend against such attacks. The current work proposes a defense mechanism designed as two player zero sum finite horizon repeated game where decisions to allow or drop an incoming traffic at edge router are taken based on a flow-rate threshold. The flow-rate threshold is dynamically adjusted and updated based on maximum payoff obtained by the defender at a particular stage of the game. Payoff is computed by quantifying network conditions and parameters. The normal and attack traffic are modelled using normal and poisson distribution functions respectively. Using these functions, drop and pass probabilities of flows are computed. Further, costs and benefits in respect of the attacker and defender are computed based on the bandwidth utilized by the flows. Subsequently, payoff functions are designed for attacker and defender. Payoff functions are optimized to construct baseline optimal strategies. Nash Equilibrium is obtained using numerical computations which suggests an optimal flow-rate threshold to be set by the defender to secure the network against DDoS attacks round the clock.
An aggregate signature is a short digital signature which is the output of aggregation process. T... more An aggregate signature is a short digital signature which is the output of aggregation process. The signature aggregation is done on k signatures of k distinct messages from k distinct users. As the produced signature size is shorter, so it will be efficient to use the schemes in low-bandwidth communication environment. In this paper, we proposed two identity-based aggregate signature schemes from bilinear pairing operations. The proposed schemes are secure against existential forgery under adaptively chosen message and identity attack in the random oracle model based on the assumption of intractability of the computational Diffie-Hellman problem (CDHP). The efficiency analysis of the proposed identity-based aggregate signature schemes with other established identity-based aggregate signature schemes is also done in this paper.
There are mainly two drawbacks of identity-based cryptosystem. First one is that it suffers from ... more There are mainly two drawbacks of identity-based cryptosystem. First one is that it suffers from key escrow problem and the second one is that it uses a secure channel at the stage of private key issuance by the Private Key Generator (PKG). In this paper, we propose a key escrow-free identitybased signature scheme without using secure channel in the process of private key issuance stage. The bilinear pairing is used for the construction of the proposed scheme. The scheme is secure against adaptive chosen message attack and given ID attack under the assumption that the computation DiffieHellman problem is hard.
An Efficient Computation and Storage Outsourcing Process with Verification for Light Weight Devices
Learning and Analytics in Intelligent Systems
The volume of data are increasing continuously due to daily transactions, social networks, data a... more The volume of data are increasing continuously due to daily transactions, social networks, data automation etc. Managing of large amount data locally is a big challenge and therefore, the people are planned to outsource the data in to third-party server which decrease the cost of storage and local maintenance. Recently, researchers are working hard to securely outsource the data into the cloud server. There is increasing the computation cost when secure access control defined from the data owner site to the third-party server. It will be more effective for the light weight devices also when the computation outsourced through third-party server like data outsourcing in the cloud. In this paper, we proposed a novel process for computation outsourcing into the third party server. Here, we basically worked on a bilinear pairing which is costly computation operation, mostly used in recent security purpose and outsourced those pairing computation into the cloud.
In this paper, we present a new public key scheme which is a combination of RSA variant namely th... more In this paper, we present a new public key scheme which is a combination of RSA variant namely the Dependent-RSA (DRSA) and the general formulation of DGDLP. The security of this scheme depend equally on the integer factorization of n and the discrete logarithm on Zn, where n is a product of two large primes and Zn is the multiplicative group modulo n. The scheme is a randomized algorithm and it is at least as secure as the DRSA and ElGamal schemes.
An Efficient Key Escrow-Free Identity-based Short Signature Scheme from Bilinear Pairings
We propose an identity (ID)-based short signature scheme based on bilinear pairings and it is mor... more We propose an identity (ID)-based short signature scheme based on bilinear pairings and it is more efficient as compared to other identity-based schemes because it not only proposes a solution for the key escrow problem but also eliminates a secure channel requirement between the Private Key Generator (PKG) and the user. Moreover, the proposed ID-based Signature scheme also generates a short signature. The scheme is secure under the assumption that Computational Diffie-Hellman Problem is an intractable problem. Keywords—Identity-based cryptosystem, Key escrow, Private Key Generator, Short Signature, Computational Diffie-Hellman Problem
An aggregate signature is a short digital signature which is the output of aggregation process. T... more An aggregate signature is a short digital signature which is the output of aggregation process. The signature aggregation is done on k signatures of k distinct messages from k distinct users. As the produced signature size is shorter, so it will be efficient to use the schemes in low-bandwidth communication environment. In this paper, we proposed two identity-based aggregate signature schemes from bilinear pairing operations. The proposed schemes are secure against existential forgery under adaptively chosen message and identity attack in the random oracle model based on the assumption of intractability of the computational Diffie–Hellman problem (CDHP). The efficiency analysis of the proposed identity-based aggregate signature schemes with other established identity-based aggregate signature schemes is also done in this paper.
Advanced Image Encryption Scheme Using Snow Stream Cipher
Lecture Notes in Electrical Engineering, 2019
Image encryption has evolved significantly over the years. This paper proposes an image encryptio... more Image encryption has evolved significantly over the years. This paper proposes an image encryption system using Arnold’s cat map transformation and Snow stream cipher. In our proposed scheme, the image is first scrambled using Arnold’s transformation and then the selected scrambled image pixels are XORed with the Snow cipher keystream sequence to produce the cipher image. Performance of the proposed scheme is analyzed based on several statistical properties. We have observed encouraging statistical properties of the cipher image bitstream making our encryption scheme suitable for applications that requires secured transportation of images.
Study on Secrecy and Privacy Preserving Approaches over Cloud Data Outsourcing
Performing a smart usage of collection of services, applications and infrastructure composed of p... more Performing a smart usage of collection of services, applications and infrastructure composed of pool of computer resources, Cloud Computing has become promising hosting platform. Cloud architectures have cost-efficient and flexible backbones that support resource transmission, storage and computing of the applications. All these infrastructures are very useful for business, scientific and pervasive computing. The diversity of the services delivered by the cloud computing increases their vulnerability to security attacks. In order to improve the clients trust over the information and services in cloud computing environment, the assurance of security in the presence of semi-trusted and untrusted cloud provider is a critical issue. To address these issues, researchers have presented various secrecy and privacy preserving approaches. In this paper, we have surveyed recent various centralized and distributed secrecy and privacy preserving approaches for cloud computing environment.
Implementation of Automatic Variable Key with Chaos Theory and Studies Thereof
Automatic Variable Key (AVK) has been studied as a means of time variant key towards achieving pe... more Automatic Variable Key (AVK) has been studied as a means of time variant key towards achieving perfect security. This paper investigates the implementation of AVK with chaos theory with the existing cryptographic algorithms where it is not necessary to exchange the session key in sessions other than the first session. The initial key is generated using the concept of chaos theory and the key so generated is exchanged between the sender and the receiver by public key. Thereafter, the key of each of other sessions is made to change as a function of data of plaintext as in normal AVK. An experiment was performed to study the differential attack in normal cipher, cipher with normal AVK and cipher with AVK with chaos theory. The findings revealed that the differential attack was minimum in the case of cipher with AVK with chaos theory. The reduction of differential attack was due to the application of chaos theory in the initial key generation.
Chaos-based medical image encryption scheme using special nonlinear filtering function based LFSR
Multimedia Tools and Applications
In this paper, a new medical image encryption system is proposed using a special nonlinear filter... more In this paper, a new medical image encryption system is proposed using a special nonlinear filter function based linear feedback shift register (LFSR). This special nonlinear filter function based LFSR is used as a pseudo-random number generator (PRNG). In this generator, word-based effective operation has been applied to speed up the process of encryption and decryption. Firstly, the medical image is randomized by Logistic-Tent map and scrambled by Arnold transformation method. Next, the disordered image data is XORed with output sequences of specially designed PRNG to obtain cipher image. Our designed structure aims to provide high-level randomness in the cipher image content. Encryption decryption time requirements reveal the efficiency of the proposed system. Several performance measures are estimated to validate the resistance of the proposed scheme against statistical, differential, and a few common cryptanalytic attacks. The proposed encryption scheme compares favorably with several existing image encryption schemes.
In a democratic country, voting is one of the most important activ-ity. In many democracies over ... more In a democratic country, voting is one of the most important activ-ity. In many democracies over the years, there has been decrease in the number of voters coming for election because of the incon-venient voting system. An electronic voting scheme allows voters to vote securely from distance through internet by interacting with a set of authorities. However there is always a chance that an ad-versary can corrupt the users and jeopardize the voting system. In this paper, we have proposed an E-voting protocol that ensures the three most important requirements of E-voting system i.e privacy, verifiability and fairness even in case when some of the users are malicious.
Currently, short signature is receiving significant attention since it is particularly useful in ... more Currently, short signature is receiving significant attention since it is particularly useful in low-bandwidth communication environments. In this paper, a short signature scheme is proposed from weil pairing. The proposed scheme is efficient as lesser number of cost effective pairing operations involved. We analyze security and efficiency comparison of the proposed scheme with other short signature schemes.
Proceedings of the International Conference on Computing and Communication Systems
DDoS attacks deplete network bandwidth and render the services unavailable to normal users. In sp... more DDoS attacks deplete network bandwidth and render the services unavailable to normal users. In spite of various qualitative and rule based defense mechanisms, the threat persists continuously because such mechanisms do not capture the incentive oriented attacker's intentions. Game theory promises to provide incentive based decision support system to defend against such attacks. The current work proposes a defense mechanism designed as two player zero sum finite horizon repeated game where decisions to allow or drop an incoming traffic at edge router are taken based on a flow-rate threshold. The flow-rate threshold is dynamically adjusted and updated based on maximum payoff obtained by the defender at a particular stage of the game. Payoff is computed by quantifying network conditions and parameters. The normal and attack traffic are modelled using normal and poisson distribution functions respectively. Using these functions, drop and pass probabilities of flows are computed. Further, costs and benefits in respect of the attacker and defender are computed based on the bandwidth utilized by the flows. Subsequently, payoff functions are designed for attacker and defender. Payoff functions are optimized to construct baseline optimal strategies. Nash Equilibrium is obtained using numerical computations which suggests an optimal flow-rate threshold to be set by the defender to secure the network against DDoS attacks round the clock.
An aggregate signature is a short digital signature which is the output of aggregation process. T... more An aggregate signature is a short digital signature which is the output of aggregation process. The signature aggregation is done on k signatures of k distinct messages from k distinct users. As the produced signature size is shorter, so it will be efficient to use the schemes in low-bandwidth communication environment. In this paper, we proposed two identity-based aggregate signature schemes from bilinear pairing operations. The proposed schemes are secure against existential forgery under adaptively chosen message and identity attack in the random oracle model based on the assumption of intractability of the computational Diffie-Hellman problem (CDHP). The efficiency analysis of the proposed identity-based aggregate signature schemes with other established identity-based aggregate signature schemes is also done in this paper.
There are mainly two drawbacks of identity-based cryptosystem. First one is that it suffers from ... more There are mainly two drawbacks of identity-based cryptosystem. First one is that it suffers from key escrow problem and the second one is that it uses a secure channel at the stage of private key issuance by the Private Key Generator (PKG). In this paper, we propose a key escrow-free identitybased signature scheme without using secure channel in the process of private key issuance stage. The bilinear pairing is used for the construction of the proposed scheme. The scheme is secure against adaptive chosen message attack and given ID attack under the assumption that the computation DiffieHellman problem is hard.
An Efficient Computation and Storage Outsourcing Process with Verification for Light Weight Devices
Learning and Analytics in Intelligent Systems
The volume of data are increasing continuously due to daily transactions, social networks, data a... more The volume of data are increasing continuously due to daily transactions, social networks, data automation etc. Managing of large amount data locally is a big challenge and therefore, the people are planned to outsource the data in to third-party server which decrease the cost of storage and local maintenance. Recently, researchers are working hard to securely outsource the data into the cloud server. There is increasing the computation cost when secure access control defined from the data owner site to the third-party server. It will be more effective for the light weight devices also when the computation outsourced through third-party server like data outsourcing in the cloud. In this paper, we proposed a novel process for computation outsourcing into the third party server. Here, we basically worked on a bilinear pairing which is costly computation operation, mostly used in recent security purpose and outsourced those pairing computation into the cloud.
In this paper, we present a new public key scheme which is a combination of RSA variant namely th... more In this paper, we present a new public key scheme which is a combination of RSA variant namely the Dependent-RSA (DRSA) and the general formulation of DGDLP. The security of this scheme depend equally on the integer factorization of n and the discrete logarithm on Zn, where n is a product of two large primes and Zn is the multiplicative group modulo n. The scheme is a randomized algorithm and it is at least as secure as the DRSA and ElGamal schemes.
An Efficient Key Escrow-Free Identity-based Short Signature Scheme from Bilinear Pairings
We propose an identity (ID)-based short signature scheme based on bilinear pairings and it is mor... more We propose an identity (ID)-based short signature scheme based on bilinear pairings and it is more efficient as compared to other identity-based schemes because it not only proposes a solution for the key escrow problem but also eliminates a secure channel requirement between the Private Key Generator (PKG) and the user. Moreover, the proposed ID-based Signature scheme also generates a short signature. The scheme is secure under the assumption that Computational Diffie-Hellman Problem is an intractable problem. Keywords—Identity-based cryptosystem, Key escrow, Private Key Generator, Short Signature, Computational Diffie-Hellman Problem
An aggregate signature is a short digital signature which is the output of aggregation process. T... more An aggregate signature is a short digital signature which is the output of aggregation process. The signature aggregation is done on k signatures of k distinct messages from k distinct users. As the produced signature size is shorter, so it will be efficient to use the schemes in low-bandwidth communication environment. In this paper, we proposed two identity-based aggregate signature schemes from bilinear pairing operations. The proposed schemes are secure against existential forgery under adaptively chosen message and identity attack in the random oracle model based on the assumption of intractability of the computational Diffie–Hellman problem (CDHP). The efficiency analysis of the proposed identity-based aggregate signature schemes with other established identity-based aggregate signature schemes is also done in this paper.
Advanced Image Encryption Scheme Using Snow Stream Cipher
Lecture Notes in Electrical Engineering, 2019
Image encryption has evolved significantly over the years. This paper proposes an image encryptio... more Image encryption has evolved significantly over the years. This paper proposes an image encryption system using Arnold’s cat map transformation and Snow stream cipher. In our proposed scheme, the image is first scrambled using Arnold’s transformation and then the selected scrambled image pixels are XORed with the Snow cipher keystream sequence to produce the cipher image. Performance of the proposed scheme is analyzed based on several statistical properties. We have observed encouraging statistical properties of the cipher image bitstream making our encryption scheme suitable for applications that requires secured transportation of images.
Uploads
Papers by Bubu Bhuyan