Cross-domain authentication alliance protocol based on isomorphic groups

Qikun Zhang*, Jun Zheng, Yuan Tan, Ruifang Wang, Yuanzhang Li

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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 alliance-agreement. 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 cross-domain 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.

Original languageEnglish
Pages (from-to)650-656
Number of pages7
JournalJournal of Computers (Finland)
Volume6
Issue number4
DOIs
Publication statusPublished - Apr 2011

Keywords

  • Alliance-certification
  • Bilinear groups
  • Direct product decomposition
  • Inter-domain signcryption

Fingerprint

Dive into the research topics of 'Cross-domain authentication alliance protocol based on isomorphic groups'. Together they form a unique fingerprint.

Cite this