Convertible multi-authenticated encryption scheme

Wu, Tsan-Ming; Hsu, Chien-Lung; Tsai, Kuo-Yu; Lin, Han-Yu; Wu, Tzong‐Chen

doi:10.1016/j.ins.2007.06.011

Cited by 23 publications

(21 citation statements)

References 32 publications

(24 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the following, we prove that the proposed protocol meets security requirements in terms of confidentiality and unforgeability using the same way as Ref. [10] and discuss the nature of other security.…”

Section: Securitymentioning

confidence: 83%

A broadcast signcryption protocol for ad hoc networks

Wang

Yao

Liao

2011

Wuhan Univ. J. Nat. Sci.

View full text Add to dashboard Cite

Many previous broadcast encryption schemes can only guarantee confidentiality but cannot verify integrity and authenticity for broadcast messages. In this paper, a broadcast signcryption protocol for ad hoc networks is proposed based on cluster-based structure. The proposed protocol not only guarantees confidentiality but also verifies integrity and authenticity for broadcast messages. More importantly, the proposed scheme enables the cluster head to robustly add or remove any cluster member without changing secret key of other cluster members. Moreover, the proposed protocol avoids massive message exchange for key setup among cluster members. The analysis of security and performance shows that the proposed protocol is secure, efficient, and more practical protocol for ad hoc networks. IntroductionBroadcast encryption allows the data provider or the broadcast center to encrypt a message for a subset of users called the privileged users, and only the user in subset can use his private key to decrypt it. It has a wide range of applications, including pay-TV, content protection, secure audio streaming, and Internet multicasting. In 1993, Fiat and Naor [1] first proposed the concept of broadcast encryption and a broadcast encryption protocol. From then, broadcast encryption has received much attention, and many broadcast encryption protocols have been proposed [2][3][4][5][6][7] . Mu and Vmdharajan [2] proposed a robust and secure broadcasting scheme, which achieved some significant breakthrough in the revocation of decryption keys used to a secure broadcasting service and in computational efficiency. However, their schemes cannot securely remove subscribers and there exists data redundancy. Zhang et al [3] proposed a novel dynamic key management scheme for secure multicasting based on Ref.[2] and a novel hybrid key distribution scheme. They also claimed that their scheme allows efficient mechanisms for group members to join and leave a group frequently, but their scheme shows the same disadvantages as Ref. [2], that is, their scheme cannot securely remove subscribers. Daza et al [4] proposed an ad hoc threshold broadcast encryption scheme. In their scheme, a sender chooses (ad hoc) a set of n receivers and a threshold t and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. Guo et al [5] and Hu et al [6] respectively proposed an identity-based broadcast encryption scheme.

show abstract

Section: Securitymentioning

confidence: 83%

A broadcast signcryption protocol for ad hoc networks

Wang

Yao

Liao

2011

Wuhan Univ. J. Nat. Sci.

View full text Add to dashboard Cite

show abstract

“…In 2008, Wu et al, [9] elaborated on the merits of the CAE and the multisignature schemes to propose a convertible multi-authenticated encryption (CMAE) scheme for group-oriented applications based on the computational Diffie-Hellman problem (CDHP). Their scheme allows a group of signers to cooperatively produce a valid authenticated encryption signature and still preserves the characteristic of CAE schemes.…”

Section: Introductionmentioning

confidence: 99%

A Robust Convertible Multi-Authenticated Encryption Scheme with One-Way Hash Function

Lu¹,

Hsu²,

Lin³

et al. 2014

IJFCC

View full text Add to dashboard Cite

Abstract-A convertible multi-authenticated encryption (CMAE) scheme allows a group of signers to cooperatively produce a valid authenticated encryption signature and still preserves the characteristic of convertible authenticated encryption (CAE) schemes. In 2008, Tsai proposed a CMAE scheme based on the intractability of one-way hash functions and discrete logarithms. However, we find that Tsai's scheme cannot provide the semantic security of the message and the computational efficiency of this scheme is rather high. In this paper, we propose a secure CMAE scheme, in which it enhances the semantic security of the message to overcome the defect in Tsai's scheme. Moreover, by compared with Tsai's scheme, the performance of the proposed scheme is more efficient than Tsai's in term of computational complexity.

show abstract

“…Their scheme is provably secure in the random oracle model. So far, lots of related works [2,3,8,9,12,14,17] have been proposed.…”

Section: Introductionmentioning

confidence: 99%