• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.512-518
• /
• 2000

Self-certified public keys, introduced by Girault allow the authenticity of public keys to be verified implicitly during the use of the keys. This paper first presents new concept of verifiable self-certified public keys and provides concrete examples satisfying our conditions. Verifiable self-certified public keys combine the benefit of certification-based schemes and Girault's self-certified public keys. Furthermore, we also cryptanalyze Petersen's pseudonymous self-certified keys and present the more secure protocol.

• Review of KIISC
• /
• v.3 no.3
• /
• pp.80-85
• /
• 1993

다른 가입자가 특정 가입자의 공개키를 인증하기 위한 분리된 certificate가 필요하지 않은 공개키 개념인 self-certified 공개키의 개념을 소개한다. Self-certified 공개키 개념은 공개키 방식 (public key schemes) 에서 저장공간과 계산량을 감소시킬 수 있으며, 비밀키는 가입자 자신이 직접 선택할 수 있으며, 센터에게는 비밀로 할 수 있다. 센터와 가입자가 공개키ㅡ 계산하는 전략은 공개키자체에 certificate를 삽입하여 certificate를 별도로 취하지 않는 것이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.25-34
• /
• 2005

Girault proposed a key agreement protocol based on his new idea of self-certified public key. Later Rueppel and Oorschot showed variants of the Girault scheme. All of these key agreement protocols inherit positive features of self-certified public key so that they can provide higher security and smaller communication overhead than key agreement protocols not based on self-certified public key. Even with such novel features, rigorous security analysis of these protocols has not been made clear yet. In this paper, we give rigorous security analysis of key agreement protocols based on self-certified public key. We use reduction among functions for security analysis and consider several kinds of active attacker models such as active impersonation attack, key-compromise impersonation attack, forward secrecy and known key security.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.4
• /
• pp.61-70
• /
• 1999

In this paper we propose the verifiable self-certified schemes(key distribution scheme identification scheme digital signature scheme) based on ${\gamma}$th -residuosity which make up for defects of Girault's self-certified schemes allow the authenticity of public keys to be verified during the use of the keys. The security of our schemes is based on the difficulty of ${\gamma}$th -residuosity problem and discrete logarithm problem simultaneously.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2722-2727
• /
• 1999

In this paper we propose verifiable self-certified identification and key distribution protocols which has advantages of certificate-based scheme and Girault's self-certified public key. The security of the proposed protocols is based on ${\gamma}$\ulcorner-residuosity problem and discrete logarithm problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.1157-1177
• /
• 2014

Convertible authenticated encryption (CAE) schemes enable the signer to send a confidential message and its corresponding signature to the designated recipient. The recipient can also convert the signature into a conventional one which can be verified by anyone. Integrating the properties of self-certified public key systems, this paper presents efficient and computationally indistinguishable self-certified CAE schemes for strengthening the security of E-Commerce applications. Additionally, we also adapt the proposed schemes to elliptic curve systems for facilitating the applications of limited computing power and insufficient storage space. The proposed schemes are secure against known existential active attacks, satisfy the semantic security requirement, and have the following advantages: (i) No extra certificate is required since the tasks of authenticating the public key and verifying the signature can be simultaneously carried out within one step, which helps reducing computation efforts and communication overheads. (ii) In case of a later dispute, the recipient can convert the signature into an ordinary one for the public arbitration. (iii) The signature conversion can be solely performed by the recipient without additional computation efforts or communication overheads. (iv) The recipient of the signature can prove himself, if needed, to anyone that he is actually the designated recipient.

• The Journal of Asian Finance, Economics and Business
• /
• v.8 no.8
• /
• pp.583-592
• /
• 2021

This study examines social identity and self-identity as the antecedents of the theory of planned behavior (TPB) model in predicting purchase intention of certified coffee, whereas perceived trustworthiness (PT) is evaluated whether it directly affects intention and/or indirectly through attitude. In addition, ethics and luxury are investigated as the salient beliefs affecting attitude formation in this regard. A face-to-face survey was conducted with 727 coffee consumers in Thailand. Confirmatory factor analysis is applied to assess the adequacy of the model, followed by structural equation modeling to evaluate the hypotheses proposed for the relationships between constructs in an extended TPB model. The results confirm that self-identity is the most influential antecedent on attitude when compared to social identity, and attitude, in turn, is the strongest determinant in predicting purchase intention. PT has a direct positive effect on purchase intention, meanwhile, ethical, luxury beliefs, and PT are confirmed to portrait the attitude formation. As such the marketing campaigns can address manipulating consumers' beliefs on both ethical and luxury aspects as well as PT, along with consumers' social identity and self-identity to fortify a positive attitude toward certified coffee. Then the actual purchase behavior can be foreseen based on empirical evidence.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.4
• /
• pp.71-84
• /
• 2003

Self-certified public keys need not be accompanied with a separate certificate to be authenticated by other users because the public keys are computed by both the authority and the user. At this point, verifiable self-certified public keys are proposed that can determine which is wrong signatures or public keys if public keys are used in signature scheme and then verification of signatures does not succeed. To verify these public keys, key generation center's public key trusted by users is required. If all users trust same key generation center, public keys can be verified simply. But among users in different domains, rusty relationship between two key generation centers must be accomplished. In this paper we propose inter-domain verifiable self-certified public keys that can be verified without certificate between users under key generation centers whose trusty relationship is accomplished. Also we present the execution of signature and key distribution between users under key generation centers use different public key parameters.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2894-2902
• /
• 2000

In this paper, for authentication service of electronic commerce, we propose the verifiable self-certified schemes based on the $\gamma^{th}$-residuosity, thich are combine the benefit of certifiction based schemes and Girault's self-certified public keys. The security of our schemes is based on the difficulty of $\gamma^{th}$-residuosity problem and discrete logarithm problem simultaneously.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.1051-1069
• /
• 2016

Combining the concept of self-certified public key and message recovery, Li-Zhang-Zhu (LZZ) gives the proxy signature scheme with message recovery using self-certified public key. The security of the proposed scheme is based on the discrete logarithm problem (DLP) and one-way hash function (OWHF). Their scheme accomplishes the tasks of public key verification, proxy signature verification, and message recovery in a logically single step. In addition, their scheme satisfies all properties of strong proxy signature and does not use secure channel in the communication between the original signer and the proxy signer. In this paper, it is shown that in their signature scheme a malicious signer can cheat the system authority (SA), by obtaining a proxy signature key without the permission of the original signer. At the same time malicious original signer can also cheat the SA, he can also obtain a proxy signature key without the permission of the proxy signer. An improved signature scheme is being proposed, which involves the remedial measures to get rid of security flaws of the LZZ et al.'s. The security and performance analysis shows that the proposed signature scheme is maintaining higher level of security, with little bit of computational complexity.