Asymptotically Tight Bounds on the Key Equivocation Rate for Additive-Like Instantaneous Block Encipherers
In  R. Ahlswede and G. Dueck investigate secrecy systems with additive—like instantaneous block (ALIB) encipherers subject to the error probability criterion. They give asymptotically tight bounds on the probability of correct decryption for ALIB encipherers. But there are many criteria for secrecy systems. The important one is the key equivocation criterion. In this paper, we give asymptotically tight bounds on the key equivocation rate for ALIB encipherers.
KeywordsBroadcast Channel Tight Bound Secrecy System Secrecy Capacity Message Source
Unable to display preview. Download preview PDF.