﻿<?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">1822-8844</issn>
			<issn pub-type="ppub">0868-4952</issn>
			<issn-l>0868-4952</issn-l>
			<publisher>
				<publisher-name>Vilnius University Institute of Mathematics and Informatics</publisher-name>
				<publisher-loc>Akademijos 4, LT-08663 Vilnius, Lithuania</publisher-loc>
			</publisher>
		</journal-meta>
		<article-meta>
			<article-id pub-id-type="publisher-id">INFO578</article-id>
			<article-id pub-id-type="doi">10.15388/Informatica.2005.088</article-id>
			<article-categories>
				<subj-group subj-group-type="heading">
					<subject>Research Article</subject>
				</subj-group>
			</article-categories>
			<title-group>
				<article-title>An Improvement of the Ateniese’s Verifiable Encryption Protocol</article-title>
			</title-group>
			<contrib-group>
				<contrib contrib-type="author">
					<name>
						<surname>Popescu</surname>
						<given-names>Constantin</given-names>
					</name>
					<email xlink:href="mailto:cpopescu@uoradea.ro">cpopescu@uoradea.ro</email>
					<xref ref-type="aff" rid="j_info578_aff_001"/>
					<xref ref-type="fn" rid="j_info578_fn_001">*</xref>
				</contrib>
				<aff id="j_info578_aff_001">Department of Mathematics, <institution>University of Oradea</institution>, Str. Armatei Romane 5, Oradea, <country>Romania</country>
				</aff>
			</contrib-group>
			<author-notes>
				<fn id="j_info578_fn_001">
					<label>*</label>
					<p>The author is presently at “Centre for Quantifiable Quality of Service in Communication Systems” (Q2S), NTNU, Trondheim, Norway. The centre is appointed Centre of Excellence by The Research Council of Norway. It is financed by the Research Council, NTNU and UNINETT, and supported by Telenor.</p>
				</fn>
			</author-notes>
			<pub-date pub-type="ppub">
				<year>2005</year>
			</pub-date>
			<volume>16</volume>
			<issue>1</issue>
			<fpage>121</fpage>
			<lpage>130</lpage>
			<history>
				<date date-type="received">
					<day>1</day>
					<month>11</month>
					<year>2003</year>
				</date>
			</history>
			<permissions>
				<copyright-statement>© 2005 Institute of Mathematics and Informatics, Vilnius</copyright-statement>
				<copyright-year>2005</copyright-year>
				<license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
					<license-p>Open access article under the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/">CC BY</ext-link> license.</license-p>
				</license>
			</permissions>
			<abstract>
				<p>Verifiable encryption is a primitive that can be used to build extremely efficient fair exchange protocols where the items exchanged represent digital signatures. Such protocols may be used to digitally sign contracts on the Internet. This paper presents an efficient protocol for verifiable encryption of digital signatures that improves the security and efficiency of the verifiable encryption scheme of Ateniese. Our protocol can be applied to group signatures, key escrow and publicly verifiable secret and signature sharing to prove the fairness.</p>
			</abstract>
			<kwd-group>
				<label>Key words</label>
				<kwd>cryptographic protocols</kwd>
				<kwd>verifiable encryption</kwd>
				<kwd>security</kwd>
				<kwd>digital signatures</kwd>
			</kwd-group>
		</article-meta>
	</front>
</article>