EFFICIENT CONVERTIBLE MULTI-AUTHENTICATED ENCRYPTION SCHEME WITHOUT MESSAGE REDUNDANCY OR ONE-WAY HASH FUNCTION

檔案

本條目沒有附加檔案。

日期

2010-09-01

類型

期刊名稱

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL

卷期與頁次

第 6 卷第 9 期,頁 3843–3852

ISSN

1349-4198

語言

英文

摘要

A convertible multi-authenticated encryption (CMAE) scheme providing confidentiality, authenticity and non-repudiation properties allows a designated recipient to recover and verify an authenticated message which is signed by multiple signers. The recipient has the ability to further prove the dishonesty of signers to any third party if they repudiate their signature latter. In 2008, Wu et al. first proposed a CMAE scheme based on. discrete logarithms, but the computational complexity of their scheme is rather high and the message redundancy is required. To improve the performance and remove the message redundancy, Tsai adopted one-way hash functions (such as MD5) to propose a new scheme. In 2005, however, MD5 was cracked by Wang and Yu, which indicates that the schemes using one-way hash functions might turn out to be vulnerable to such an attack. This paper proposes a new efficient CMAE scheme. Neither the one-way hash, function nor the message redundancy is employed in the proposed scheme. The scheme not only preserves the advantages of Wu et al. 's, but also outperforms their scheme. With low computational cost, our proposed scheme can be practically implemented.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Tsai, J.-L., Wu, T.-S., Lin, H.-Y., & Lee, J.-E. (2010). EFFICIENT CONVERTIBLE MULTI-AUTHENTICATED ENCRYPTION SCHEME WITHOUT MESSAGE REDUNDANCY OR ONE-WAY HASH FUNCTION. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 6(9), 3843–3852. https://ir.lib.nycu.edu.tw/handle/11536/32217

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/32217