<?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">INF11203</article-id>
			<article-id pub-id-type="doi">10.3233/INF-2000-11203</article-id>
			<article-categories>
				<subj-group subj-group-type="heading">
					<subject>Research article</subject>
				</subj-group>
			</article-categories>
			<title-group>
				<article-title>A Secure Nonrepudiable Threshold Proxy Signature Scheme with Known Signers</article-title>
			</title-group>
			<contrib-group>
				<contrib contrib-type="Author">
					<name>
						<surname>Hwang</surname>
						<given-names>Min-Shiang</given-names>
					</name>
					<email xlink:href="mailto:mshwang@mail.cyut.edu.tw">mshwang@mail.cyut.edu.tw</email>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
				</contrib>
				<contrib contrib-type="Author">
					<name>
						<surname>Lin</surname>
						<given-names>Iuon-Chang</given-names>
					</name>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
				</contrib>
				<contrib contrib-type="Author">
					<name>
						<surname>Lu</surname>
						<given-names>Eric Jui-Lin</given-names>
					</name>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
				</contrib>
				<aff id="j_INFORMATICA_aff_000">Department of Information Management, Chaoyang University of Technology, 168, Gifeng E. Rd., Wufeng, Taichung County, Taiwan 413, R.O.C.</aff>
			</contrib-group>
			<pub-date pub-type="epub">
				<day>01</day>
				<month>01</month>
				<year>2000</year>
			</pub-date>
			<volume>11</volume>
			<issue>2</issue>
			<fpage>137</fpage>
			<lpage>144</lpage>
			<history>
				<date date-type="received">
					<day>01</day>
					<month>12</month>
					<year>1999</year>
				</date>
			</history>
			<abstract>
				<p>In the (t,n) proxy signature scheme, the signature, originally signed by a signer, can be signed by t or more proxy signers out of a proxy group of n members. Recently, an efficient nonrepudiable threshold proxy signature scheme with known signers was proposed by H.-M. Sun. Sun's scheme has two advantages. One is nonrepudiation. The proxy group cannot deny that having signed the proxy signature. Any verifier can identify the proxy group as a real signer. The other is identifiable signers. The verifier is able to identify the actual signers in the proxy group. Also, the signers cannot deny that having generated the proxy signature. In this article, we present a cryptanalysis of the Sun's scheme. Further, we propose a secure, nonrepudiable and known signers threshold proxy signature scheme which remedies the weakness of the Sun's scheme.</p>
			</abstract>
			<kwd-group>
				<label>Keywords</label>
				<kwd>cryptography</kwd>
				<kwd>Lagrange interpolating polynomial</kwd>
				<kwd>proxy signature</kwd>
				<kwd>threshold proxy signature</kwd>
			</kwd-group>
		</article-meta>
	</front>
</article>