Chunsheng Gu, Zhimin Yu, Zhengjun Jing, Peizhong Shi, Jin Qian
{"title":"GGH多线性图的改进","authors":"Chunsheng Gu, Zhimin Yu, Zhengjun Jing, Peizhong Shi, Jin Qian","doi":"10.1109/3PGCIC.2015.19","DOIUrl":null,"url":null,"abstract":"Garg, Gentry and Halevi (GGH) described the first candidate multilinear maps using ideal lattices. However, Hu and Jia presented an efficient attack on the GGH map, which breaks GGH-based MPKE. We describe an improvement of GGH map. The security of our construction depends upon new hardness assumption.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Improvement of GGH Multilinear Map\",\"authors\":\"Chunsheng Gu, Zhimin Yu, Zhengjun Jing, Peizhong Shi, Jin Qian\",\"doi\":\"10.1109/3PGCIC.2015.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Garg, Gentry and Halevi (GGH) described the first candidate multilinear maps using ideal lattices. However, Hu and Jia presented an efficient attack on the GGH map, which breaks GGH-based MPKE. We describe an improvement of GGH map. The security of our construction depends upon new hardness assumption.\",\"PeriodicalId\":395401,\"journal\":{\"name\":\"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/3PGCIC.2015.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3PGCIC.2015.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Garg, Gentry and Halevi (GGH) described the first candidate multilinear maps using ideal lattices. However, Hu and Jia presented an efficient attack on the GGH map, which breaks GGH-based MPKE. We describe an improvement of GGH map. The security of our construction depends upon new hardness assumption.