期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2013
卷号：10
期号：1
出版社：IJCSI Press
摘要：In large distributed networks, many computers must be mutual coordination to complete some works Under the certain conditions, these computers may come from different domains. For ensuring the safety to access resources among these computers in different domains, we propose a cross-domain union authentication scheme. We compute a large prime cyclic group by elliptic curve, and use the direct decomposition of this group to decompose automorphism groups ,and design an signcryption scheme between domains by bilinear of automorphism group to achieve cross-domain union authentication. this scheme overcome the complexity of certificate transmission and bottlenecks in the scheme of PKI-based, and it can trace the entities and supports two-way entities anonymous authentication, which avoid the authority counterfeiting its member to cross-domain access resources. Analyses show that its advantages on security and communication-consumption .
关键词：signcryption;cross;domain authentication; elliptic curve;bilinear group
