Random Secrets of the Reality Trade

Michael Brooks

M. Katugampola, P. Gunawardhana, A. Schmidt +5 more

Vamoua Yachongka, Hideki Yagi, Yasutada Oohama

We analyze the fundamental trade-off of secret key-based authentication systems in the presence of an eavesdropper for correlated Gaussian sources. A complete characterization of the trade-off among secret-key, storage, and privacy-leakage rates of both generated and chosen secret models is provided. One of the main contributions is revealing that unlike the known results for discrete sources, there is no need for the second auxiliary random variable in characterizing the capacity regions for the Gaussian cases. In addition, it is shown that the strong secrecy for secrecy-leakage of the systems can be achieved by an information-spectrum approach, and the parametric expressions (computable forms) of the capacity regions are also derived.

Heinrich Päs

Andreas Winter

The inverse of Maurer's secret key distillation problem from (many independent realisations of) a triple of random variables X, Y, Z by two players (Alice and Bob) against an eavesdropper (Eve) is considered: the formation of the joint distribution (up to local degrading of Z) from secret key and public communication. We determine the asymptotically minimal amount of secret key for this task, and indeed the full trade-off of secret (between Alice and Bob) vs. public (shared between Alice, Bob and Eve) correlation for this problem. Our result generalises a theorem of Wyner on the "common information of a pair of random variables", which is recovered as the special case of Z being independent of XY. We investigate the secret key required as a function of the probability distribution and compare to an analogous notion based on prior shared entanglement

Mike Yuliana, Wirawan Wirawan, Suwadi Suwadi

The necessity for secured communication devices that has limited computing power has encouraged the development of key generation scheme. The generation of a symmetric key scheme that utilizes randomness of wireless channels offers a most promising solution as a result of the easy distribution of secret key mechanisms. In the last few years, various schemes have been proposed, but there are trade-offs between the performance parameters used. The expected parameters are the low Key Disagreement Rate (KDR), the high Key Generation Rate (KGR), and the fulfillment of standard of randomness. In this paper, we propose the use of a combination of pre-processing methods with multilevel lossy quantization to overcome the trade-off of performance parameters of the Secret Key Generation (SKG) scheme. Pre-process method used to improve reciprocity so as to reduce KDR, whereas multilevel quantization is used to improve the KGR. We use Kalman as the pre-processing method and Adaptive Quantization, Modified Multi-Bit (MMB), and 2-ary Quantization as the multilevel lossy quantization. Testing is conducted by comparing the performance between direct quantization with the addition of the pre-processing method in various multilevel lossy quantization schemes. The test results show that the use of Kalman as pre-processing methods and multilevel lossy quantization can overcome the trade-off performance parameters by reducing KDR and increasing KGR, with the best performance, was obtained when we use adaptive quantization. The resulting secret key has also fulfilled 6 random tests with p values greater than 0.01.