• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.83-91
• /
• 2005

The digital signature can be verified and disavowed only with cooperation of the signer in 'undeniable signature scheme. A signed confidential document of a company can be copied and delivered to a rival company. If a conventional signature scheme is used to sign the document, it can be confirmed as authentic by verifying the signature without the signer's cooperation. However, if the company doesn't want the document to be verified as authentic by the rival company, it is recommended to use the undeniable signature scheme. Convertible undeniable signature scheme has additional property that the signer can convert undeniable signature to the ordinary one. The document signed by undeniable signature scheme that is no longer confidential can be opened to public use by converting the signature to the ordinary one. In this study, the efficient multipurpose convertible undeniable signature scheme based on El-Gamal signature scheme is proposed. The proposed scheme satisfies undeniable property and can convert undeniable signature to the ordinary one. The number of public keys and signatures are less than those of Boyar's convertible signature scheme. It also reduces the number of communication steps of the signature confirmation protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.870-879
• /
• 1997

At crypto'89 meeting, D. chaum suggested an undeniable signature scheme. Undeniable signatures are verified via a protocol between the signer and verifier, so the cooperation of the signer is necessary. So far, ther have been several variants of undeniable signatures to obtain a signature scheme, which can control the abous of ordinary digital signatures. In this paper we integrate these variants into a generalized undeniable-type signature scheme. Also, it will be pointed out, that undeniable signature schemes but its first realization are vulnerable in full view of eavesdropping third party. Moreover, to solve this problem, we propose a new type of digital signature, called "result-indisting-uishable undeniable signature" and construct a practical protocol that implements it.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2001.11a
• /
• pp.195-201
• /
• 2001

D. Chaum이 제안한 Undeniable Signatures[1]을 시작으로 undeniable signature에 대한 많은 scheme이 제안되었다. 일반적인 전자 서명에서는 누구나 검증을 할 수 있는데 비해, undeniable signature를 검증하기 위해서는 서명자의 협동이 필수적이다. 한편 confirmor를 따로 지정해서 confirmor에게 서명 검증 능력을 부여할 수 있는 Designated Confirmor Signatures[4]가 제안되었다. 본 논문에서는 T. Miyazaki가 제안한 RSA-Based Convertible Undeniable Signature Scheme[6]을 변형하여, Designated Confirmer Undeniable Signature System Based on RSA를 제안하고, 제안된 프로토콜을 분석한다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1994.11a
• /
• pp.45-50
• /
• 1994

대화형 영지식 증명시스템을 사용하여 D. Chaum의 undeniable signature에 대한 거짓말 탐지기 기능 문제를 해결한 안전성이 증명된 의뢰 undeniable signature 방식을 제안한다. 제안한 방식의 안전성은 영지식 대화형 증명시스템과 고차잉여류 문제에 기반을 두고 있다.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.55-63
• /
• 2005

In undeniable digital signature scheme, the signature can not be verified without the signer's cooperation. The undeniable signature scheme can be used to computerize many applications which can not be done by a conventional digital signature scheme. In this study, we propose the undeniable digital multi-signature scheme which requires many signers and designated verifier The multi-signature can be verified only in cooperation with all signers. The proposed scheme satisfies undeniable property and it is secure against active attacks such as modification and denial of the multi-signature by signers. We also propose copyright protection method of co-authored digital contents as an application of the proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1266-1273
• /
• 1996

The nice concept of undeniable signatures was presented by Chaum and van Antwerpen. Briefly, an undeniable signature is signature which cannot be verified withoug the help of the signer. They are therefore less personal than ordinary signatures in the sense that a signature cannot be related to the signer without his help. On the other hand, the signer can only repudiate an alleged signature by proving that it is incorrect. Boyar, Chaum, damgard and Pedersen introduce convertible undeniable signatures. In this schemes, release of a single bit string by the signer turns all of his signatures, which were originally undeniable signatures, into ordinary digital signatures. And, S.J.Kim, S.J.Park and D.H.Won propose a new kind of signature scheme, called "nominative signatures:, that is the dual scheme of undeniable signatures. nominative signatures acheieve theses objectives:Only nominee can verify the nominator(signer)' signature and if necessary, only nominee can prove to the third party that the signature is issued to him(her) and is valid. In this paper we present an efficient integrated system of nominative signatures and (convertible) undeniable signatures. i.e. we show how nominative signature scheme can be changed into a (convertible) undeniable signatures.ures.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.261-267
• /
• 2004

In undeniable digital signature scheme, the signature can not be verified without the signer's cooperation. The undeniable signature scheme can be used to computerize many applications which can not be done by a conventional digital signature scheme. In this study, we propose the undeniable digital multi-signature scheme which requires many signers and designated verifier. The multi-signature can be verified only in cooperation with all signers. The proposed scheme satisfies undeniable property and it is secure against active attacks such as modification and denial of the multi-signature by signers. We also discuss practical applications such as joint copyright protection on digital contents.

• The Journal of Korean Association of Computer Education
• /
• v.8 no.4
• /
• pp.97-105
• /
• 2005

In this study, the undeniable digital multi-signature scheme based on the discrete logarithms is proposed. The proposed multi-signature scheme satisfies undeniability and is secure against active attacks such as fabrication and denial of multi-signature by signers. It is suitable for electronic election scheme in which several administrators are required. Especially in case of dispute among voters and administrators, the proposed scheme can resolve it due to the undeniable property. It can provide fair electronic election by minimizing the role of voting center, and can enable user-oriented electronic election.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1512-1532
• /
• 2013

A convertible undeniable signature requires a verifier to interact with the signer to verify a signature and furthermore allows the signer to convert a valid one to publicly verifiable signature. In 2007, Yuen et al. proposed a convertible undeniable signature without random oracles in pairings. However, it is recently shown that Yuen et al.'s scheme is not invisible for the standard definition of invisibility. In this paper, we propose a new improvement by using extended Euclidean algorithm that can overcome the visibility attack. The proposed scheme has been evaluated based on computation and communication complexities and the performance comparisons of Yuen et al.'s scheme and various convertible undeniable signature schemes are provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication times significantly.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.2
• /
• pp.87-95
• /
• 1996

This paper presents a (k,n) threshold digital signature scheme with no trusted dealer. Our idea is to use the EIGamal signature scheme modified for group use. Among many digital signature schemes, our modification has a nice property for our purpose. We also show a (k.n) threshold fail stop signature scheme and two (k.n) threshold undeniable signature schemes. We use [10] as the original fail stop signature scheme, and use [3] and [2] as the original undeniable signature schemes. Since all these schemes are based on the discrete log problem, we can use the same technique.