Chebyshev polynomials are used as a reservoir for generating intricate classes of symmetrical and chaotic pattems, and have been used in a vast anaount of applications. Using extended Chebyshev polynomial over finite ...Chebyshev polynomials are used as a reservoir for generating intricate classes of symmetrical and chaotic pattems, and have been used in a vast anaount of applications. Using extended Chebyshev polynomial over finite field Ze, Algehawi and Samsudin presented recently an Identity Based Encryption （IBE） scheme. In this paper, we showed their proposal is not as secure as they chimed. More specifically, we presented a concrete attack on the scheme of Algehawi and Samsudin, which indicated the scheme cannot be consolidated as a real altemative of IBE schemes since one can exploit the semi group property （bilinearity） of extended Chebyshev polynomials over Zp to implement the attack without any difficulty.展开更多
In order to support the dynamics of the privileged users with low computation, communica- tion and storage overheads in receivers, a secure broadcast encryption scheme for ad hoc networks based on cluster-based struct...In order to support the dynamics of the privileged users with low computation, communica- tion and storage overheads in receivers, a secure broadcast encryption scheme for ad hoc networks based on cluster-based structure is proposed, as Mu-Vmdharajan＇s scheme cannot securely remove subscribers with data redundancy. In the proposed scheme, we employ polynomial function and filter functions as the basic means of constructing broadcast encryption procedure in order to reduce computation and shortage overhead. Compared with existing schemes, our scheme requires low computation, corrmaunication and storage over- heads in receivers and can support the dynamics of the privileged users. Furthermore, our scheme can avoid n^assive message to exchange for estab-fishing the decryption key between members of the cluster. The analysis of security and perforrmnce shows that our scheme is more secure than Mu- Vmdharajan＇s scheme and has the same speed of encryption and decryption as theirs. So our scheme is particularly suitable for the devices with low power setting such as ad hoc networks.展开更多
基金Acknowledgements The authors would like to thank the reviewers for their detailed reviews and constructive comments, which have helped improve the quality of this paper. This work was partically supported by National Natural Science Foundation of China under Crants No. 61172085, No. 61103221, No. 61133014, No. 11061130539 and No. 61021004.
文摘Chebyshev polynomials are used as a reservoir for generating intricate classes of symmetrical and chaotic pattems, and have been used in a vast anaount of applications. Using extended Chebyshev polynomial over finite field Ze, Algehawi and Samsudin presented recently an Identity Based Encryption （IBE） scheme. In this paper, we showed their proposal is not as secure as they chimed. More specifically, we presented a concrete attack on the scheme of Algehawi and Samsudin, which indicated the scheme cannot be consolidated as a real altemative of IBE schemes since one can exploit the semi group property （bilinearity） of extended Chebyshev polynomials over Zp to implement the attack without any difficulty.
基金This paper was supported in part by the National Natural Sci-ence Foundation of China under Crant No.61070164 the Science and Technology Planning Project of Guangdong Province, China under Crants No. 201013010600025, No. 2010A032000002 the Nat-ural Science Foundation of Guangdong Province, China under Ca-ant No. 815106 32010000022.
文摘In order to support the dynamics of the privileged users with low computation, communica- tion and storage overheads in receivers, a secure broadcast encryption scheme for ad hoc networks based on cluster-based structure is proposed, as Mu-Vmdharajan＇s scheme cannot securely remove subscribers with data redundancy. In the proposed scheme, we employ polynomial function and filter functions as the basic means of constructing broadcast encryption procedure in order to reduce computation and shortage overhead. Compared with existing schemes, our scheme requires low computation, corrmaunication and storage over- heads in receivers and can support the dynamics of the privileged users. Furthermore, our scheme can avoid n^assive message to exchange for estab-fishing the decryption key between members of the cluster. The analysis of security and perforrmnce shows that our scheme is more secure than Mu- Vmdharajan＇s scheme and has the same speed of encryption and decryption as theirs. So our scheme is particularly suitable for the devices with low power setting such as ad hoc networks.
