The efficient multipurpose convertible undeniable signature scheme

被引:0
|
作者
Yun, SH
Lee, HW
机构
[1] Cheonan Univ, Div Informat & Commun Engn, Cheonan 330704, South Korea
[2] Hanshin Univ, Dept Software, Osan 447791, Gyunggi, South Korea
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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[4]. It also reduces the number of communication steps of the signature confirmation protocol.
引用
收藏
页码:325 / 331
页数:7
相关论文
共 50 条
  • [21] An Efficient Construction of Convertible Undeniable Proxy Signatures
    Wu, Wei
    Mu, Yi
    Susilo, Willy
    Huang, Xinyi
    Xu, Li
    [J]. JOURNAL OF INTERNET TECHNOLOGY, 2014, 15 (03): : 471 - 484
  • [22] Efficient Convertible Undeniable Signatures with Delegatable Verification
    Schuldt, Jacob C. N.
    Matsuura, Kanta
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (01) : 71 - 83
  • [23] Convertible Undeniable Partially Blind Signature from Bilinear Pairings
    Koide, Atsushi
    Tso, Raylin
    Okamoto, Eiji
    [J]. EUC 2008: PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING, VOL 2, WORKSHOPS, 2008, : 77 - +
  • [24] The Insecurity of a Certificateless Undeniable Signature Scheme
    Behnia, Rouzbeh
    Heng, Swee-Huay
    [J]. 2016 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC), 2016, : 582 - 587
  • [25] Undeniable Threshold Proxy Signature Scheme
    Aboud, Sattar J.
    Yousef, Sufian
    Cole, Mike
    [J]. 2013 5TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (CSIT), 2013, : 150 - 153
  • [26] Revocable anonymity of undeniable signature scheme
    Yeung, WKY
    Han, S
    [J]. INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING, 2003, 2690 : 76 - 83
  • [27] An undeniable signature scheme based on lattice
    [J]. Li, S. (lishuang@th.btbu.edu.cn), 1600, Advanced Institute of Convergence Information Technology (04):
  • [28] The Biometric Based Convertible Undeniable Multi-Signature Scheme to Ensure Multi-Author Copyrights and Profits
    Yun, SungHyun
    Lim, Heuiseok
    Jeong, Young-Sik
    Jung, SoonYoung
    Chang, Jae-Khun
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2011, 60 (03) : 405 - 418
  • [29] Optimization of the MOVA undeniable signature scheme
    Monnerat, J
    Oswald, YA
    Vaudenay, S
    [J]. PROGRESS IN CRYPTOLOGY - MYCRYPT 2005, 2005, 3715 : 196 - 209
  • [30] New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
    Phong, Le Trieu
    Kurosawa, Kaoru
    Ogata, Wakaha
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2010, E93A (01) : 63 - 75