Secret Key Generation With Limited Interaction
نویسندگان
چکیده
منابع مشابه
Common Randomness and Key Generation with Limited Interaction
A basic two-terminal secret key generation model is considered, where the interactive communication rate between the terminals may be limited, and in particular may not be enough to achieve the maximum key rate. We first prove a multi-letter characterization of the key-communication rate region (where the number of auxiliary random variables depend on the number of rounds of the communication),...
متن کاملSecret Key Generation for Fading Wireless Channel
The multipath-rich wireless atmosphere allied with typical wireless usage scenarios is characterized by a vanishing channel retort that is time-varying, location-sensitive, and only shared by a given transmitter–receiver pair. The complexity allied with a highly scattering atmosphere implies that the short-term vanishing process is intrinsically hard to envisage and best modeled stochastically,...
متن کاملSecret Key Generation by Virtual Link Estimation
In recent years, researchers have explored using unique radio propagation characteristics between two devices for extracting symmetric keys. However, the state-of-the-art has the following limitations: (i) paying more attention to only when the two devices are in communication range, and (ii) generating keys only when the devices are in motion. Secret key generation for devices which are not in...
متن کاملCommon randomness and secret key generation with a helper
We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a “helper” terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to transmit ...
متن کاملSecret Key Generation from Channel Noise with the Help of a Common Key
Information-theoretically secure communications are possible when channel noise is usable and when the channel has an intrinsic characteristic that a legitimate receiver (Bob) can use the noise more advantageously than an eavesdropper (Eve). This report deals with the case in which the channel does not have such an intrinsic characteristic. Here, we use a pre-shared common key as a tool that ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2746104