WCSE

A New Convertible Authenticated Encryption Scheme Based on Bilinear Square Diffie-Hellman Problem

Abstract— Convertible authenticated encryption (CAE) scheme is a cryptographic scheme which has been found numerous practical applications like on-line credit card transactions, confidential contract signing and the protection of digital evidence, etc. In this paper, we propose a new CAE scheme based on the bilinear square Diffie-Hellman problem. The proposed scheme is proved secure against adaptive chosen-plaintext attacks (CPA2) and adaptive chosen-message attacks (CMA) in the random oracle mode. Compared with previous schemes, ours not only provides better functionalities, but also has provable security.

Index Terms— convertible, authenticated encryption, digital signature, bilinear pairings, random oracle

Han-Yu Lin
Department of Computer Science and Engineering, National Taiwan Ocean University, TAIWAN

[Download]

Cite: Han-Yu Lin, "A New Convertible Authenticated Encryption Scheme Based on Bilinear Square Diffie-Hellman Problem," Proceedings of 2016 6th International Workshop on Computer Science and Engineering, pp. 355-358, Tokyo, 17-19 June, 2016.