最短路径差分私有范围查询

{"title":"最短路径差分私有范围查询","authors":"Chengyuan Deng, Jie Ying Gao, Jalaj Upadhyay, Chen Wang","doi":"10.1007/978-3-031-38906-1_23","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":380945,"journal":{"name":"Workshop on Algorithms and Data Structures","volume":"129 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Differentially Private Range Query on Shortest Paths\",\"authors\":\"Chengyuan Deng, Jie Ying Gao, Jalaj Upadhyay, Chen Wang\",\"doi\":\"10.1007/978-3-031-38906-1_23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":380945,\"journal\":{\"name\":\"Workshop on Algorithms and Data Structures\",\"volume\":\"129 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Algorithms and Data Structures\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-031-38906-1_23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Algorithms and Data Structures","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-031-38906-1_23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}