Secured Cloud Data Migration Technique by Competent Probabilistic Public Key Encryption

Cloud computing, a recently emerged paradigm faces major challenges in achieving the privacy of migrated data, network security, etc. Too many cryptographic technologies are raised to solve these issues based on identity, attributes and prediction algorithms yet;these techniques are highly prone to attackers. This would raise a need of an effective encryption technique, which would ensure secure data migration. With this scenario, our proposed methodology Efficient Probabilistic Public Key Encryption(EPPKE) is optimized with Covariance Matrix Adaptation Evolution Strategies(CMA-ES). It ensures data integrity through the Luhn algorithm with BLAKE 2b encapsulation. This enables an optimized security to the data which is migrated through cloud. The proposed methodology is implemented in Open Stack with Java Language. It achieves better results by providing security compared to other existing techniques like RSA, IBA, ABE, PBE, etc.

Quantum Electronic Contract Scheme Based on Single Photon

An electronic contract is a contract signed by electronic means,which is widely used in electronic commerce activities.In recent years,with the rapid development of quantum cryptography technology,the quantum electronic contract has been widely studied by researchers.Supported by the basic principles of quantum mechanics,a quantum electronic contract scheme based on the single photon is proposed in this paper.In this scheme,two copies of the same contract are signed by both parties involved,and then a copy of each contract is sent to a trusted third party.The trusted third party verifies the signatures of both parties and compares the signed copies to determine whether the contract is valid.Compared with the previous scheme,this scheme is based on the quantum electronic contract signed by the single photon.Because the single photon is easy to prepare and operate,this scheme is simple and easy to implement.At the same time,the scheme does not need to exchange signatures between the two parties,which reduces the complexity of communication.Nevertheless,it requires both parties and the third party to be honest and trustworthy.

A Random Anonymity Framework for Location Privacy

Location k-anonymity techniques typically use anony- mous spatial region to ensure privacy. But these solutions are vul- nerable to multiple queries attacks and inference attacks. Failing to account for the obstacle in geographic space is a severe problem since adversaries will surely regard these constraints. A novel framework is proposed to enhance location-dependent queries, based on the theoretical work of k-anonymity and Voronoi diagrams, allows a user to express service requirement and privacy require- ment by specifying a region and an appropriate value ofk. A trusted anonymity server form a restricted set （k, r, s）, which is composed of a number of discrete points to meet the requirements for location k-anonymity and location /-diversity. The location-based services （LBS） server implements an efficient algorithm for continu- ous-region-query processing. Simulation results demonstrated that the framework is superior to previous works in terms of privacy. Moreover, discreteness and randomness of the anonymous set are conducive to resisting location tracking attacks.