A BGN-Type Multiuser Homomorphic Encryption Scheme
暂无分享,去创建一个
Homomorphic encryption(HE) is a new cryptographic primitive that can operate on ciphertext without decryption. It has significant application in cloud computing. However, most of the existing HE schemes are single user, which means they could only evaluate on ciphertext encrypted by a single public key. Combining the idea of proxy re-encryption and homomorphic encryption, we provide a BGN-type multi-user HEscheme that can evaluate on ciphertexts come from different users. The scheme is based on bilinear pairing and subgroup decision problem, and is a somewhat homomorphic scheme that can do one multiplication and infinite additions. Security of the scheme is based on the subgroup decision assumption.
[1] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[2] Vinod Vaikuntanathan,et al. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption , 2012, STOC '12.
[3] Dan Boneh,et al. Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.
[4] Xinwen Zhang,et al. Multiparty Cloud Computation , 2012, ArXiv.
[5] Michael Clear,et al. Multi-identity and Multi-key Leveled FHE from Learning with Errors , 2015, CRYPTO.