Asymptotically Tight Bounds on the Key Equivocation Rate for Additive-Like Instantaneous Block Encipherers

  • Zhaozhi Zhang


In [1] 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.


Broadcast Channel Tight Bound Secrecy System Secrecy Capacity Message Source 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Ahlswede and G. Dueck, “Bad codes are good ciphers”, Problems of Control and Information Theory 11, 1982, 337–351.MathSciNetzbMATHGoogle Scholar
  2. [2]
    I. Csiszár and J. Körner, “Broadcast channels with confidential messages”, IEEE Trans. Inform. Theory 24, 1978, 339–348.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    U. M. Maurer, “Secret key agreement by public discussion from common information”, IEEE Trans. Inform. Theory 39, 1993, 733–742.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Zhaozhi Zhang
    • 1
  1. 1.Institute of Systems ScienceAcademia SinicaBeijingChina

Personalised recommendations