使用正多边形牌的小洗牌复杂度的多方计算

{"title":"使用正多边形牌的小洗牌复杂度的多方计算","authors":"Kazumasa Shinagawa, T. Mizuki, Jacob C. N. Schuldt, K. Nuida, Naoki Kanayama, T. Nishide, Goichiro Hanaoka, E. Okamoto","doi":"10.1007/978-3-319-26059-4_7","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":215672,"journal":{"name":"Provable Security","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards\",\"authors\":\"Kazumasa Shinagawa, T. Mizuki, Jacob C. N. Schuldt, K. Nuida, Naoki Kanayama, T. Nishide, Goichiro Hanaoka, E. Okamoto\",\"doi\":\"10.1007/978-3-319-26059-4_7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":215672,\"journal\":{\"name\":\"Provable Security\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Provable Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-26059-4_7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Provable Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-26059-4_7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}