Combinatorial Bounds and Design of Broadcast Authentication

Hiroshi FUJII; Wattanawong KACHEN; Kaoru KUROSAWA

Combinatorial Bounds and Design of Broadcast Authentication

Hiroshi FUJII, Wattanawong KACHEN, Kaoru KUROSAWA

Full Text Views

0

Share
Cite this

Summary :

This paper presents a combinatiorial characterization of broadcast authentication in which a transmitter broadcasts v messages e₁(s), ・・・, e_v(s) to authenticate a source state s to all n receivers so that any k receivers cannot cheat any other receivers, where e_i is a key. Suppose that each receiver has l keys. First, we prove that k < l if v < n. Then we show an upper bound of n such that n v(v - 1)/l(l - 1) for k = l - 1 and n /+ for k < l - 1. Further, a scheme for k = 1 - 1 which meets the upper bound is presented by using a BIBD and a scheme for k < l - 1 such than n = / is presented by using a Steiner system. Some other efficient schemes are also presented.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.4 pp.502-506

Publication Date: 1996/04/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

Category

Cite this

Copy

Hiroshi FUJII, Wattanawong KACHEN, Kaoru KUROSAWA, "Combinatorial Bounds and Design of Broadcast Authentication" in IEICE TRANSACTIONS on Fundamentals, vol. E79-A, no. 4, pp. 502-506, April 1996, doi: .
Abstract: This paper presents a combinatiorial characterization of broadcast authentication in which a transmitter broadcasts v messages e₁(s), ・・・, e_v(s) to authenticate a source state s to all n receivers so that any k receivers cannot cheat any other receivers, where e_i is a key. Suppose that each receiver has l keys. First, we prove that k < l if v < n. Then we show an upper bound of n such that n v(v - 1)/l(l - 1) for k = l - 1 and n /+ for k < l - 1. Further, a scheme for k = 1 - 1 which meets the upper bound is presented by using a BIBD and a scheme for k < l - 1 such than n = / is presented by using a Steiner system. Some other efficient schemes are also presented.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e79-a_4_502/_p

Copy

@ARTICLE{e79-a_4_502,
author={Hiroshi FUJII, Wattanawong KACHEN, Kaoru KUROSAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Combinatorial Bounds and Design of Broadcast Authentication},
year={1996},
volume={E79-A},
number={4},
pages={502-506},
abstract={This paper presents a combinatiorial characterization of broadcast authentication in which a transmitter broadcasts v messages e₁(s), ・・・, e_v(s) to authenticate a source state s to all n receivers so that any k receivers cannot cheat any other receivers, where e_i is a key. Suppose that each receiver has l keys. First, we prove that k < l if v < n. Then we show an upper bound of n such that n v(v - 1)/l(l - 1) for k = l - 1 and n /+ for k < l - 1. Further, a scheme for k = 1 - 1 which meets the upper bound is presented by using a BIBD and a scheme for k < l - 1 such than n = / is presented by using a Steiner system. Some other efficient schemes are also presented.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - Combinatorial Bounds and Design of Broadcast Authentication
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 502
EP - 506
AU - Hiroshi FUJII
AU - Wattanawong KACHEN
AU - Kaoru KUROSAWA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1996
AB - This paper presents a combinatiorial characterization of broadcast authentication in which a transmitter broadcasts v messages e₁(s), ・・・, e_v(s) to authenticate a source state s to all n receivers so that any k receivers cannot cheat any other receivers, where e_i is a key. Suppose that each receiver has l keys. First, we prove that k < l if v < n. Then we show an upper bound of n such that n v(v - 1)/l(l - 1) for k = l - 1 and n /+ for k < l - 1. Further, a scheme for k = 1 - 1 which meets the upper bound is presented by using a BIBD and a scheme for k < l - 1 such than n = / is presented by using a Steiner system. Some other efficient schemes are also presented.
ER -