Results 221 to 230 of about 2,320 (256)
Some of the next articles are maybe not open access.
Unshared secret key cryptography: Achieving Shannon's ideal secrecy and perfect secrecy
2014 IEEE Information Theory Workshop (ITW 2014), 2014In cryptography, a shared secret key is normally mandatory to encrypt the confidential message. In this work, we propose the unshared secret key (USK) cryptosystem. Inspired by the artificial noise (AN) technique, we align a one-time pad (OTP) secret key within the null space of a multiple- output multiple-input (MIMO) channel between transmitter and ...
Shuiyin Liu, Yi Hong, Emanuele Viterbo
openaire +1 more source
Achieving Perfect Secrecy with One Bit Keys
MILCOM 2018 - 2018 IEEE Military Communications Conference (MILCOM), 2018Shannon perfect secrecy, also known as one-time pad, can only be achieved by using exactly a different key bit for each information bit. This requirement makes the implementation of perfect secrecy impractical in most applications. In this paper, a novel coding scheme for security is proposed that achieves perfect secrecy with only half a bit key per ...
Mohsen Karimzadeh Kiskani +1 more
openaire +1 more source
Achieving Perfect Secrecy by pdf-Bandlimited Jamming
IEEE Signal Processing Letters, 2014Nowadays, the most investigated concepts of physical layer security encompass asymptotic criteria of secrecy. Taking a different perspective, in this work we come back to Shannon's original formulation of perfect secrecy, amounting to impose exactly zero mutual information between the source message and the data gathered by the eavesdropper. By jamming
MARANO, Stefano, MATTA, Vincenzo
openaire +2 more sources
Probability and Perfect Secrecy
2001In the previous chapter, we have described a number of historical cryptosystems. It turned out that they were all affine linear and therefore insecure. Are there cryptosystems that are provably secure? In 1949, Claude Shannon [66] was able to describe such systems. Unfortunately, those systems are not very efficient.
openaire +1 more source
Perfect Secrecy Encryption of Analog Signals
IEEE Journal on Selected Areas in Communications, 1984Any scheme that encrypts an analog message with perfect secrecy using a finite-size digital key must inevitably degrade the quality of the recovered message. With the constraints of perfect secrecy and a finite key size, no analog encryption system can ever achieve less degradation than is achievable by optimal digitization of the message (by block ...
openaire +1 more source
A large-deviations notion of perfect secrecy
IEEE Transactions on Information Theory, 2003Summary: We consider the Shannon cipher system with a variable key rate, and study the necessary and sufficient conditions for perfect secrecy in the sense that the exponential rate of the probability of breaking into the system would not be improved by observing the cryptogram.
openaire +1 more source
A Fully Homomorphic Cryptosystem with Approximate Perfect Secrecy
2013We propose a new fully homomorphic cryptosystem called Symmetric Polly Cracker (SymPC) and we prove its security in the information theoretical settings. Namely, we prove that SymPC approaches perfect secrecy in bounded CPA model as its security parameter grows (which we call approximate perfect secrecy).
Michal Hojsík, Veronika Půlpánová
openaire +1 more source
Program Refinement, Perfect Secrecy and Information Flow
2016“Classical” proofs of secure systems are based on reducing the hardness of one problem (defined by the protocol) to that of another (a known difficult computational problem). In standard program development [1, 3, 14] this “comparative approach” features in stepwise refinement: describe a system as simply as possible so that it has exactly the required
openaire +1 more source