School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China

---

Abstract—With the development of information technology in distributed network, such as cloud computing and grid computing. They need mutual coordination resources among the various areas to meet the requirement in infinite speed and infinite space of information technology for people. To ensure secure access resources among areas, the paper proposes a cross-domain authentication allianceagreement. This agreement constructs a large prime group over elliptic curve, and uses direct product decomposition of the large prime group to construct multiple automorphism groups. Each automorphism group is made as a different key parameter in different domains to overcome the defect of key parameters consistency in the alliance-domain of the existing programs, and all the members must register with blinded keys in their domains to avoid the authority faking the members to cross-domain access resources of the existing programs, and uses the bilinear automorphism group for inter-domain signcrypt to achieve the crossdomain alliance certification, to overcome the complexity of certificate transmission and bottlenecks in the scheme of PKI-based. Analyses show that this scheme has anonymity, security and supporting mutual anonymous authentication.

Index Terms—inter-domain signcryption; alliancecertification; direct product decomposition; bilinear groups

[PDF]

Cite: Qikun Zhang, Jun Zheng, YuanTan, Ruifang Wang, Yuanzhang Li, "Cross-domain Authentication Alliance Protocol Based on Isomorphic Groups," Journal of Computers vol. 6, no. 4, pp. 650-656, 2011.