Results 21 to 30 of about 8,083 (242)
Secret key agreement under discussion rate constraints [PDF]
2017 IEEE International Symposium on Information Theory (ISIT), 2017 For the multiterminal secret key agreement problem, new single-letter lower bounds are obtained on the public discussion rate required to achieve any given secret key rate below the secrecy capacity. The results apply to general source model without helpers or wiretapper's side information but can be strengthened for hypergraphical sources.
Chung Chan +3 more
openaire +2 more sources
Noncoherent Capacity of Secret-Key Agreement With Public Discussion [PDF]
IEEE Transactions on Information Forensics and Security, 2011 We study the noncoherent capacity of secret-key agreement with public discussion over independent identically distributed (i.i.d.) Rayleigh fading wireless channels, where neither the sender nor the receivers have access to instantaneous channel state information (CSI). We present two results.
Anurag Agrawal +3 more
openaire +2 more sources
Wiretap Secret Key Agreement Via Secure Omniscience
CoRR, 2021 46 pages, 8 figures, submitted to the IEEE Transactions on Information Theory.
Praneeth Kumar Vippathalla +3 more
openaire +2 more sources
Secret sharing-based authentication and key agreement protocol for machine-type communications
International Journal of Distributed Sensor Networks, 2019 One of the main challenges for the development of the Internet of Things is the authentication of large numbers of devices/sensors, commonly served by massive machine-type communications, which jointly with long-term evolution has been considered one of ...
Ana Paula G Lopes +3 more
doaj +1 more source
Secret Key Generation and Agreement in UWB Communication Channels [PDF]
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference, 2008 It has been shown that the radio channel impulse response for a pair of legitimate Ultra-wide band (UWB) transceivers can be used to generate secret keys for secure communications. Past proposed secret key generation algorithms under-exploited the available number of secret key bits from the radio channel. This paper proposes a new efficient method for
Masoud Ghoreishi Madiseh +4 more
openaire +1 more source
Multiple Observations for Secret-Key Binding with SRAM PUFs
Entropy, 2021 We present a new Multiple-Observations (MO) helper data scheme for secret-key binding to an SRAM-PUF. This MO scheme binds a single key to multiple enrollment observations of the SRAM-PUF.
Lieneke Kusters, Frans M. J. Willems
doaj +1 more source
Multiterminal Secret Key Agreement with Nearly No Discussion
CoRR, 2019 We consider the secret key agreement problem under the multiterminal source model proposed by Csiszár and Narayan. A single-letter characterization of the secrecy capacity is desired but remains unknown except in the extreme case with unlimited public discussion and without wiretapper's side information.
Chung Chan +3 more
openaire +2 more sources
Universal Multiparty Data Exchange and Secret Key Agreement [PDF]
IEEE Transactions on Information Theory, 2017 Multiple parties observing correlated data seek to recover each other's data and attain omniscience. To that end, they communicate interactively over a noiseless broadcast channel - each bit transmitted over this channel is received by all the parties.
Himanshu Tyagi, Shun Watanabe
openaire +2 more sources
A Channel Model of Transceivers for Multiterminal Secret Key Agreement
CoRR, 2020 Information theoretic secret key agreement is impossible without making initial assumptions. One type of initial assumption is correlated random variables that are generated by using a noisy channel that connects the terminals. Terminals use the correlated random variables and communication over a reliable public channel to arrive at a shared secret ...
Alireza, Poostindouz +1 more
openaire +3 more sources
Secret-Key-Agreement Advantage Distillation With Quantization Correction
IEEE Communications Letters, 2023 We propose a novel advantage distillation strategy for physical layer-based secret-key-agreement (SKA). We consider a scenario where Alice and Bob aim at extracting a common bit sequence, which should remain secret to Eve, by quantizing a random number obtained from measurements at their communication channel.
Ardizzon, Francesco +2 more
openaire +3 more sources