Results 11 to 20 of about 2,320 (256)
Symmetric Blind Decryption with Perfect Secrecy [PDF]
Journal of Computer Networks and Communications, 2017 A blind decryption scheme enables a user to query decryptions from a decryption server without revealing information about the plain-text message. Such schemes are useful, for example, for the implementation of privacy-preserving encrypted file storages ...
Juha Partala
doaj +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.
Nitinawarat, Sirin, Narayan, Prakash
exaly +4 more sources
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 +1 more source
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.
Ho, Siu-Wai +3 more
openaire +5 more sources
Artificial Noise Aided Secure Transmission for Active RIS-Aided NOMA Networks
IEEE Access, 2023 A secrecy rate maximization problem for active reconfigurable intelligent surface (RIS) aided non-orthogonal multiple access networks has been studied in this paper. Assuming that the perfect channel state information is available, we aim to maximize the
Fengming Yang, Weiran Guo, Jianxin Dai
doaj +1 more source
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 +1 more source
Online Scheduling for Multi-Hops Wireless Networks With Security Constraints
IEEE Access, 2019 We consider wireless multi-hops networks in which each node desires to securely transmit the message. To guarantee secure transmission, we employ an independent randomization encoding strategy to encode the confidential message.
Qiuming Liu +4 more
doaj +1 more source
IET Communications, 2022 In this era of 5G technology, the ever‐increasing demands for high data rates lead researchers to develop hybrid satellite‐terrestrial (HST) networks as a substitution to the conventional cellular terrestrial systems.
Abida Sultana Sumona +2 more
doaj +1 more source
EURASIP Journal on Wireless Communications and Networking, 2021 Physical layer security (PLS) has been proposed to afford an extra layer of security on top of the conventional cryptographic techniques. Unlike the conventional complexity-based cryptographic techniques at the upper layers, physical layer security ...
Long Kong +5 more
doaj +1 more source
A transport-independent general purpose cryptographic protocol
Adaptivni Sistemi Avtomatičnogo Upravlinnâ, 2022 The article considers the problem of the transport-independent cryptographic protocol. We analyze requirements for general purpose cryptographic protocol. An analysis of existing protocols is performed to highlight their drawbacks. A protocol schema and
К. Лесогорський +1 more
doaj +1 more source