Abstract
The first multi-user model of communication subject to secrecy constraints was Wyner’s (1975, Bell Syst Techn J 54:1355–1387) “wiretap channel”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
R. Ahlswede, Elimination of correlation in random codes for arbitrarily varying channels. Zeitschrift Wahrscheinlichkeitstheorie und verw. Geb. 33, 159–175 (1978)
R. Ahlswede, I. Csiszár, Common randomness in information theory and cryptography, Part I: Secret sharing. IEEE Trans. Inf. Theory 39, 1121–1132 (1993)
R. Ahlswede, G. Dueck, Identification via channels. IEEE Trans. Inf. Theory 35, 15–29 (1989)
R. Ahlswede, G. Dueck, Identification in the presence of feedback – a discovery of new capacity formulas. IEEE Trans. Inf. Theory 35, 30–39 (1989)
I. Csiszár, J. Körner, Broadcast channels with confidential messages. IEEE Trans. Inf. Theory 24, 339–348 (1978)
I. Csiszár, J. K”orner, Information Theory: Coding Theorem for Discrete Memoryless Systems (Academic, New York, 1982)
I. Csiszár, P. Narayan, The capacity of the arbitrarily varying channel revisited: positivity, constraints. IEEE Trans. Inf. Theory 34, 181–193 (1988)
W. Diffie, M.E. Hellman, New directions in cryptography. IEEE Trans. Inf. Theory IT–22, 644–654 (1976)
U.M. Maurer, Provably–secure key distribution based on independent channels. Presented at the 1990 IEEE Workshop on Information Theory, Eindhoven, 10–15 June
U.M. Maurer, Perfect cryptographic security from partially independent channels, in Proceedings of 23rd ACM Symposium on the Theory of Computing, New Orleans (1991), pp. 561–572
U.M. Maurer, Secret key agreement by public discussion based on common information. IEEE Trans. Inf. Theory 39(3), 733–742, (1993)
R.L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public–key cryptosystems. Commun. ACM 21, 120–126 (1978)
A.D. Wyner, The wire–tap channel. Bell Syst. Techn. J. 54, 1355–1387 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Ahlswede, R. (2021). The Role of Common Randomness in Information Theory and Cryptography: Secrecy Constraints. In: Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. (eds) Identification and Other Probabilistic Models. Foundations in Signal Processing, Communications and Networking, vol 16. Springer, Cham. https://doi.org/10.1007/978-3-030-65072-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-65072-8_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-65070-4
Online ISBN: 978-3-030-65072-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)