• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권8호
• /
• pp.1972-1988
• /
• 2013

In order to deal with key exposure problem, we introduce forward secure technique into certificateless proxy signature scheme, and propose the formal definition and security model of the forward secure certificateless proxy signature. Our security model takes into account the super adversary in certificateless signature. Furthermore, we present a construction of forward secure certificateless proxy signature scheme with bilinear maps. Based on the difficulty of computational Diffie-Hellman problem, we prove the scheme is secure against chosen message attack in the random oracle model. Finally, we analyze efficiency of the proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2792-2810
• /
• 2017

Forward-secure signature is a specific type of signature, which can mitigate the damage caused by the signing key exposure. Most of the existing forward-secure (identity-based) signature schemes can update users' secret keys at each time period, achieve the existential unforgeability, and resist against classical computer attacks. In this paper, we first revisit the framework of forward-secure identity-based signatures, and aim at supporting flexible key update at multi time period. Then we propose a post-quantum forward-secure identity-based signature scheme from lattices and use the basis delegation technique to provide flexible key update. Finally, we prove that the proposed scheme is strongly unforgeable under the short integer solution (SIS) hardness assumption in the random oracle model.

• ETRI Journal
• /
• 제37권3호
• /
• pp.573-583
• /
• 2015

We introduce the idea of a forward-secure undetachable digital signature (FS-UDS) in this paper, which enables mobile agents to generate undetachable digital signatures with forward security of the original signer's signing key. The definition and security notion of an FS-UDS scheme are given. Then, the construction of a concrete FS-UDS scheme is proposed; and the proof of security for the proposed scheme is also provided. In the proposed scheme, mobile agents need not carry the signing key when they generate digital signatures on behalf of the original signer, so the signing key will not be compromised. At the same time, the encrypted function is combined with the original signer's requirement; therefore, misuse of the signing algorithm can be prevented. Furthermore, in the case where a hacker has accessed the signing key of the original signer, he/she is not able to forge a signature for any time period prior to when the key was obtained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1502-1522
• /
• 2019

Leakage of secret keys may be the most devastating problem in public key cryptosystems because it means that all security guarantees are missing. The forward security mechanism allows users to update secret keys frequently without updating public keys. Meanwhile, it ensures that an attacker is unable to derive a user's secret keys for any past time, even if it compromises the user's current secret key. Therefore, it offers an effective cryptographic approach to address the private key leakage problem. As an extension of the forward security mechanism in certificate-based public key cryptography, forward-secure certificate-based signature (FS-CBS) has many appealing merits, such as no key escrow, no secure channel and implicit authentication. Until now, there is only one FS-CBS scheme that does not employ the random oracles. Unfortunately, our cryptanalysis indicates that the scheme is subject to the security vulnerability due to the existential forgery attack from the malicious CA. Our attack demonstrates that a CA can destroy its existential unforgeability by implanting trapdoors in system parameters without knowing the target user's secret key. Therefore, it is fair to say that to design a FS-CBS scheme secure against malicious CAs without lying random oracles is still an unsolved issue. To address this problem, we put forward an enhanced FS-CBS scheme without random oracles. Our FS-CBS scheme not only fixes the security weakness in the original scheme, but also significantly optimizes the scheme efficiency. In the standard model, we formally prove its security under the complexity assumption of the square computational Diffie-Hellman problem. In addition, the comparison with the original FS-CBS scheme shows that our scheme offers stronger security guarantee and enjoys better performance.

• ETRI Journal
• /
• 제39권5호
• /
• pp.729-736
• /
• 2017

This work investigates secure cluster-aided multi-hop randomize-and-forward networks. We present a hop-by-hop multi-hop transmission scheme with relay selection, which evaluates for each cluster the relays that can securely receive the message. We propose an analytical model to derive the secure connectivity probability (SCP) of the hop-by-hop transmission scheme. For comparison, we also analyze SCPs of traditional end-to-end transmission schemes with two relay-selection policies. We perform simulations, and our analytical results verify that the proposed hop-by-hop scheme is superior to end-to-end schemes, especially with a large number of hops or high eavesdropper channel quality. Numerical results also show that the proposed hop-by-hop scheme achieves near-optimal performance in terms of the SCP.

• 정보보호학회논문지
• /
• 제13권5호
• /
• pp.147-157
• /
• 2003

