{"title":"外包私有集交集使用同态加密","authors":"F. Kerschbaum","doi":"10.1145/2414456.2414506","DOIUrl":null,"url":null,"abstract":"Private set intersection enables two parties -- a client and a server -- to compute the intersection of their respective sets without disclosing anything else. It is a fundamental operation -- equivalent to a secure, distributed database join -- and has many applications particularly in privacy-preserving law enforcement. In this paper we present a novel protocol that has linear complexity, is secure in the malicious model without random oracles, is client set size-independent and efficient. Furthermore, the computation of the intersection can be outsourced to an oblivious service provider, as in secure cloud computing. We leverage a completely novel construction for computing the intersection using Bloom filter and homomorphic encryption. For outsourcing we require and introduce a new homomorphic encryption scheme which may be of independent interest.","PeriodicalId":72308,"journal":{"name":"Asia CCS '22 : proceedings of the 2022 ACM Asia Conference on Computer and Communications Security : May 30-June 3, 2022, Nagasaki, Japan. ACM Asia Conference on Computer and Communications Security (17th : 2022 : Nagasaki-shi, Japan ; ...","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"132","resultStr":"{\"title\":\"Outsourced private set intersection using homomorphic encryption\",\"authors\":\"F. Kerschbaum\",\"doi\":\"10.1145/2414456.2414506\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Private set intersection enables two parties -- a client and a server -- to compute the intersection of their respective sets without disclosing anything else. It is a fundamental operation -- equivalent to a secure, distributed database join -- and has many applications particularly in privacy-preserving law enforcement. In this paper we present a novel protocol that has linear complexity, is secure in the malicious model without random oracles, is client set size-independent and efficient. Furthermore, the computation of the intersection can be outsourced to an oblivious service provider, as in secure cloud computing. We leverage a completely novel construction for computing the intersection using Bloom filter and homomorphic encryption. For outsourcing we require and introduce a new homomorphic encryption scheme which may be of independent interest.\",\"PeriodicalId\":72308,\"journal\":{\"name\":\"Asia CCS '22 : proceedings of the 2022 ACM Asia Conference on Computer and Communications Security : May 30-June 3, 2022, Nagasaki, Japan. ACM Asia Conference on Computer and Communications Security (17th : 2022 : Nagasaki-shi, Japan ; ...\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"132\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asia CCS '22 : proceedings of the 2022 ACM Asia Conference on Computer and Communications Security : May 30-June 3, 2022, Nagasaki, Japan. ACM Asia Conference on Computer and Communications Security (17th : 2022 : Nagasaki-shi, Japan ; ...\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2414456.2414506\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asia CCS '22 : proceedings of the 2022 ACM Asia Conference on Computer and Communications Security : May 30-June 3, 2022, Nagasaki, Japan. ACM Asia Conference on Computer and Communications Security (17th : 2022 : Nagasaki-shi, Japan ; ...","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2414456.2414506","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Outsourced private set intersection using homomorphic encryption
Private set intersection enables two parties -- a client and a server -- to compute the intersection of their respective sets without disclosing anything else. It is a fundamental operation -- equivalent to a secure, distributed database join -- and has many applications particularly in privacy-preserving law enforcement. In this paper we present a novel protocol that has linear complexity, is secure in the malicious model without random oracles, is client set size-independent and efficient. Furthermore, the computation of the intersection can be outsourced to an oblivious service provider, as in secure cloud computing. We leverage a completely novel construction for computing the intersection using Bloom filter and homomorphic encryption. For outsourcing we require and introduce a new homomorphic encryption scheme which may be of independent interest.