Showing papers on "Authenticated encryption published in 1998"
1 Mar 1998
TL;DR: A new authenticated encryption scheme with (t, n) shared verification based on discrete logarithms is proposed that requires smaller bandwidth and achieves more secrecy of data transmission; it is more efficient for signature verification.
Abstract: A new authenticated encryption scheme with (t, n) shared verification based on discrete logarithms is proposed. In the scheme any ciphertext of signature for a message is addressed to a specified group of verifiers in such a way that the ability to decrypt the ciphertext of signature is regulated by the adopted (t, n) threshold scheme. That is, any t out of n verifiers in the group share the responsibility (or authority) for message recovery. The proposed scheme preserves the merits inherent in the signature scheme with message recovery and the (t, n) shared verification scheme. As compared to Harn's (t, n) shared verification scheme and its further modifications, the proposed scheme has the following advantages: it requires smaller bandwidth and achieves more secrecy of data transmission; it is more efficient for signature verification.
47 citations
TL;DR: The author combines Rabin's encryption with Rabin’s signature, and presents a new authenticated message encryption scheme based on the quadratic residue problem which can be realised efficiently and has lower communication costs.
Abstract: The Rabin public-key scheme is based on the difficulty of finding square roots modulo a composite number. The author combines Rabin's encryption with Rabin's signature, and presents a new authenticated message encryption scheme based on the quadratic residue problem which can be realised efficiently and has lower communication costs.
14 citations
1 Mar 1998
TL;DR: In this paper, a serious problem with two new schemes for authenticated encryption, called signcryption, are pointed out and a solution is outlined that helps to overcome the problem.
Abstract: In 1997, two new schemes for authenticated encryption, called signcryption, were proposed by Zheng. In the paper, the authors point out a serious problem with these schemes. In fact, the way to gain nonrepudiation violates the confidentiality. The authors compare the schemes to previously known authenticated encryption schemes which were not mentioned by Zheng. Finally, the authors outline a solution that helps to overcome the problem.