Results 261 to 270 of about 3,510 (286)
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 +2 more
openaire +1 more source
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
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 Pulpánová
openaire +1 more source
Authentication Schemes, Perfect Local Randomizers, Perfect Secrecy and Secret Sharing Schemes
Designs, Codes and Cryptography, 1996Shannon showed in his classic theory that if a cipher system provides perfect secrecy the number of keys is greater than the number of messages. In the 1980's Simmons developed the theory of authentication, relating the size of the key space to the probability of deception. In 1990 \textit{M. Walker} [J. Cryptology 2, No.
Mitchell, Chris J +3 more
openaire +3 more sources
Optimal Coding and Allocation for Perfect Secrecy in Multiple Clouds
IEEE Transactions on Information Forensics and Security, 2016For a user to store data in the cloud, using services provided by multiple cloud storage providers (CSPs) is a promising approach to increase the level of data availability and confidentiality, as it is unlikely that different CSPs are out of service at the same time or collude with each other to extract information of a user.
Ping Hu 0002 +3 more
openaire +2 more sources
Perfect Secrecy in the Bounded Storage Model
2021 IEEE Global Communications Conference (GLOBECOM), 2021Divyanshu Bhardwaj, Hamid R. Sadjadpour
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