Lossless Data Hiding in LWE-Encrypted Domains Based on Key-Switching

This paper proposes a lossless data hiding scheme in learning with errors (LWE)-encrypted domain based on key-switching technique. Lossless data hiding and extraction could be realized by a third party without knowing the private key for decryption. Key-switching-based least-significant-bit (KSLSB) data hiding method has been designed during the lossless data hiding process. The owner of the plaintext first encrypts the plaintext by using LWE encryption and uploads ciphertext to a (trusted or untrusted) third server. Then the server performs KSLSB to obtain a marked ciphertext. To enable the third party to manage ciphertext flexibly and keep the plaintext secret, the embedded data can be extracted from the marked ciphertext without using the private key of LWE encryption in the proposed scheme. Experimental results demonstrate that data hiding would not compromise the security of LWE encryption, and the embedding rate is 1 bit per bit of plaintext without introducing any loss into the directly decrypted result.

A Lattice-Based Homomorphic Proxy Re-Encryption Scheme with Strong Anti-Collusion for Cloud Computing

The homomorphic proxy re-encryption scheme combines the characteristics of a homomorphic encryption scheme and proxy re-encryption scheme. The proxy can not only convert a ciphertext of the delegator into a ciphertext of the delegatee, but also can homomorphically calculate the original ciphertext and re-encryption ciphertext belonging to the same user, so it is especially suitable for cloud computing. Yin et al. put forward the concept of a strong collusion attack on a proxy re-encryption scheme, and carried out a strong collusion attack on the scheme through an example. The existing homomorphic proxy re-encryption schemes use key switching algorithms to generate re-encryption keys, so it can not resist strong collusion attack. In this paper, we construct the first lattice-based homomorphic proxy re-encryption scheme with strong anti-collusion (HPRE-SAC). Firstly, algorithm TrapGen is used to generate an encryption key and trapdoor, then trapdoor sampling is used to generate a decryption key and re-encryption key, respectively. Finally, in order to ensure the homomorphism of ciphertext, a key switching algorithm is only used to generate the evaluation key. Compared with the existing homomorphic proxy re-encryption schemes, our HPRE-SAC scheme not only can resist strong collusion attacks, but also has smaller parameters.

Flattening NTRU for Evaluation Key Free Homomorphic Encryption

We propose a new FHE scheme F-NTRU that adopts the flattening technique proposed in GSW to derive an NTRU based scheme that (similar to GSW) does not require evaluation keys or key switching. Our scheme eliminates the decision small polynomial ratio assumption but relies only on the standard R-LWE assumption. It uses wide key distributions, and hence is immune to Subfield Lattice Attack. In practice, our scheme achieves competitive timings compared to the existing schemes. We are able to compute a homomorphic multiplication in 24.4 msec and 76.0 msec for 5 and 30 levels, respectively, without amortization. Furthermore, our scheme features small ciphertexts, e.g. 2376 KB for 30 levels. The assurance gained by using wide key distributions along with the message space flexibility of the scheme, i.e. bits, binary polynomials, and integers with a large message space, allows the use of the proposed scheme in a wide array of applications.

Dynamic Key Switching Integrated Scenarios for Performance Aware Implementations in Cloud and Integrated Internet of Things

With the adoption and wide usage of smart gadgets and devices for multiple applications, the association of advanced technologies is quite prominence and needs higher degree of accuracy and performance. These are legitimately connected with the advanced innovations including Internet of Things, Internet of Everything, Internet of Vehicles, Internet of Cloud Apps and numerous others. This original copy is therefore displaying the enormous issues and research focuses in this area with the associated streams so the different elements of IoT, IoE, IoX, IoV and others can be broke down with the examination openings and the portions for various streams. In the present situation, the IoT based coordination of digital forms of money is very unmistakable whereby the distributed system is pursued and it goes under the innovation of blockchain. The blockchain innovation is likewise connected with the shrewd advances. In the present period, Blockchain Technology is one of the key territories of research just as execution explicitly in the space of cryptocurrency. Presently days, various computerized cryptographic forms of money are very conspicuous and shared all through the world in spite of tremendous analysis and discussions. Other than these purposes of research, the vehicular mix of IoT is very conspicuous that is tended to utilizing IoV that is Internet of Vehicles in the keen traffic observing and brilliant transportation. Presently days, the IoT is moving towards IoE or IoX which alludes to Internet of Everything and this is additionally tended to in this composition. The manuscript is presenting the scenarios for the implementation patterns associated with the security and dynamic key based environment.