보통의 공개 열쇠 암호 시스템에서 비밀 열쇠가 노출되면 그 비밀 열쇠로 생성된 암호문이나 서명 등의 해독, 위조가 가능하다. 이런 비밀 열쇠 노출의 위험성은 상대적으로 물리적인 보안이 이루어지지 않은 핸드폰, 스마트카드 등과 같은 열쇠 저장 장치에 가장 큰 위협이 되고 있다. 따라서 현재 비밀 정보가 노출되어도 과거의 비밀 열쇠에 의해 생성된 정보는 안전하게 유지되어야 한다는 전방향 안전성 개념(forward security)은 열쇠교환 프로토콜 및 여러 암호 요소(primitive)들이 필수적으로 만족해야 할 조건이다. 본 논문에서는 Cap Diffie-Hellman 군을 사용하여 전방향 안전성을 만족하는 서명 기법을 제안한다. 제안된 서명 기법은 계산적 Diffie-Hellman 문제의 어려움을 기반으로 선택 메시지 공격 모델에 대한 증명가능한 안전성을 가진다.

• 정보보호학회논문지
• /
• 제17권5호
• /
• pp.27-38
• /
• 2007

전자우편을 사용할 때 고려해야 하는 중요한 보안 이슈 중 하나는 사용자 프라이버시이다. 현재 PGP(Pretty Good Privacy), S/MIME(Secure/Multipurpose Internet Mail Extension) 등의 여러 가지 전자우편 보안 프로토콜이 제안되어 사용되고 있으나, 이들 프로토콜은 안전성을 향상시킬 수 있는 요구사항인 전방향 안전성을 보장하지 못한다. 최근 이 특성을 만족하기 위한 전자우편 프로토콜들이 제안되었으나 실용성과효율성 측면에서 개선이 필요하고, 일부 프로토콜은 실질적으로 완전한 전방향 안전성을 제공하고 있지 못하다. 이 논문에서는 실용성을 갖춘 효율적인 전자우편 보안 프로토콜을 제안한다. 제안하는 프로토콜은 기존의 전자우편 시스템에 영향을 주지 않는 실용적인 모델을 사용하며, 타원곡선 기반의 signcryption 기법을 사용하여 효율적으로 메시지를 인증한다. 추가적으로, 다수의 사람에게 전자우편을 전송할 때에도 적용할 수 있다는 장점이 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1553-1571
• /
• 2018

Currently, many of schemes for smart grid data aggregation are based on a one-level gateway (GW) topology. Since the data aggregation granularity in this topology is too single, the control center (CC) is unable to obtain more fine-grained data aggregation results for better monitoring smart grid. To improve this issue, Shen et al. propose an efficient privacy-preserving cube-data aggregation scheme in which the system model consists of two-level GW. However, a risk exists in their scheme that attacker could forge the signature by using leaked signing keys. In this paper, we propose a secure and fine-grained electricity consumption aggregation scheme for smart grid, which employs the homomorphic encryption to implement privacy-preserving aggregation of users' electricity consumption in the two-level GW smart grid. In our scheme, CC can achieve a flexible electricity regulation by obtaining data aggregation results of various granularities. In addition, our scheme uses the forward-secure signature with backward-secure detection (FSBD) technique to ensure the forward-backward secrecy of the signing keys. Security analysis and experimental results demonstrate that the proposed scheme can achieve forward-backward security of user's electricity consumption signature. Compared with related schemes, our scheme is more secure and efficient.

• 정보처리학회논문지C
• /
• 제14C권2호
• /
• pp.123-128
• /
• 2007

인터넷을 통해 제공되는 다양한 서비스의 보호를 위해 각각의 시스템들은 Public Key Infrastructure (PKI)를 널리 사용하고 있다. 그러나 PKI의 사용에는 여러 가지 문제점이 여전히 존재한다. 그러한 문제 중 하나가 일부 서비스들은 공개키 인증서의 즉각적인 검증을 필요로 하지만 PKI는 이와 같은 요구를 만족시키지 못한다는 것이다. 이러한 문제를 해결하기 위하여 Boneh를 비롯한 몇몇 연구자들이 중재자를 이용한 RSA 전자 서명기법 (mRSA)이라는 개념을 처음 도입하였다. 또한, Gene Tsudik은 초기 mRSA의 취약점을 개선하여 ‘약한’ 전방향 안전성을 갖는 새로운 mRSA을 제안하였다. 본 논문에서는 약한 전방향 안전성 개념의 실제 적용에 따른 취약성을 분석하고 강한 전방향 안전성을 갖는 새로운 mRSA를 제안한다.

• Journal of information and communication convergence engineering
• /
• 제7권4호
• /
• pp.521-524
• /
• 2009

Park proposed a forward & backward Secure key management scheme in wireless sensor networks for Process Control Systems (PCSs) or Supervisory Control and Data Acquisition (SCADA) systems [7]. The scheme, however, is still vulnerable to an attack called "sandwich attack": two nodes captured at times $t_1$ and $t_2$, respectively, surrenders all the group keys used between times $t_1$ and $t_2$. In this paper, we propose a fix to the scheme, which can limit the vulnerable time duration to an arbitrarily chosen time span while keeping the forward and backward secrecy of the scheme untouched.