<?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">inf14403</article-id><article-id pub-id-type="doi">10.15388/Informatica.2003.033</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Convertible Authenticated Encryption Scheme Without Using Conventional One‐Way Function</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Chien</surname><given-names>Hung‐Yu</given-names></name><email xlink:href="mailto:redfish6@ms45.hinet.net">redfish6@ms45.hinet.net</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Department of Information Management, Chaoyang University of Technology, Taichung, Taiwan, ROC</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>2003</year></pub-date><volume>14</volume><issue>4</issue><fpage>445</fpage><lpage>454</lpage><history><date date-type="received"><day>01</day><month>01</month><year>2003</year></date></history><abstract><p>An authenticated encryption allows the designated recipient to verify the authenticity while recovering the message. To protect the recipient's benefit in case of a later dispute, a convertible authenticated encryption scheme allows the recipient to convert the authenticated encryption into an ordinary signature so that it becomes a publicly verifiable. This paper shows a universal forgery attack on Araki et al.'s convertible authenticated encryption scheme, and proposes a new convertible authenticated encryption scheme. Without using any conventional one‐way function, the proposed scheme simplifies its security assumption on only a public hard problem – the discrete logarithm problem.</p></abstract><kwd-group><label>Keywords</label><kwd>authenticated encryption</kwd><kwd>discrete logarithm</kwd><kwd>one‐way function</kwd></kwd-group></article-meta></front></article>