Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Information-theoretic security

Known as: Information-theoretically secure, Perfect secrecy, Information theoretic security 
A cryptosystem is information-theoretically secure if its security derives purely from information theory. That is, it cannot be broken even when the… Expand
Wikipedia

Related topics

Related topics

26 relations
Adversary (cryptography)Attack modelCiphertextCryptanalysis
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Information Theoretic Security
  • Carles Padró
  • Lecture Notes in Computer Science
  • 2013
    • Corpus ID: 2406692
We say that a network coding scheme is strongly 1-secure if a source node s can multicast n field elements {m1, · · · ,mn} to a… Expand
  • figure 5
  • figure 6
  • table 1
  • table 2
  • figure 5
Is this relevant?
Review
2009
Review
2009
Information Theoretic Security
Security is one of the most important issues in communications. Security issues arising in communication networks include… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 2.1
  • figure 2.2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Wireless Information-Theoretic Security
This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Sharemind: A Framework for Fast Privacy-Preserving Computations
Gathering and processing sensitive data is a difficult task. In fact, there is no common recipe for building the necessary… Expand
  • figure 1
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The secrecy capacity of the MIMO wiretap channel
We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
On the Secrecy Capacity of Fading Channels
We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
An information-theoretic security proof for QKD protocols
We present a new technique for proving the security of quantum key distribution (QKD) protocols. It is based on direct… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Information-theoretic security proof for quantum-key-distribution protocols (17 pages)
We present a technique for proving the security of quantum-key-distribution (QKD) protocols. It is based on direct information… Expand
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Quantum Cryptography
II A beautiful idea 2 A The intuition . . . . . . . . . . . . . . . 2 B Classical cryptography . . . . . . . . . 3 1 Asymmetrical… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1975
Highly Cited
1975
The wire-tap channel
  • Aaron D. Wyner
  • The Bell System Technical Journal
  • 1975
    • Corpus ID: 21512925
We consider the situation in which digital data is to be reliably transmitted over a discrete, memoryless channel (dmc) that is… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE