作者机构：
[Gao Huidan; Guo Yimin; Guo Yajun; Peng Fei] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议名称：
3rd International Conference on Computational Intelligence and Industrial Application (PACIIA2010)
会议时间：
DEC 04-05, 2010
会议地点：
Wuhan, PEOPLES R CHINA
会议主办单位：
[Guo Yimin;Guo Yajun;Peng Fei;Gao Huidan] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议论文集名称：
Communications in Computer and Information Science
关键词：
Security mechanism;Trust mechanism;Trust
摘要：
Security and trust are closely related. No trust, no security. The nature relationship between security mechanisms and trust mechanisms in this paper is proposed. Firstly, the existing trust mechanisms are classified, and then the corresponding relations among trust mechanisms and different security mechanisms are analyzed. Finally, a comprehensive trust model for open networks is presented. The model is extensible multi-layer structure, and it is suitable for the establishment of open network security mechanisms.
期刊：
Applied Mechanics and Materials,2010年34-35:915-919 ISSN：1662-7482
通讯作者：
Guo Yimin
作者机构：
[Guo Yimin; Guo Yajun] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Guo Yimin] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议名称：
International Conference on Mechanical Engineering and Green Manufacturing (MEGM) 2010
会议时间：
NOV 19-22, 2010
会议地点：
Xiangtan, PEOPLES R CHINA
会议主办单位：
[Guo Yimin;Guo Yajun] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
关键词：
Open network;Trust;Trust management
摘要：
Open networks are always changing and unpredictable. The new trust management mechanisms will be needed in dynamic networks environment to ensure the open networks. A new trust management is proposed in this paper which trust is divided into two layers: network connection trust layer and application trust layer. Network connection trust layer is the foundation. If there is no network connection trust layer, there is no application trust layer. The trust relationship between each peer layer includes the basic trust and experience trust. Experience trust value is evaluated by fuzzy theory and a new connect operator and merge operator is presented to fuzzily evaluate the recommend trust value. Result shows that this trust architecture is suitable to establish trust relationship among principals and make a new secure solution in open network environment.
期刊：
International Journal of Distributed Sensor Networks,2009年5(1):15 ISSN：1550-1477
通讯作者：
Xu, Fen
作者机构：
[Xu, Fen; Guo, Yajun] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
通讯机构：
[Xu, Fen] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
摘要：
In large scale peer-to-peer networks, it is difficult to establish the trust relationship between peers as it is less likely that repeatable interactions will occur with the same peer. So the network is vulnerable to malicious peers. In order to settle the problem, a novel domain-based trust model is proposed in this paper. This model can be used to deal with trust relationship between the entities in peer-to-peer environment and help peer-to-peer entities make trust choice. Select a node whose performance is the optimal as a super-node in each domain of nodes. Some information of nodes in this domain is stored in super-nodes. There are a lot of this kind of domains in the whole peer-to-peer structure, and super-nodes in each domain are connected in the form of the pure peer-to-peer structure in the overall structure. This model divides the trust relationships between entities into a trust relationship in domain and the trust relationship between domains which are dealt with in a different way. This model can evaluate the trust relationship between the entities more accurately, thus can solve security issues more effectively in the peer-to-peer environment. We present the implementing process of this model, and propose several formulae to respectively calculate the trust value in the domain and the trust value between domains. Furthmore, the simulation and analyses show that this model can get more real trust value at the small price, and the advantages of the model are simple structure and high reliability. In conclusion, we propose a novel domain-based trust model based on the super-node network architecture. The structure of this model is very simple. The model is very easy to be accepted by users and is suitable for many kinds of peer-to-peer application environments. The trust relationships between entities are divided into trust relationship in the domain and a trust relationship between domains in the model. For the different trust relationships, we use the different calculation method to assure the real-time performance, accuracy, integrity, and calculation efficiency of the trust value. In future, we will make much more specific definition and description for this model such as updating the strategy of the trust value and so on. We will also incorporate intrusion tolerant intelligence in this model, so that nodes are able to detect false information sent by any malicious node.
期刊：
International Journal of Distributed Sensor Networks,2009年5(1):Page 39 ISSN：1550-1477
通讯作者：
Wang Liang
作者机构：
[Wang Liang; Qi Mei; Guo Yajun] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
通讯机构：
[Wang Liang] C;Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
会议名称：
International Symposium on Advances in Computer and Sensor Networks and Systems
会议时间：
APR 07-JUL 11, 2008
会议地点：
Zhengzhou, PEOPLES R CHINA
会议主办单位：
[Wang Liang;Guo Yajun;Qi Mei] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
关键词：
P2P system;E-commerce;Trust model;Reputation
摘要：
P2P e-commerce as a new shopping pattern is developing rapidly, and users can transact with anybody anytime and anywhere in the P2P e-commerce system, but as users often interact with strangers, hence building trust among the users, make the users know each other well, estimate the risk of participating in a transaction, and enable to transact securely in the P2P e-commerce system is an urgent problem to be solved for P2P e-commerce nowadays. In order to settle the problem, this paper provides a novel reputation-based trust model in P2P e-commerce system. The main thought of the proposed trust model is that a node has two types of reputation: local reputation and global reputation. In the local reputation computing, we take the calculation of factors including the amount of transaction money and transaction time and so on, and in the global reputation computing, there are three factors introduced—the number of neighbor nodes, the direct trust level of neighbor nodes, and the trust evaluation weight of neighbor nodes, and finally the object node's trust level can be obtained by using the local reputation weight coefficient and the global reputation weight coefficient to integrate the node's local reputation with global reputation. We have conducted two experiments that show that our trust model contrast with the present typical trust models EigenRep and Beta in the aspects of the computing load and the successful transaction rate. The first experiment shows that the trust model has a lower computing load compared to the EigenRep and Beta, because we do not compute the node's reputation through the transitive recommending of the intermediate nodes; the second experiment shows that the trust model has a higher successful transaction rate when the malicious nodes exist in the system, and even the number of malicious nodes proportion is larger, the trust model also has a higher successful transaction rate. In conclusion, the trust model more roundly takes into account the factors affecting the local reputation and global reputation and can greatly improve their computing methods. The experiment results show that the trust model can reduce the trust level computing load, and have more improvements on the successful transaction rate and anti-attack capability compared to the existing trust models. But the trust model does not introduce the risk factor, and the logic of the trust mode is relatively simple, so our trust model still needs to be improved constantly.
期刊：
International Journal of Distributed Sensor Networks,2009年5(1):Page 44 ISSN：1550-1477
通讯作者：
Qi Mei
作者机构：
[Yan Huifang; Qi Mei; Guo Yajun] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
通讯机构：
[Qi Mei] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
关键词：
Peer-to-Peer systems;File pollution;Reputation system
摘要：
File pollution has become a very serious problem in peer-to-peer file sharing systems, because of which it greatly reduces the effectiveness of systems. Users downloaded pollution files not only consumed bandwidth, but were also likely to share polluted files without checking. If these polluted files carry a virus, Trojan horse, or other malicious code, the loss of users would be disastrous. There is much research done on reputation-based anti-pollution mechanisms. Peer reputation systems and object reputation systems are two representatives reputation-based anti-pollution mechanisms currently. Peer reputation systems only care about the reputation of file providers, while object reputation systems only care about the reputation of sharing files. This paper proposes an anti-pollution mechanism combined with peer reputation and object reputation. Different from former research, we calculate the reputation of sharing files by the reputation of the voting peer. That is, object reputation is weighted by peer reputation. The reputation of the voting peer is built by its direct trust value and recommended trust value. Direct trust considers the trust of Direct Interaction Experience and the trust of Voting Similar Experience. Severe penalty strategy and voting incentive mechanism are introduced in calculating direct trust value. Therefore, a good user who uploads unpolluted files and voting on files actively can have a higher reputation, while a malicious user who uploads polluted files or voting unhonestly would have his reputation reduced sharply. Our expectation is that users for their own reputation will delect polluted files as soon as possible. These strategies give users an incentive to awareness of pollution, consequently isolate the polluters effectively. Our reputation mechanism is intended to prevent pollution spread by stimulating the awareness of users to delete files as soon as possible. At last, we simulate a P2P file sharing system to assess our reputation mechanism. The simulation results show that, compared to the object reputation system, our reputation mechanism convergence is faster, and has a better anti-pollution performance.
期刊：
International Journal of Distributed Sensor Networks,2009年5(1):Page 21 ISSN：1550-1477
通讯作者：
Guo Yajun
作者机构：
[Yan Huifang; Li Rong; Guo Yajun] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Guo Yajun] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议名称：
International Symposium on Advances in Computer and Sensor Networks and Systems
会议时间：
APR 07-JUL 11, 2008
会议地点：
Zhengzhou, PEOPLES R CHINA
会议主办单位：
[Guo Yajun;Yan Huifang;Li Rong] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
Authentication and anonymity usually are inconsistent. To obtain services, a user must be authenticated. Much of the sensitive information of the user will be exposed to service providers. In order to protect privacy, users must communicate with service providers in an anonymous way. But if the user does not show his true identity, how can the service provider believe that the user is true. This paper presents a secure anonymity authentication protocol for ubiquitous computing which allows service providers to authenticate anonymous users. Anonymity is achieved by separating the linkability of the user's identity information and the action of the user. By finding out objects linkability relationship, we also address an anonymity measure to analyze anonymity and detect the concealing security exposure. Anonymity Authentication There exist three principals in the anonymity authentication protocol: the user, the service discoverer, and the service provider. The anonymity authentication protocol contains two authentication stages. First, the authentication between the user and the service discoverer which determines the user whether he has the right to access the requested resource. And then the service discoverer makes use of blind signature on the user's public key as a ticket. Second, the service provider authenticates the user, in which the service provider judges the user whether is the genuine user. Anonymity Measure Linkability is the relation between objects (such as subjects, events, actions etc.) in a system before and after an action occurs. Unlinkability is the sufficient condition of anonymity. Definition 1 (function decision) Let R denote the object set, X and Y be subsets of R, and X≠Y. If Y can be known from X with probability p, then say X function decision Y, recorded as: X→Y(p). Definition 2 (function decision set) To the object set R, the function decision set is the set F of function decisions among the objects known by attackers. Definition 3 (function decision implication) If F is the function decision set known by attackers, let R denote the object set, X and Y be subsets of R, and X≠Y. If X→Y(p) can be deduced from F, then say F implication X→Y(p). Definition 4 (function decision closure) All the function decision sets implicated by F are called the closure of F, written as F +. Whether user anonymity is protected can be judged by seeing if there are relations between users' location/actions and users' identity in F +.
摘要：
Considering the problem of inadequate security in wireless sensor networks. The paper proposes a new key agreement scheme based on bilinear pairing for wireless sensor network. Firstly, the proposed scheme pre-distributes network system parameters using ID-based encryption algorithm and computes nodes' parameters on Bilinear Pairings. Then it broadcasts to networks and exchange parameters between nodes and computes nodes' key using Diffie-Hellman key exchange technology. Analyses show that the proposed scheme which is more efficient than the previous LZC scheme and Shim-Woo scheme, also the proposed scheme satisfies all the required security attributes :implicit key authentication ,known-key security, perfect forward secrecy, key-compromise impersonation resilience and Unknown key security.
期刊：
International Journal of Distributed Sensor Networks,2009年5(1):Page 20 ISSN：1550-1477
通讯作者：
Guo Yajun
作者机构：
[Dong Huihui; Yu Zhongqiang; Guo Yajun; Chen Hao] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Guo Yajun] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议名称：
International Symposium on Advances in Computer and Sensor Networks and Systems
会议时间：
APR 07-JUL 11, 2008
会议地点：
Zhengzhou, PEOPLES R CHINA
会议主办单位：
[Guo Yajun;Yu Zhongqiang;Chen Hao;Dong Huihui] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
Trust is the key for an information system to make security decisions. There does not exist in an aforehand trust relationship among principals in dynamic systems. To secure transaction, trust relationship must be established in principals. However, the existing trust architectures are flat, so they cannot embody well the dynamic characteristic of trust and do not take on well operability. In this paper, a two-layer trust architecture for dynamic systems is presented. Trust in this model is composed of a basic trust layer and a dynamic trust layer. Basic trust depends on the attributes of a principal, recommendation, or experience, while dynamic trust relies on the application context. This trust structure can reduce the complexity of making a decision in dynamic system. In dynamic systems, there are many factors to form trust, such as principal experience, attribute, recommendation, and context. In these trust factors, the context trust factor is different from the others, which it changes when close with the current context. We classify these trust factors into two groups. The first group includes experience, attribute, and recommendation to form this basic trust, while the second group involves current context to form dynamic trust. The trust value in this two-layer trust architecture was expressed as T = (Ta, Tc). Where Ta is the combination trust value of the attribute trust, experience, and recommendation trust, and Tc is the context trust value. Obviously, the relationship among trust values is a partial ordering. Experience usually associates with events. Positive trust events can increase the experience value, and negative trust events will reduce the experience. Because the importance of events is different, each event is assigned a weight. The larger the weight is, the more important the event is. Experience evaluation strategy provides the evaluation method for the occurred event. The attribute trust is the evaluation of the credibility, reliability, and security ability of the trusted principal according to the attributes of the trusted principal. The context trust is the trust evaluation of principals in a special context. Trust strategy is different in the different application context. For example, the trust strategy of a printer may be “medium” when the printer is free and the principal is in the offices, and may be “low” when the principal is not in the office, or when the printer is busy. The context trust value is the function of the context information: Tc = h(C), C is the context information.
摘要：
Facing the security threats and the energy shortage, a multi-angle trust mechanism for nodes in Wireless Sensor Networks was proposed, which extended the previous trust model only base on communication trust, With adding the sensing data and the node's energy in the factors of trust assessment, and new trust models to calculate the trust values of the sensed data and the node's energy, a more reliable wireless sensor networks could be established Simulation experiment results show that, one model only based on communication trust is not enough to decide on the trustworthiness of a node. Hence we need to develop new techniques to combine the communication trust, data trust and energy trust into a unite trust.m
摘要：
A reputation based trust model for E-commerce communities-RECTrust is presented. To compute the trust score precisely and to obtain stronger resistibility to attacks as well, many comprehensive factors in computing trust value are introduced in the mechanism, such as the feedback score given by peers, the value of transaction, the time of the transaction, the global trust score of the neighbor, the number of the neighbor and the punishment of the malicious behavior. Finally the transaction successful ratio of the model are analyzed by simulation.Results of simulation experiments show that, compared with some current trust models, the model is effective against malicious behavior.
期刊：
Proceedings of the International Symposium on Electronic Commerce and Security, ISECS 2008,2008年:254-257
通讯作者：
Liang, W.(wangliang@mails.ccnu.edu.cn)
作者机构：
[Wang Liang; Yan Huifang; Guo Yajun] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议名称：
ISECS 2008
会议时间：
2008-01-01
会议地点：
Guangzhou, China
会议论文集名称：
The International Symposium on ELectronic Commerce and Security: August 3-5, 2008 Guangzhou, China
摘要：
Anonymity is the property of keeping secret the identity of user accessing a certain resource or service, and it is a main approach to protect user's privacy. At present, many solutions of anonymity have been proposed, but they seldom concern how to evaluate the security of an anonymity mechanism. As user's actions are often dynamic and random in the network, this paper proposes a novel conceptual anonymity analysis model based on the fuzzy relation theory in fuzzy mathematics. Theoretic analysis shows that the proposed model can effectively analyze the security of existing anonymity systems in respect of the type of mobility, and can help design a new anonymity protection scheme.
期刊：
SEVENTH WUHAN INTERNATIONAL CONFERENCE ON E-BUSINESS, VOLS I-III: UNLOCKING THE FULL POTENTIAL OF GLOBAL TECHNOLOGY,2008年:222-225
作者机构：
[Dong, Huihui; Chen, Hao; Guo, Yajun; Yu, Zhongqiang] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
关键词：
trust model;access control;open system
摘要：
All security services are based on the premise that systems are trustworthy. Traditional computer system depends on access policy and user's identities to grant or deny their access to resources. The basic assumption in this system is that the trust relationship had been established among entities. In open systems such as Internet, however, where entities are not foreknown to each other. Traditional security solutions are inappropriate to open computing environments. Trust relationship must be established firstly when it permits or rejects the user to access some resources. In this paper, a trust-driven role based access control model is presented, which it is the integration of a dynamic trust and role based access control. This model appears well-suited for open systems to access control.
期刊：
INTERNATIONAL SYMPOSIUM ON ADVANCES IN COMPUTER AND SENSOR NETWORKS AND SYSTEMS, PROCEEDINGS: IN CELEBRATION OF 60TH BIRTHDAY OF PROF. S. SITHARAMA IYENGAR FOR HIS CONTRIBUTIONS TO THE SCIENCE OF COMPUTING,2008年:449-452
通讯作者：
Xu, Fen
作者机构：
[Xu, Fen; Guo, Yajun] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Hubei, Peoples R China.
通讯机构：
[Xu, Fen] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan, Hubei, Peoples R China.
关键词：
peer-to-peer;trust model;trust value
摘要：
In large scale peer-to-peer networks, it is difficult to establish the trust relationship between peers as it is less likely that repeatable interactions will occur with the same peer. So the network is vulnerable to malicious peers. A novel domain-based trust model in which the trust relationships between entities are divided into trust relationship in domain and trust relationship between domains is proposed in this paper to solve this problem. This model deals with these two kinds of trust relationships in the different way and improves trust value calculation method. The simulation and analyses show that this model can get more real trust value at the small price, and the advantages of the model are simple structure and high reliability.
期刊：
Proceedings of the International Conference on Information ManagementProceedings of the International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2008,2008年2:308-311
通讯作者：
Wu Huiting
作者机构：
[Wang Liang; Guo Yajun; Wu Huiting] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[Wan Chen] Wuhan Bioengn Inst, Dept Comp Sci, Wuhan 430070, Peoples R China.
通讯机构：
[Wu Huiting] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
作者机构：
[Yan Huifang; Qi Mei; Guo Yajun] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
会议名称：
International Symposium on Advances in Computer and Sensor Networks and Systems
会议时间：
APR 07-JUL 11, 2008
会议地点：
Zhengzhou, PEOPLES R CHINA
会议主办单位：
[Qi Mei;Guo Yajun;Yan Huifang] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
摘要：
File pollution has become a very serious problem in peer-to-peer file sharing systems,because which greatly reduces the effectiveness of systems. There are two representatives reputation based anti-pollution mechanisms,peer reputation systems and object reputation systems respectively. This paper proposes an anti-pollution mechanism combined with peer reputation and object reputation, in which the reputation of sharing files are weighted by the reputation of voting peers. Severe penalty strategy and voting incentive mechanism are introduced in calculating peer reputation, which not only isolate the polluters effectively, but also stimulate user awareness of file pollution,preventing its further spread. The simulation results show that, compared to object reputation system, our reputation mechanism convergence faster, has better anti-pollution performance.
期刊：
2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31,2008年:1-4 ISSN：2161-9646
通讯作者：
Wang Liang
作者机构：
[Wang Liang; Guo Yajun] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
通讯机构：
[Wang Liang] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
会议名称：
The 4th International Conference on Wireless Communications, Networking and Mobile Computing(第四届IEEE无线通信、网络技术及移动计算国际会议)
会议时间：
2008-10-12
会议地点：
大连
会议主办单位：
[Wang Liang;Guo Yajun] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
会议论文集名称：
The 4th International Conference on Wireless Communications, Networking and Mobile Computing(第四届IEEE无线通信、网络技术及移动计算国际会议)论文集
关键词：
P2P system;trust mechanism;reputation
摘要：
As online interactions often occur among peers with no prior knowledge of each other in P2P systems, the problem of security is attracting more and more attention. Hence, how to construct an effective trust mechanism to help build trust among peers is an important issue for the research of P2P technology nowadays. This paper proposes a novel reputation-based trust evaluation mechanism for P2P systems. This mechanism takes into account the comprehensive factors affecting trust level, improves the calculation methods of local reputation and global reputation, reduces the computing load of trust level, and introduces the blacklist mechanism into P2P systems. The experiment result shows that this proposed mechanism can effectively evaluate the trust level of peer and detect and separate malicious peers from P2P systems to improve the successful downloading rate, and can be effectively applied to P2P systems.
