Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

26 relations
Adversary (cryptography)Attack modelCiphertextCryptanalysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Information theoretic security of quantum key distribution overcoming the repeaterless secret key capacity bound
Quantum key distribution is a way to distribute secret keys to distant users with information theoretic security and key rates… 
Highly Cited
2013
Highly Cited
2013
Dhwani: secure peer-to-peer acoustic NFC
Near Field Communication (NFC) enables physically proximate devices to communicate over very short ranges in a peer-to-peer… 
Highly Cited
2008
Highly Cited
2008
Multiple-Access Channels With Confidential Messages
A discrete memoryless multiple-access channel (MAC) with confidential messages is studied, where two users attempt to transmit… 
Highly Cited
2008
Highly Cited
2008
The secrecy of compressed sensing measurements
  • Y. RachlinD. Baron
  • 46th Annual Allerton Conference on Communication…
  • 2008
  • Corpus ID: 686532
Results in compressed sensing describe the feasibility of reconstructing sparse signals using a small number of linear… 
Highly Cited
2008
Highly Cited
2008
Universal Secure Network Coding via Rank-Metric Codes
The problem of securing a network coding communication system against an eavesdropper is considered. The network implements… 
Highly Cited
2007
Highly Cited
2007
Secure Nested Codes for Type II Wiretap Channels
This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and… 
Highly Cited
2007
Highly Cited
2007
The Wiretap Channel With Feedback: Encryption Over the Channel
In this work, the critical role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is established. Unlike… 
Highly Cited
2006
Highly Cited
2006
Information-theoretically secure protocols and security under composition
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is… 
2002
2002
Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes
This paper presents essentially optimal lower bounds on the size of linear codes C : {0, 1}n ? {0, 1}m which have the property… 
Highly Cited
2001
Highly Cited
2001
The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)
We study the question of how to generically compose symmetric encryption and authentication when building "secure channels" for… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)