{"title":"一种防止用户与中心合谋的密钥预分配系统斜坡方案","authors":"Takahiro Yoshida, T. Matsushima, H. Imai","doi":"10.1109/ISITA.2008.4895469","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a ramp scheme for Key Predistribution System (KPS). In the ramp scheme, it can be regarded as one kind of generalization of KPS, and the required resources can be reduced at the cost of a security degradation which depends on the size of users. We define a ramp scheme for KPS, show lower bound on the amount of user' s information needed to generate a common key, and design a protocol that realize a ramp scheme for KPS.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A ramp scheme for Key Predistribution System against collusion of users and centers\",\"authors\":\"Takahiro Yoshida, T. Matsushima, H. Imai\",\"doi\":\"10.1109/ISITA.2008.4895469\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider a ramp scheme for Key Predistribution System (KPS). In the ramp scheme, it can be regarded as one kind of generalization of KPS, and the required resources can be reduced at the cost of a security degradation which depends on the size of users. We define a ramp scheme for KPS, show lower bound on the amount of user' s information needed to generate a common key, and design a protocol that realize a ramp scheme for KPS.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895469\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A ramp scheme for Key Predistribution System against collusion of users and centers
In this paper, we consider a ramp scheme for Key Predistribution System (KPS). In the ramp scheme, it can be regarded as one kind of generalization of KPS, and the required resources can be reduced at the cost of a security degradation which depends on the size of users. We define a ramp scheme for KPS, show lower bound on the amount of user' s information needed to generate a common key, and design a protocol that realize a ramp scheme for KPS.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
