D:\sbornik\...\paper.DVI


Mathematical Problems of Computer Science 37, 39{44, 2012.

Spher e P acking B ound for E-capacity of Secr ecy

Leakage of the B r oadcast Channel With Con¯dential

M essages

N a s r in A fs h a r

Institute for Informatics and Automation Problems of NAS of RA

Abstract

The discrete memoryless broadcast channel with con¯dential messages (BCC) in-
volves two discrete memoryless channels with two sources and one encoder. A common
message must be transmitted to two receivers and a private message to the intended
receiver, while keeping the other receiver as ignorant of it as possible. Secrecy leakage
rate is the rate of information available to the unintended receiver about the private
message. Upper bound for E-capacity of secrecy leakage of the BCC is derived.

Key words: Broadcast channel with con¯dential messages, E-capacity, error prob-
ability exponent, method of types, secrecy leakage rate, sphere packing bound.

Refer ences

[1 ] I. Cs is z ¶a r a n d J. K Äo r n e r , \ B r o a d c a s t c h a n n e l wit h c o n ¯ d e n t ia l m e s s a g e s " , IE E E Trans.
Inform. Theory, vo l. IT-2 4 , n o . 3 , p p . 3 3 9 -3 4 8 , 1 9 7 8 .

[2 ] E . A . H a r o u t u n ia n , \ U p p e r e s t im a t e o f t r a n s m is s io n r a t e fo r m e m o r yle s s c h a n n e l wit h
c o u n t a b le n u m b e r o f o u t p u t s ig n a ls u n d e r g ive n e r r o r p r o b a b ilit y e xp o n e n t " , ( in R u s -
s ia n ) 3rd All Union Conference on Theory of Information Transmission and Coding,
Uzhgorod, P ublishing House of the Uzbek Academy of Sciences, p p . 8 3 -8 6 , 1 9 6 7 .

[3 ] E . A . H a r o u t u n ia n , B . B e lb a s h ir , \ L o we r b o u n d o f t h e o p t im a l t r a n s m is s io n r a t e d e -
p e n d in g o n g ive n e r r o r p r o b a b ilit y e xp o n e n t fo r d is c r e t e m e m o r yle s s c h a n n e l a n d fo r
a s ym m e t r ic b r o a d c a s t c h a n n e l" , ( in R u s s ia n ) , Abstracts of P apers of 6th Int. Symp.
Inform. Theory, Tashkent, USSR , vo l. 1 , p p . 1 9 -2 1 , 1 9 8 4 .

[4 ] E . A . H a r o u t u n ia n , \ On B o u n d s fo r E -Ca p a c it y o f D MC" , IE E E Trans. Inform. Theory,
vo l. IT-5 3 , n o . 1 1 , p p . 4 2 1 0 -4 2 2 0 , 2 0 0 7 .

[5 ] E . A . H a r o u t u n ia n , M. E . H a r o u t u n ia n a n d A . N . H a r u t yu n ya n , \ R e lia b ilit y c r it e r ia
in in fo r m a t io n t h e o r y a n d in s t a t is t ic a l h yp o t h e s is t e s t in g " , F oundations and Trends in
Communications and Information Theory, vo l. 4 , n o s . 2 -3 , 2 0 0 8 .

[6 ] E . A . H a r o u t u n ia n , M. E . H a r o u t u n ia n a n d N . A fs h a r , \ R a n d o m c o d in g b o u n d fo r
E-c a p a c it y r e g io n o f t h e wir e t a p c h a n n e l" , 8th International Conference of Computer
Science and Information Technologies, Y e r e va n , p p . 1 2 1 -1 2 4 , 2 0 1 1 .

3 9



4 0 Sphere Packing Bound for E-capacity of Secrecy Leakage of the Broadcast Channel With Con¯dential Messages

¶³ÕïÝÇ Ñ³Õáñ¹³·ñáõÃÛáõÝÝ»ñáí ɳÛݳë÷Ûáõé ϳåáõÕáõ ·³ÕïÝÇùÇ
Ñáë³ÏáñáõëïÇ ³ñ³·áõÃÛ³Ý ·Ý¹»ñÇ ÷³Ã»Ã³íáñÙ³Ý ·Ý³Ñ³ï³Ï³ÝÁ

Ü. ²íß³ñ

²Ù÷á÷áõÙ

¶³ÕïÝÇ Ñ³Õáñ¹³·ñáõÃÛáõÝÝÑñáí ɳÛݳë÷Ûáõé ϳåáõÕáõ ÁݹѳÝáõñ ѳÕáñ¹³·ñáõ-
ÃÛáõÝÁ ÷á˳ÝóíáõÙ ¿ »ñÏáõ ѳëó»³ï»ñ»ñÇÝ, ÇëÏ Ù³ëݳíáñ ѳÕáñ¹³·ñáõÃÛáõÝÁª ÙdzÛÝ
Ù»ÏÇÝ. ³ÛÝ å»ïù ¿ Ñݳñ³íáñÇÝë ·³ÕïÝÇ ÉÇÝÇ ÙÛáõëÇ Ýϳïٳٵ: γéáõóí»É ¿ ·³Õï-
ÝÇùÇ Ñáë³ÏáñëïÇ ³ñ³·áõÃÛ³Ý E-áõݳÏáõÃÛ³Ý í»ñÇÝ ·Ý³Ñ³ï³Ï³ÝÁ:

Ãðàíèöà ñôåðè÷åñêîé óïàêîâêè ñêîðîñòè óòå÷êè ñåêðåòà
â øèðîêîâåùàòåëüíîì êàíàëå ñ ñåêðåòíûìè ñîîáùåíèÿìè

Í.Àôøàð

Àííîòàöèÿ

Îáùåå ñîîáøåíèå øèðîêîâåùàòåëüíîãî êàíàëà ñ ñåêðåòíûìè ñîîáùåíèÿìè,
ïåðåäàåòñÿ äâóì àäðåñàòàì, à ÷àñòíîå ñîîáùåíèå òîëüêî îäíîìó èç íèõ è äîëæíî
áûòü íàñêîëüêî âîçìîæíî ñåêðåòíûì äëÿ âòîðîãî. Ïîñòðîåíà âåðõíÿÿ ãðàíèöà
E-ïðîïóñêíîé ñïîñîáíîñòè ñêîðîñòè óòå÷êè ñåêðåòà.