Combinatorial Bounds and Design of Broadcast Authentication Export

@article{citeulike:4462931, abstract = {This paper presents a combinatorial characterization of broadcast authentication in which a transmitter broadcasts v messages e 1 (s); \Delta \Delta \Delta ; 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 \Gamma 1)=l(l \Gamma 1) for k = l \Gamma 1 and n ` v dl=ke \&\#039; = ` l dl=ke \&\#039; + ` v dl=ke \&\#039; for k ! l \Gamma 1. Further, a scheme for k = l \Gamma 1 which meets the upper bound is presented by using a BIBD and a scheme for k ! l \Gamma 1 such that n = ` v dl=ke \&\#039; = ` l dl=ke \&\#039; is presented by using a Steiner system. Some other efficient schemes are also presented. 1 Introduction @Encryption protects the transmitter and the receiver from eavesdropping of an opponent. Recently, Fiat and Naor [9] studied a broadcast encryption scheme in which a center...}, author = {Fujii, Hiroshi and Kachen, Wattanawong and Kurosawa, Kaoru and Member, Nonmember N. and Cryptology, Key W. and Design, Combinatorial}, citeulike-article-id = {4462931}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.3421}, journal = {in IEICE Trans}, keywords = {authentication, broadcast, security}, pages = {502--506}, posted-at = {2009-05-05 04:06:35}, priority = {2}, title = {Combinatorial Bounds and Design of Broadcast Authentication}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.3421}, volume = {79}, year = {1996} }

TY - JOUR ID - citeulike:4462931 L3 - citeulike-article-id:4462931 N2 - This paper presents a combinatorial characterization of broadcast authentication in which a transmitter broadcasts v messages e 1 (s); \Delta \Delta \Delta ; 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 \Gamma 1)=l(l \Gamma 1) for k = l \Gamma 1 and n ` v dl=ke ' = ` l dl=ke ' + ` v dl=ke ' for k ! l \Gamma 1. Further, a scheme for k = l \Gamma 1 which meets the upper bound is presented by using a BIBD and a scheme for k ! l \Gamma 1 such that n = ` v dl=ke ' = ` l dl=ke ' is presented by using a Steiner system. Some other efficient schemes are also presented. 1 Introduction @Encryption protects the transmitter and the receiver from eavesdropping of an opponent. Recently, Fiat and Naor [9] studied a broadcast encryption scheme in which a center... JF - in IEICE Trans EP - 506 TI - Combinatorial Bounds and Design of Broadcast Authentication VL - 79 SP - 502 KW - authentication KW - broadcast KW - security AU - Fujii, Hiroshi AU - Kachen, Wattanawong AU - Kurosawa, Kaoru AU - Member, Nonmember AU - Cryptology, Key AU - Design, Combinatorial PY - 1996/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.3421 ER -