The DOI matches its Crossref record; 91 of the 91 references it cites were found in a registry or an index.
Information Theoretic Security
Abstract
Security is one of the most important issues in communications. Security issues arising in communication networks include confidentiality, integrity, authentication and non-repudiation. Attacks on the security of communication networks can be divided into two basic types: passive attacks and active attacks. An active attack corresponds to the situation in which a malicious actor intentionally disrupts the system. A passive attack corresponds to the situation in which a malicious actor attempts to interpret source information without injecting any information or trying to modify the information; i.e., passive attackers listen to the transmission without modifying it. Information Theoretic Security focuses on confidentiality issues, in which passive attacks are of primary concern. The information theoretic approach to achieving secure communication opens a promising new direction toward solving wireless networking security problems. Compared to contemporary cryptosystems, information theoretic approaches offer advantages such as eliminating the key management issue; are less vulnerable to the man-in-the-middle and achieve provable security that is robust to powerful eavesdroppers possessing unlimited computational resources, knowledge of the communication strategy employed including coding and decoding algorithms, and access to communication systems either through perfect or noisy channels. Information Theoretic Security surveys the research dating back to the 1970s which forms the basis of applying this technique in modern systems. It proceeds to provide an overview of how information theoretic approaches are developed to achieve secrecy for a basic wire-tap channel model as well as for its extensions to multiuser networks. It is an invaluable resource for students and researchers working in network security, information theory and communications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
Wyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Cryptography and Network Security: Principles and Practice
Stallings, W. (1998) · Cited by 4,392
Capacity theorems for the relay channel
Cover, T., & Gamal, A. E. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056084 · Cited by 4,123
Noiseless coding of correlated information sources
Slepian, D., & Wolf, J. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055037 · Cited by 3,952
Writing on dirty paper (Corresp.)
Costa, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056659 · Cited by 3,735
A key-management scheme for distributed sensor networks
Eschenauer, L., & Gligor, V. D. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586117 · Cited by 3,541
Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.807285 · Cited by 3,378
Broadcast channels with confidential messages
Csiszar, I., & Korner, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055892 · Cited by 3,332
Tassiulas, L., & Ephremides, A. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.182479 · Cited by 2,834
Random key predistribution schemes for sensor networks
Chan, H., Perrig, A., & Song, D. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199337 · Cited by 2,826
A Random Linear Network Coding Approach to Multicast
Ho, T., Medard, M., Koetter, R., Karger, D. R., Effros, M., Shi, J., & Leong, B. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881746 · Cited by 2,553
An algebraic approach to network coding
Koetter, R., & Medard, M. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818197 · Cited by 2,356
Capacity of fading channels with channel side information
Goldsmith, A. J., & Varaiya, P. P. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.641562 · Cited by 2,018
Leung-Yan-Cheong, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055917 · Cited by 2,004
Wireless Information-Theoretic Security
Bloch, M., Barros, J., Rodrigues, M. R. D., & McLaughlin, S. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921908 · Cited by 1,847
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
Weingarten, H., Steinberg, Y., & Shamai, S. S. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.880064 · Cited by 1,709
Three-terminal communication channels
van der Meulen, E. C. (1971) · Advances in Applied Probability · doi:10.1017/s0001867800037605 · Cited by 1,544
Establishing pairwise keys in distributed sensor networks
Liu, D., & Ning, P. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948119 · Cited by 1,354
Common randomness in information theory and cryptography. I. Secret sharing
Ahlswede, R., & Csiszar, I. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.243431 · Cited by 1,325
On the Secrecy Capacity of Fading Channels
Gopala, P. K., Lai, L., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928990 · Cited by 1,261
Efficient encoding of low-density parity-check codes
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910579 · Cited by 1,028
Cramer, R., & Shoup, V. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403773 · Cited by 978
Secure Communication Over Fading Channels
Liang, Y., Poor, H. V., & Shamai, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921678 · Cited by 937
Self-citationCODING FOR CHANNEL WITH RANDOM PARAMETERS
Gel'fand, S. I., & Pinsker, M. S. (1980) · Cited by 890
Nested linear/lattice codes for structured multiterminal binning
Zamir, R., Shamai, S., & Erez, U. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003821 · Cited by 876
Tekin, E., & Yener, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921680 · Cited by 841
The Relay–Eavesdropper Channel: Cooperation for Secrecy
Lai, L., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928272 · Cited by 774
Optimum power control over fading channels
Caire, G., Taricco, G., & Biglieri, E. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771147 · Cited by 755
Algebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 659
Recent results in the Shannon theory
Wyner, A. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055171 · Cited by 633
Multi-way communication channels
Ahlswede, R. (1973) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 615
A coding theorem for the discrete memoryless broadcast channel
Marton, K. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056046 · Cited by 607
Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacity
Li, L., & Goldsmith, A. J. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.915665 · Cited by 518
A Note on the Secrecy Capacity of the Multiple-Antenna Wiretap Channel
Liu, T., & Shamai, S. S. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018322 · Cited by 489
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
Maurer, U., & Wolf, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_24 · Cited by 483
Applications of LDPC Codes to the Wiretap Channel
Thangaraj, A., Dihidar, S., Calderbank, A. R., McLaughlin, S. W., & Merolla, J.-M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.901143 · Cited by 455
Cai, N., & Yeung, R. W. (2003) · Proceedings IEEE International Symposium on Information Theory, · doi:10.1109/isit.2002.1023595 · Cited by 444
Liao, H. H.-J. (1972) · Cited by 391
Authentication Theory/Coding Theory
Simmons, G. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_32 · Cited by 371
Lattices Which Are Good for (Almost) Everything
Erez, U., Litsyn, S., & Zamir, R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855591 · Cited by 365
Robust key generation from signal envelopes in wireless networks
Azimi-Sadjadi, B., Kiayias, A., Mercado, A., & Yener, B. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315295 · Cited by 356
Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach
Zhu, S., Xu, S., Setia, S., & Jajodia, S. (2004) · 11th IEEE International Conference on Network Protocols, 2003. Proceedings. · doi:10.1109/icnp.2003.1249782 · Cited by 344
Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels
Wilson, R., Tse, D., & Scholtz, R. A. (2007) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2007.902666 · Cited by 332
The Gaussian Multiple Access Wire-Tap Channel
Tekin, E., & Yener, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2006422 · Cited by 317
Secure Hybrid Encryption from Weakened Key Encapsulation
Hofheinz, D., & Kiltz, E. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_31 · Cited by 306
Multiple-Access Channels With Confidential Messages
Liang, Y., & Poor, H. V. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.915978 · Cited by 303
Self-citationFragouli, C., & Soljanin, E. (2006) · now publishers, Inc. eBooks · doi:10.1561/9781601980335 · Cited by 288
Secrecy capacity of SIMO and slow fading channels
Parada, P., & Blahut, R. (2005) · Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. · doi:10.1109/isit.2005.1523727 · Cited by 277
Secure Broadcasting Over Fading Channels
Khisti, A., Tchamkerten, A., & Wornell, G. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921861 · Cited by 275
An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems
Liu, T., & Viswanath, P. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.894680 · Cited by 215
A Key Predistribution Scheme for Sensor Networks Using Deployment Knowledge
Du, W., Deng, J., Han, Y. S., & Varshney, P. K. (2006) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2006.2 · Cited by 210
Quantum privacy and quantum wiretap channels
Cai, N., Winter, A., & Yeung, R. W. (2004) · Problems of Information Transmission · doi:10.1007/s11122-004-0002-2 · Cited by 202
Authentication theory and hypothesis testing
Maurer, U. M. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850674 · Cited by 200
Key Agreement in Peer-to-Peer Wireless Networks
Cagalj, M., Capkun, S., & Hubaux, J.-P. (2006) · Proceedings of the IEEE · doi:10.1109/jproc.2005.862475 · Cited by 185
Capacity of Cognitive Interference Channels With and Without Secrecy
Liang, Y., Somekh-Baruch, A., Poor, H. V., Shamai, S., & Verdu, S. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2009584 · Cited by 183
Self-citationFragouli, C., & Soljanin, E. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601980458 · Cited by 171
Secrecy Capacity of Independent Parallel Channels
Li, Z., Yates, R., & Trappe, W. (2009) · Securing Wireless Communications at the Physical Layer · doi:10.1007/978-1-4419-1385-2_1 · Cited by 169
The Wiretap Channel With Feedback: Encryption Over the Channel
Lai, L., El Gamal, H., & Poor, H. V. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929914 · Cited by 167
Self-citationSecure and efficient key management in mobile ad hoc networks
Wu, B., Wu, J., Fernandez, E. B., Ilyas, M., & Magliveras, S. (2007) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2005.07.008 · Cited by 164
Maurer, U., & Wolf, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.809563 · Cited by 159
Secret-key agreement over unauthenticated public channels-part III: privacy amplification
Maurer, U., & Wolf, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.809559 · Cited by 158
Coding for relay channels with confidential messages
Oohama, Y. (2002) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2001.955145 · Cited by 144
Cooperative jamming for wireless physical layer security
Dong, L., Han, Z., Petropulu, A. P., & Poor, H. V. (2009) · IEEE Statistical Signal Processing Workshop (SSP) · doi:10.1109/ssp.2009.5278549 · Cited by 128
Self-citationAn achievable region for the Gaussian wiretap channel with side information
Mitrpant, C., Vinck, A. J. H., & Luo, Y. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.872968 · Cited by 123
Authentication Over Noisy Channels
Lai, L., Gamal, H. E., & Poor, H. V. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2009842 · Cited by 106
Self-citationNew Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction
Renner, R., & Wolf, S. (2003) · Lecture notes in computer science · doi:10.1007/3-540-39200-9_35 · Cited by 103
On the Secrecy Capacity of Fading Wireless Channel with Multiple Eavesdroppers
Wang, P., Yu, G., & Zhang, Z. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557128 · Cited by 98
A Physical-Layer Technique to Enhance Authentication for Mobile Terminals
Xiao, L., Greenstein, L., Mandayam, N. B., et al. (2008) · International Conference on Communications · doi:10.1109/icc.2008.294 · Cited by 98
Secure nested codes for type-II wire-tap channelsPreprint
Liu, R., Liang, Y., Poor, H. V., et al. (2007) · Cited by 96
Self-citationOn the Degrees-of-Freedom of the K-user Gaussian interference channel
Etkin, R., & Ordentlich, E. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205564 · Cited by 93
Composite key management for ad hoc networks
Yi, S., & Kravits, R. (2004) · EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous) · doi:10.1109/mobiq.2004.1331710 · Cited by 89
Capacity Bounds for Broadcast Channels With Confidential Messages
Xu, J., Cao, Y., & Chen, B. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2027500 · Cited by 82
Information-Theoretic Key Agreement of Multiple Terminals—Part II: Channel Model
Gohari, A., & Anantharam, V. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2050925 · Cited by 76
Secret Communication with Feedback
Richard, D., Brown, D. R., & Poor, H. V. (2015) · Cited by 74
Self-citationInterference Channels With Common Information
Jiang, J., Xin, Y., & Garg, H. K. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.911257 · Cited by 65
Relay Channels with Confidential MessagesPreprint
Oohama, Y. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0611125 · Cited by 63
A Security Condition for Multi-Source Linear Network Coding
Cai, N., & Yeung, R. W. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557284 · Cited by 62
Efficient and robust key management for large mobile ad hoc networks
Zhu, B., Bao, F., Deng, R. H., Kankanhalli, M., & Wang, G. (2004) · Computer Networks · doi:10.1016/j.comnet.2004.11.023 · Cited by 60
A lower bound on authentication after having observed a sequence of messages
Rosenbaum, U. (1993) · Journal of Cryptology · doi:10.1007/bf00198462 · Cited by 53
Secure broadcasting : The secrecy rate region
Bagherikaram, G., Motahari, S. A., & Khandani, A. K. (2008) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2008.4797644 · Cited by 46
LDPC codes for the Gaussian wiretap channel
Klinc, D., Ha, J., McLaughlin, S., et al. (2009) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2009.5351456 · Cited by 45
Privacy-security tradeoffs in biometric security systems
Lai, L., Ho, S., & Poor, H. V. (2008) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2008.4797566 · Cited by 45
Self-citationA coding theorem for secret sharing communication systems with two Gaussian wiretap channels
Yamamoto, H. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.79919 · Cited by 43
Information-theoretic bounds for authentication schemes
Walker, M. (1990) · Journal of Cryptology · doi:10.1007/bf00190800 · Cited by 40
Coding theorem for secret sharing communication systems with two noisy channels
Yamamoto, H. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.30979 · Cited by 39
New bounds on the information-theoretic key agreement of multiple terminals
Gohari, A., & Anantharam, V. (2008) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2008.4595085 · Cited by 14
Gohari, A., & Anantharam, V. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557523 · Cited by 13
An Information Theoretic Framework for Biometric Security Systems
Lai, L., Ho, S., & Poor, H. V. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01793-3_89 · Cited by 5
Self-citation
Cited by
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
Mukherjee, A., Fakoorian, S. A. A., Huang, J., & Swindlehurst, A. L. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2014.012314.00178 · Cited by 1,483
Improving Wireless Physical Layer Security via Cooperating Relays
Dong, L., Han, Z., Petropulu, A. P., & Poor, H. V. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2038412 · Cited by 1,366
Self-citationA survey of physical layer security techniques for 5g wireless networks and challenges ahead
Wu, Y., Khisti, A., Xiao, C., Caire, G., Wong, K.-K., & Gao, X. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2825560 · Cited by 816
On Cooperative Relaying Schemes for Wireless Physical Layer Security
Li, J., Petropulu, A. P., & Weber, S. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2159598 · Cited by 414
Metadata
- Authors
- Liang, Y., Poor, H. V., & Shamai (Shitz), S.
- Venue
- now publishers, Inc. eBooks
- Publisher
- now Publishers Inc
- Published
- 2007
- OpenAlex
- W2079364662
- Cited by
- 686
- References
- 91
- FWCI
- 11.08
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.