Secret key agreement (SKA) is a basic cryptographic primitive that establishes a shared secret key between parties. In the two-party source model of SKA, Alice and Bob want to share a secret key. They each have private samples of two correlated variables that are partially leaked to Eve. In a one-way SKA protocol, Alice sends a single message to Bob over a public channel, allowing the two parties to calculate a shared secret key that will be essentially unknown to Eve. The length of the key is a function of the number of samples $n$ . In this paper, we prove a tight second-order asymptotic approximation of the key length of one-way SKA protocols, and propose an approach to construct a computationally efficient one-way SKA protocol with near-optimum finite key length. We compare our results with related work, and discuss future research directions.Secret key agreement (SKA) is a basic cryptographic primitive that establishes a shared secret key between parties. In the two-party source model of SKA, Alice and Bob want to share a secret key. They each have private samples of two correlated variables that are partially leaked to Eve. In a one-way SKA protocol, Alice sends a single message to Bob over a public channel, allowing the two parties to calculate a shared secret key that will be essentially unknown to Eve. The length of the key is a function of the number of samples$n$. In this paper, we prove a tight second-order asymptotic approximation of the key length of one-way SKA protocols, and propose an approach to construct a computationally efficient one-way SKA protocol with near-optimum finite key length. We compare our results with related work, and discuss future research directions.

IEEE International Symposium on Information Theory (ISIT)Jul 12, 20212 citations

A study on secret key agreement and sharing

孝也栃窪

Jan 1, 20040 citations

Robustness of secret key agreement protocol with massive MIMO under pilot contamination attack

Sanghun Im, Hyoungsuk Jeon, Jinho Choi +1 more

We consider a secret key agreement (SKA) protocol over time division duplex for a massive Multiple-Input-Multiple-Output (MIMO) system. As a security threat, we assume that a pilot contamination attack (PCA) is attempted by an eavesdropper for the purpose to gain information about the secret key. The eavesdropper controls its transmit power for the PCA in a way to maximize the amount of eavesdropping information, while hiding her presence from legitimate users. To fend off this PCA, we consider a SKA protocol working with a PCA detector. Specifically, our SKA protocol suspends the key generation process to prevent information leakage to the eavesdropper if the PCA detector declares the presence of the PCA more than a certain number of times. Taking into account the best choice of the PCA power for the eavesdropper, we analyze an achievable length of generated secret key through our SKA protocol. Simulation results show that our SKA protocol effectively suppresses the eavesdropper's PCA power by adjusting a threshold determining the suspension of the PCA, and a positive length of secret key is achievable through our SKA protocol.We consider a secret key agreement (SKA) protocol over time division duplex for a massive Multiple-Input-Multiple-Output (MIMO) system. As a security threat, we assume that a pilot contamination attack (PCA) is attempted by an eavesdropper for the purpose to gain information about the secret key. The eavesdropper controls its transmit power for the PCA in a way to maximize the amount of eavesdropping information, while hiding her presence from legitimate users. To fend off this PCA, we consider a SKA protocol working with a PCA detector. Specifically, our SKA protocol suspends the key generation process to prevent information leakage to the eavesdropper if the PCA detector declares the presence of the PCA more than a certain number of times. Taking into account the best choice of the PCA power for the eavesdropper, we analyze an achievable length of generated secret key through our SKA protocol. Simulation results show that our SKA protocol effectively suppresses the eavesdropper's PCA power by adjusting a threshold determining the suspension of the PCA, and a positive length of secret key is achievable through our SKA protocol.

International Conference on Information and Communication Technology Convergence (ICTC)Oct 1, 20139 citations

Secret key sharing and secret key generation

van Me Marten Dijk

Jan 1, 199726 citations

Key Agreement Protocols

Colin Boyd, Anish Mathuria

Information security and cryptographyJan 1, 20037 citations

A Capacity-achieving One-way Key Agreement with Improved Finite Blocklength Analysis

Setareh Sharifian, Alireza Poostindouz, Reihaneh Safavi–Naini

Information-theoretic secret key agreement (SKA) protocols are a fundamental cryptographic primitive that are used to establish a shared secret key between two or more parties. In a two-party SKA in source model, Alice and Bob have samples of two correlated variables that are partially leaked to Eve, and their goal is to establish a shared secret key by communicating over a reliable public channel. Eve must have no information about the established key. In this paper, we study the problem of one-way secret key agreement where the key is established by Alice sending a public message to Bob. We propose a one-way SKA (OW-SKA) protocol, prove that it achieves the one-way secret key capacity, and use it to derive a finite blocklength bound on the achievable secret key length. We compare our results with existing OW-SKAs and show the protocol achieves a longer key, and has a combination of desirable properties.Information-theoretic secret key agreement (SKA) protocols are a fundamental cryptographic primitive that are used to establish a shared secret key between two or more parties. In a two-party SKA in source model, Alice and Bob have samples of two correlated variables that are partially leaked to Eve, and their goal is to establish a shared secret key by communicating over a reliable public channel. Eve must have no information about the established key. In this paper, we study the problem of one-way secret key agreement where the key is established by Alice sending a public message to Bob. We propose a one-way SKA (OW-SKA) protocol, prove that it achieves the one-way secret key capacity, and use it to derive a finite blocklength bound on the achievable secret key length. We compare our results with existing OW-SKAs and show the protocol achieves a longer key, and has a combination of desirable properties.

International Symposium on Information Theory and its ApplicationsOct 24, 20206 citations

n

. In this paper, we prove a tight second-order asymptotic approximation of the key length of one-way SKA protocols, and propose an approach to construct a computationally efficient one-way SKA protocol with near-optimum finite key length. We compare our results with related work, and discuss future research directions.