Next Article in Journal
Asymptotic Rate-Distortion Analysis of Symmetric Remote Gaussian Source Coding: Centralized Encoding vs. Distributed Encoding
Next Article in Special Issue
Feedback Schemes for the Action-Dependent Wiretap Channel with Noncausal State at the Transmitter
Previous Article in Journal
An Intuitionistic Evidential Method for Weight Determination in FMEA Based on Belief Entropy
Previous Article in Special Issue
A Simple Secret Key Generation by Using a Combination of Pre-Processing Method with a Multilevel Quantization
Article Menu
Issue 2 (February) cover image

Export Article

Open AccessArticle
Entropy 2019, 21(2), 212; https://doi.org/10.3390/e21020212

Attack Algorithm for a Keystore-Based Secret Key Generation Method

1
The Department of Electrical and Computer Engineering, Institute of New Media and Communications (INMC), Seoul National University, Seoul 08826, Korea
2
The Department of Information and Communication Engineering, Chosun University, Gwangju 61452, Korea
3
The Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA 92093, USA
*
Author to whom correspondence should be addressed.
Received: 19 January 2019 / Revised: 18 February 2019 / Accepted: 20 February 2019 / Published: 23 February 2019
(This article belongs to the Special Issue Information-Theoretic Security II)
Full-Text   |   PDF [431 KB, uploaded 26 February 2019]   |  

Abstract

A new attack algorithm is proposed for a secure key generation and management method introduced by Yang and Wu. It was previously claimed that the key generation method of Yang and Wu using a keystore seed was information-theoretically secure and could solve the long-term key storage problem in cloud systems, thanks to the huge number of secure keys that the keystone seed can generate. Their key generation method, however, is considered to be broken if an attacker can recover the keystore seed. The proposed attack algorithm in this paper reconstructs the keystore seed of the Yang–Wu key generation method from a small number of collected keys. For example, when t = 5 and l = 2 7 , it was previously claimed that more than 2 53 secure keys could be generated, but the proposed attack algorithm can reconstruct the keystone seed based on only 84 collected keys. Hence, the Yang–Wu key generation method is not information-theoretically secure when the attacker can gather multiple keys and a critical amount of information about the keystone seed is leaked. View Full-Text
Keywords: information-theoretically secure; key generation; key management; keystore seed; one-key-for-one-file information-theoretically secure; key generation; key management; keystore seed; one-key-for-one-file
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Chae, S.; Kim, Y.-S.; No, J.-S.; Kim, Y.-H. Attack Algorithm for a Keystore-Based Secret Key Generation Method. Entropy 2019, 21, 212.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top