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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlswede, R., Dueck, G.: Identification via channels. IEEE Trans. Inform. Theory 35(1), 15–29 (1989)
Ahlswede, R., Dueck, G.: Bad codes are good ciphers. Prob. Cont. Info. Theory 11, 337–351 (1982)
Han, T.S.: Information-Spectrum Methods in Information Theory. Springer, Berlin (2003)
Ahlswede, R., Zhang, Z.: New directions in the theory of identification via channels. IEEE Trans. Inform. Theory 41(1), 14–25 (1995)
Cai, N., Lam, K.Y.: On identification secret sharing schemes. Information and Computation 184, 298–310 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ahlswede, R., Cai, N., Zhang, Z. (2006). Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_15
Download citation
DOI: https://doi.org/10.1007/11889342_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46244-6
Online ISBN: 978-3-540-46245-3
eBook Packages: Computer ScienceComputer Science (R0)