Full metadata record
DC FieldValueLanguage
dc.contributor.authorTsai, Jia-Lunen_US
dc.date.accessioned2014-12-08T15:09:45Z-
dc.date.available2014-12-08T15:09:45Z-
dc.date.issued2009-03-27en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.comcom.2008.12.009en_US
dc.identifier.urihttp://hdl.handle.net/11536/7462-
dc.description.abstractTo send the message to the recipient securely, authenticated encryption schemes were proposed. In 2008, Wu et al. [T.S, Wu, C.L. Hsu, K.Y. Tsai, H.Y. Lin, T.C. Wu. Convertible multi-authenticated encryption scheme, Information Sciences 178 (1) 256-263.] first proposed a convertible multi-authenticated encryption scheme based on discrete logarithms. However, the author finds that the computational complexity of this scheme is rather high and the message redundancy is used. To improve the computational efficiency and remove the message redundancy. the author proposes a new convertible multi-authenticated encryption scheme based oil the intractability of one-way hash functions and discrete logarithms. As for efficiency, the computation cost of the proposed scheme is smaller than Wu et al.'s scheme. (C) 2008 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectMulti-authenticated encryption schemeen_US
dc.subjectOne-way hash functionen_US
dc.subjectDiscrete logarithmsen_US
dc.titleConvertible multi-authenticated encryption scheme with one-way hash functionen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.comcom.2008.12.009en_US
dc.identifier.journalCOMPUTER COMMUNICATIONSen_US
dc.citation.volume32en_US
dc.citation.issue5en_US
dc.citation.spage783en_US
dc.citation.epage786en_US
dc.contributor.department數位內容製作中心zh_TW
dc.contributor.departmentCenter for Digital Content Productionen_US
dc.identifier.wosnumberWOS:000264910700001-
dc.citation.woscount12-
Appears in Collections:Articles


Files in This Item:

  1. 000264910700001.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.