Biblio

Fully homomorphic encryption (FHE) provides effective security assurance for privacy computing in cloud environments. But the existing FHE schemes are generally faced with challenges including using single-bit encryption and large ciphertext noise, which greatly affects the encryption efficiency and practicability. In this paper, a low-noise FHE scheme supporting multi-bit encryption is proposed based on the HAO scheme. The new scheme redesigns the encryption method without changing the system parameters and expands the plaintext space to support the encryption of integer matrices. In the process of noise reduction, we introduce a PNR method and use the subGaussian distribution theory to analyze the ciphertext noise. The security and the efficiency analysis show that the improved scheme can resist the chosen plaintext attack and effectively reduce the noise expansion rate. Comparative experiments show that the scheme has high encryption efficiency and is suitable for the privacy-preserving computation of integer matrices.

Securing multi-party communication is very challenging particularly in dynamic networks. Existing multi-recipient cryptographic schemes pose variety of limitations. These include: requiring trust among all recipients to make an agreement, high computational cost for both encryption and decryption, and additional communication overhead when group membership changes. To overcome these limitations, this paper introduces a novel multi-recipient asymmetric cryptographic scheme, AMOUN. This scheme enables the sender to possibly send different messages in one ciphertext to multiple recipients to better utilize network resources, while ensuring that each recipient only retrieves its own designated message. Security analysis demonstrates that proposed scheme is secure against well-known attacks. Evaluation results demonstrate that lightweight AMOUN outperforms RSA and Multi-RSA in terms of computational cost for both encryption and decryption. For a given prime size, in case of encryption, AMOUN achieves 86% and 98% lower average computational cost than RSA and Multi-RSA, respectively; while for decryption, it shows performance improvement of 98% compared to RSA and Multi-RSA.

The paper presents a cryptanalysis of an enhanced sub-image encryption method recently proposed by Wang et al. in Optics and Lasers in Engineering 86(2016). Their paper shows that a parallel sub-image encryption method proposed by Mirzaei et al. in Nonlinear Dyn. 67(2012) could be attacked by chosen plaintext attack and proposed an enhanced sub-image encryption method claimed to completely resist the chosen plaintext attack. However, the enhanced sub-image encryption method also has some weakness, such as the key streams are independent with the plain-image. In this paper, one chosen plaintext attack type of cryptanalysis is presented for the enhanced sub-image encryption method and completely broken the enhanced sub-image encryption method. The experimental results indicate that the enhanced sub-image encryption method is weak against chosen plaintext attack and should be improved for practical application.