Advertisement

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer

  • R. Ahlswede
  • N. Cai
  • Z. Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4123)

Abstract

In this paper we propose a model of secrecy systems for identification via channels with ALIB encipherers and find the smallest asymptotic key rate of the ALIB encipherers needed for the requirement of security.

Keywords

Security Condition Channel Output Secret Sharing Scheme Uniform Random Number Transmission Matrix 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahlswede, R., Dueck, G.: Identification via channels. IEEE Trans. Inform. Theory 35(1), 15–29 (1989)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Ahlswede, R., Dueck, G.: Bad codes are good ciphers. Prob. Cont. Info. Theory 11, 337–351 (1982)MATHMathSciNetGoogle Scholar
  3. 3.
    Han, T.S.: Information-Spectrum Methods in Information Theory. Springer, Berlin (2003)MATHGoogle Scholar
  4. 4.
    Ahlswede, R., Zhang, Z.: New directions in the theory of identification via channels. IEEE Trans. Inform. Theory 41(1), 14–25 (1995)MATHCrossRefGoogle Scholar
  5. 5.
    Cai, N., Lam, K.Y.: On identification secret sharing schemes. Information and Computation 184, 298–310 (2003)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • R. Ahlswede
    • 1
  • N. Cai
    • 1
  • Z. Zhang
    • 2
  1. 1.Fakultät für MathematikUniversität BielefeldBielefeldGermany
  2. 2. 

Personalised recommendations