Results 11 to 20 of about 373,036 (186)
Error-Free Perfect Secrecy Systems
2011 IEEE International Symposium on Information Theory Proceedings, 2011 Shannon's fundamental bound for perfect secrecy says that the entropy of the secret message cannot be larger than the entropy of the secret key initially shared by the sender and the legitimate receiver. Massey gave an information theoretic proof of this result, however this proof does not require independence of the key and ciphertext.
Siu-Wai Ho +3 more
openaire +5 more sources
Towards Foundations of Cryptography: Investigation of Perfect Secrecy
J. Univers. Comput. Sci., 1996 JUCS - Journal of Universal Computer Science Volume Nr.
Jürgensen,H., Robbins,L.
openaire +6 more sources
Sensors, 2017 Due to their frequent use in unattended and hostile deployment environments, the security in wireless sensor networks (WSNs) has attracted much interest in the past two decades.
Ling Xiong +4 more
doaj +2 more sources
Shannon Perfect Secrecy in a Discrete Hilbert Space [PDF]
2020 IEEE International Conference on Quantum Computing and Engineering (QCE), 2020 7 pages, 1 figure, presented and published by ...
Randy Kuang, Nicolas Bettenburg
openaire +4 more sources
Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing [PDF]
IEEE Transactions on Information Theory, 2010 We consider perfect secret key generation for a ``pairwise independent network'' model in which every pair of terminals share a random binary string, with the strings shared by distinct terminal pairs being mutually independent. The terminals are then allowed to communicate interactively over a public noiseless channel of unlimited capacity.
Sirin Nitinawarat, Prakash Narayan
openaire +6 more sources
XOR Chain and Perfect Secrecy at the Dawn of the Quantum Era
Cryptography, 2023 In this article, we present a new method that achieves Shannon’s perfect secrecy. To achieve this property, we will introduce the triple XOR cancellation rule. The approach has two execution modes: digital signature and data encryption.
Luis Adrián Lizama-Pérez
doaj +1 more source
Perfect secrecy via compressed sensing [PDF]
2013 Iran Workshop on Communication and Information Theory, 2013 In this paper we consider the compressive sensing based encryption and proposed the conditions in which the perfect secrecy is achievable. We prove that when the measurement matrix holds the Restricted Isometry Property (RIP) and the number of measurements is more than two times of the sparsity level, i.e., M ≥ 2k, the Shannon perfect secrecy condition
Mahmoud Ramezani Mayiami +2 more
openaire +2 more sources
Counter Mode of the Shannon Block Cipher Based on MPF Defined over a Non-Commuting Group
Mathematics, 2022 In this paper, we present a counter mode of a Shannon block cipher based on the matrix power function. We make use of the matrix power function to define a single round symmetric cipher.
Aleksejus Mihalkovich +2 more
doaj +1 more source
Keys under doormats - mandating insecurity by requiring government access to all data and communications [PDF]
, 2015 Twenty years ago, law enforcement organizations lobbied to require data and communication services to engineer their products to guarantee law enforcement access to all data.
Harold Abelson +32 more
core +2 more sources
Perfect Secrecy System Based on Chaotic Key Generator
Iraqi Journal of Information & Communication Technology, 2018 Shannon defines perfect secrecy for a cryptographic system as such a cryptographic system in which the ciphertext yields no possible information about the plaintext.
Mahmood Khalel Ibrahem
doaj +1 more source