Results 251 to 260 of about 3,510 (286)
Asymptotic perfect secrecy in distributed estimation for large sensor networks
, 2017 This paper considers asymptotic perfect secrecy and asymptotic perfect estimation in distributed estimation for large sensor networks under threat of an eavesdropper, which has access to all sensor outputs.
Rogers, Uri +5 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Perfect secrecy, perfect omniscience and steiner tree packing
2009 IEEE International Symposium on Information Theory, 2009We investigate perfect secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then allowed to communicate interactively in multiple rounds over a public noiseless channel of unlimited ...
Sirin Nitinawarat +4 more
openaire +1 more source
Distributed Compressive Detection with Perfect Secrecy
2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems, 2014This paper considers the problem of distributed compressive detection under a perfect secrecy constraint. More specifically, we consider the problem where the distributed inference network operates in the presence of an eavesdropper who wants to discover the state of the nature being monitored by the system.
Bhavya Kailkhura +3 more
openaire +1 more source
Perfect secrecy and combinatorial tree packing
2010 IEEE International Symposium on Information Theory, 2010We 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 +1 more source
State estimation codes for perfect secrecy
2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017We study the problem of remote state estimation, in the presence of a passive eavesdropper. An authorized user estimates the state of an unstable linear plant, based on the packets received from a sensor, while the packets may also be intercepted by the eavesdropper.
Anastasios Tsiamis +2 more
openaire +1 more source
Combinational constructions of splitting authentication codes with perfect secrecy
Designs, Codes and Cryptography, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lijun Ji, Miao Liang, Yanting Wang
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
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
Robust authentication and data storage with perfect secrecy
2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2017We consider a Physical-Unclonable-Function (PUF)-based authentication process. We define achievable secret-key rate versus privacy-leakage rate pairs featuring perfect secrecy and uniform distribution of the secret-key. We derive the capacity region corresponding to this definition of achievability and thus show that it equals the known capacity region
Sebastian Baur, Holger Boche
openaire +1 more source
Source coding with side information for error free perfect secrecy systems
, 2013 This paper considers source coding problems with the requirements of perfect secrecy and zero error at receivers. In the problems considered in this paper, there is always one transmitter but there can be one or two receivers.
Siu-Wai Ho, Lifeng Lai, Alex Grant
exaly +2 more sources