- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | Lower bounds on the memory size of entities for a ramp key distribution scheme and an optimal construction (in Japanese) |
|---|---|
| Authors | Takahiro YOSHIDA 、Hajime JINUSHI 、Toshiyasu MATSUSHIMA |
| Released Year | 2010 |
| Format | Conference |
| Category | Information security |
| Jounal Name | IEICE Technical Report |
| Jounal Page | vol.110, no.363, IT2010-57, pp.19-24 |
| Published Year | 2011 |
| Published Month | 1 |
| Abstract （English） |
The security notion of conventional ramp key distribution scheme (KDS) is that fraudulent centers and users can get partial information on any key that leak in stages according to the number of fraudulent users. In this paper, we define a new ramp KDS, show lower bounds on the memory size of entities for a new ramp KDS, and describe the concrete construction that meets corresponding lower bounds. The security notion of a new ramp KDS is that fraudulent centers and users can get partial information on any key that leak in stages according to the number of fraudulent centers and users. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
