{"title":"多关键字搜索下公钥加密私集交集","authors":"Zhiyi Shao, Bo Yang, Yong Yu","doi":"10.1109/INCoS.2013.60","DOIUrl":null,"url":null,"abstract":"We introduce the technique of searchable encryption into the problem of secure two-party computation, and obtain a novel approach to accomplish Private Set Intersection (PSI), which uses the Public Key Encryption with Multiple Keywords Search (MPEKS) as the basic tool. We aim to achieve PSI in computationally asymmetric settings which can be instantiated by Cloud Computing. Our protocol satisfies the privacy with respect to semi-honest behaviors and the client only needs to compute m multiplications, m MapToPoint operations and one modular exponentiation to obtain the intersection, where m denotes the cardinality of the client's set.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"437 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Private Set Intersection via Public Key Encryption with Multiple Keywords Search\",\"authors\":\"Zhiyi Shao, Bo Yang, Yong Yu\",\"doi\":\"10.1109/INCoS.2013.60\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce the technique of searchable encryption into the problem of secure two-party computation, and obtain a novel approach to accomplish Private Set Intersection (PSI), which uses the Public Key Encryption with Multiple Keywords Search (MPEKS) as the basic tool. We aim to achieve PSI in computationally asymmetric settings which can be instantiated by Cloud Computing. Our protocol satisfies the privacy with respect to semi-honest behaviors and the client only needs to compute m multiplications, m MapToPoint operations and one modular exponentiation to obtain the intersection, where m denotes the cardinality of the client's set.\",\"PeriodicalId\":353706,\"journal\":{\"name\":\"2013 5th International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":\"437 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INCoS.2013.60\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2013.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Private Set Intersection via Public Key Encryption with Multiple Keywords Search
We introduce the technique of searchable encryption into the problem of secure two-party computation, and obtain a novel approach to accomplish Private Set Intersection (PSI), which uses the Public Key Encryption with Multiple Keywords Search (MPEKS) as the basic tool. We aim to achieve PSI in computationally asymmetric settings which can be instantiated by Cloud Computing. Our protocol satisfies the privacy with respect to semi-honest behaviors and the client only needs to compute m multiplications, m MapToPoint operations and one modular exponentiation to obtain the intersection, where m denotes the cardinality of the client's set.