Presentation | 1998/3/18 Characterization of(k, n)Multi-Receiver Authenticaion Kaoru KUROSAWA, Satoshi OBANA, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | In the model of(k, n)multi-receiver authenticaion codes there are n receivers. An opponent and any k-1 receivers cannot cheat any other receiver. Here we show tight lower bounds on the size of messages and the size of keys for given cheating probabilities. We also show a necessary and sufficient condition for the optimum scheme, which is given by a combinatorial characterization between the transmitter's keys and the keys of each receiver. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Authentication Code / Multi-Receiver / Block Design |
Paper # | |
Date of Issue |
Conference Information | |
Committee | ISEC |
---|---|
Conference Date | 1998/3/18(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Information Security (ISEC) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Characterization of(k, n)Multi-Receiver Authenticaion |
Sub Title (in English) | |
Keyword(1) | Authentication Code |
Keyword(2) | Multi-Receiver |
Keyword(3) | Block Design |
1st Author's Name | Kaoru KUROSAWA |
1st Author's Affiliation | Department of Electrical and Electronic Engineering Tokyo Institute of Technology() |
2nd Author's Name | Satoshi OBANA |
2nd Author's Affiliation | Department of Electrical and Electronic Engineering Tokyo Institute of Technology |
Date | 1998/3/18 |
Paper # | |
Volume (vol) | vol.97 |
Number (no) | 611 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |