Efficient authenticated encryption schemes with public verifiability
Guilin Feng, Feng Bao, Changshe Ma, Keifei Chen
Abstract
Guilin Feng, Feng Bao, Changshe Ma, Keifei Chen
Abstract
An authenticated encryption scheme allows messages to be encrypted and authenticated simultaneously. C. Ma and K. Chen proposed such a scheme with public verifiability (see Electronics Letters, vol.39, no.3 p.281-2, 2003). That is, in their scheme, the receiver can efficiently prove to a third party that a message has indeed originated from a specific sender. We first identify two security weaknesses in the Ma-Chen authenticated encryption scheme. Then, based on the Schnorr signature, we proposed an efficient and secure improved scheme such that all the desired security requirements are satisfied.
OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An authenticated encryption scheme allows messages to be encrypted and authenticated simultaneously. C. Ma and K. Chen proposed such a scheme with public verifiability (see Electronics Letters, vol.39, no.3 p.281-2, 2003). That is, in their scheme, the receiver can efficiently prove to a third party that a message has indeed originated from a specific sender. We first identify two security weaknesses in the Ma-Chen authenticated encryption scheme. Then, based on the Schnorr signature, we proposed an efficient and secure improved scheme such that all the desired security requirements are satisfied.
Key concepts: Authenticated encryption, Computer science, Communication source, Encryption, Scheme (mathematics), Computer security, Public-key cryptography, Computer network