<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">inf17303</article-id><article-id pub-id-type="doi">10.15388/Informatica.2006.142</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Provably Secure Convertible User Designating Confirmer Partially Blind Signatures</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Huang</surname><given-names>Zhenjie</given-names></name><email xlink:href="mailto:zjhuang@stju.edu.cn">zjhuang@stju.edu.cn</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/><xref ref-type="aff" rid="j_INFORMATICA_aff_001"/><xref ref-type="aff" rid="j_INFORMATICA_aff_002"/><xref ref-type="aff" rid="j_INFORMATICA_aff_003"/></contrib><contrib contrib-type="Author"><name><surname>Chen</surname><given-names>Kefei</given-names></name><email xlink:href="mailto:kfchen@stju.edu.cn">kfchen@stju.edu.cn</email><xref ref-type="aff" rid="j_INFORMATICA_aff_004"/></contrib><contrib contrib-type="Author"><name><surname>Wang</surname><given-names>Yumin</given-names></name><email xlink:href="mailto:ymwang@xidian.edu.cn">ymwang@xidian.edu.cn</email><xref ref-type="aff" rid="j_INFORMATICA_aff_005"/></contrib><aff id="j_INFORMATICA_aff_000">Department of Computer Science and Engineering, Zhangzhou Normal University, Fujian, 363000, P. R. China</aff><aff id="j_INFORMATICA_aff_001">State Key Laboratory of Information Security, Institute of Software of Chinese Academy of Sciences, Beijing 100080, P. R. China</aff><aff id="j_INFORMATICA_aff_002">Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200030, P. R. China</aff><aff id="j_INFORMATICA_aff_003">State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, Shaanxi, 710071, P. R. China</aff><aff id="j_INFORMATICA_aff_004">Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200030, P. R. China</aff><aff id="j_INFORMATICA_aff_005">State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, Shaanxi, 710071, P. R. China</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>2006</year></pub-date><volume>17</volume><issue>3</issue><fpage>347</fpage><lpage>362</lpage><history><date date-type="received"><day>01</day><month>01</month><year>2005</year></date></history><abstract><p>This paper introduces a new concept of convertible user designating confirmer partially blind signature, in which only the designated confirmer (designated by the user) and the user can verify and confirm the validity of given signatures and convert given signatures into publicly verifiable ones. We give a formal definition for it and propose a concrete provably secure scheme with a proof of security and a brief analysis of efficiency. Assuming the intractabilities of the Discrete Logarithm Problem and the ROS-Problem, the proposed scheme is unforgeable under adaptive chosen-message attack.</p></abstract><kwd-group><label>Keywords</label><kwd>cryptography</kwd><kwd>digital signature</kwd><kwd>partially blind signature</kwd><kwd>user designating confirmer signature</kwd><kwd>convertible</kwd></kwd-group></article-meta></front></article>