摘要：The public key of the integer homomorphic encryption scheme which was proposed by Van Dijk et al . is long, so the scheme is almost impossible to use in practice. By studying the scheme and Coron’s public key compression technique, a scheme which is able to encrypt n bits plaintext once was obtained. The scheme improved the efficiency of the decrypting party and increased the number of encrypting parties, so it meets the needs of cloud computing better. The security of the scheme is based on the approximate GCD problem and the sparse-subset sum problem.
关键词：Fully Homomorphic Encryption;Multipart to One Fully Homomorphism Encryption;Approximate GCD Problem;Sparse-Subset Sum Problem
Loading...
