{"title":"A BGN-Type Multiuser Homomorphic Encryption Scheme","authors":"Zhang Wei","doi":"10.1109/INCOS.2015.45","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCOS.2015.45","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
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.