|
Resolving conflicts between negotiation success and sensitive information protection in automated trust negotiation
Bailing LIU, Feng XIAO, Ke DENG
Front Comput Sci Chin. 2011, 5 (2): 135-147.
https://doi.org/10.1007/s11704-011-9307-7
Automated trust negotiation (ATN) is an approach to establishing mutual trust between strangers wishing to share resources or conduct business by gradually requesting and disclosing digitally signed credentials. In ATN, there are conflicts between negotiation success and sensitive information protection, that is, these two needs cannot be given priority at the same time, which is a challenging problem to resolve. In this paper, a language independent ATN framework, which is dynamic, flexible and adaptive, is presented to address this problem, ensuring negotiation success without sensitive information leakage. This framework is independent of the policy language which is used. However, the language used should have the capability to specify all kinds of sensitive information appearing in credentials and policies, and support the separation of attribute disclosure from credential disclosure. Thus definitions of new language features, which can be incorporated into existing policy languages, are given, enabling the used language to support the capabilities mentioned above.
Figures and Tables |
References |
Related Articles |
Metrics
|
|
Fingerprint segmentation based on an AdaBoost classifier
Eryun LIU, Heng ZHAO, Fangfei GUO, Jimin LIANG, Jie TIAN
Front Comput Sci Chin. 2011, 5 (2): 148-157.
https://doi.org/10.1007/s11704-011-9134-x
Fingerprint segmentation is one of the most important preprocessing steps in an automatic fingerprint identification system (AFIS). Accurate segmentation of a fingerprint will greatly reduce the computation time of the following processing steps, and the most importantly, exclude many spurious minutiae located at the boundary of foreground. In this paper, a new fingerprint segmentation algorithm is presented. First, two new features, block entropy and block gradient entropy, are proposed. Then, an AdaBoost classifier is designed to discriminate between foreground and background blocks based on these two features and five other commonly used features. The classification error rate (Err) and McNemar’s test are used to evaluate the performance of our method. Experimental results on FVC2000, FVC2002 and FVC2004 show that our method outperforms other methods proposed in the literature both in accuracy and stability.
Figures and Tables |
References |
Related Articles |
Metrics
|
|
Design and implementation of a portable TPM scheme for general-purpose trusted computing based on EFI
Lei HAN, Jiqiang LIU, Zhen HAN, Xueye WEI
Front Comput Sci Chin. 2011, 5 (2): 169-180.
https://doi.org/10.1007/s11704-011-9180-4
In today’s globalized digital world, network-based, mobile, and interactive collaborations have enabled work platforms of personal computers to cross multiple geographical boundaries. The new requirements of privacy-preservation, sensitive information sharing, portability, remote attestation, and robust security create new problems in system design and implementation. There are critical demands for highly secure work platforms and security enhancing mechanisms for ensuring privacy protection, component integrity, sealed storage, and remote attestation of platforms. Trusted computing is a promising technology for enhancing the security of a platform using a trusted platform module (TPM). TPM is a tamper-resistant microcontroller designed to provide robust security capabilities for computing platforms. It typically is affixed to the motherboard with a low pin count (LPC) bus. However, it limited in that TPM cannot be used directly in current common personal computers (PCs), and TPM is not flexible and portable enough to be used in different platforms because of its interface with the PC and its certificate and key structure. For these reasons, we propose a portable trusted platform module (PTPM) scheme to build a trusted platform for the common PC based on a single cryptographic chip with a universal serial bus (USB) interface and extensible firmware interface (EFI), by which platforms can get a similar degree of security protection in general-purpose systems. We show the structure of certificates and keys, which can bind to platforms via a PTPM and provide users with portability and flexibility in different platforms while still allowing the user and platform to be protected and attested. The implementation of prototype system is described in detail and the performance of the PTPM on cryptographic operations and time-costs of the system bootstrap are evaluated and analyzed. The results of experiments show that PTPM has high performances for supporting trusted computing and it can be used flexibly and portably by the user.
Figures and Tables |
References |
Related Articles |
Metrics
|
|
FlowTrust: trust inference with network flows
Guojun WANG, Jie WU
Front Comput Sci Chin. 2011, 5 (2): 181-194.
https://doi.org/10.1007/s11704-011-0323-4
Web-based social networking is increasingly gaining popularity due to the rapid development of computer networking technologies. However, social networking applications still cannot obtain a wider acceptance by many users due to some unresolved issues, such as trust, security, and privacy. In social networks, trust is mainly studied whether a remote user behaves as expected by an interested user via other users, who are respectively named trustee, trustor, and recommenders. A trust graph consists of a trustor, a trustee, some recommenders, and the trust relationships between them. In this paper, we propose a novel FlowTrust approach to model a trust graph with network flows, and evaluate the maximum amount of trust that can flow through a trust graph using network flow theory. FlowTrust supports multi-dimensional trust. We use trust value and confidence level as two trust factors. We deduce four trust metrics from these two trust factors, which are maximum flow of trust value, maximum flow of confidence level, minimum cost of uncertainty with maximum flow of trust, and minimum cost of mistrust with maximum flow of confidence. We also propose three FlowTrust algorithms to normalize these four trust metrics. We compare our proposed FlowTrust approach with the existing RelTrust and CircuitTrust approaches. We show that all three approaches are comparable in terms of the inferred trust values. Therefore, FlowTrust is the best of the three since it also supports multi-dimensional trust.
References |
Related Articles |
Metrics
|
|
Type-2 fuzzy description logic
Ruixuan LI, Kunmei WEN, Xiwu GU, Yuhua LI, Xiaolin SUN, Bing LI
Front Comput Sci Chin. 2011, 5 (2): 205-215.
https://doi.org/10.1007/s11704-011-0109-8
Description logics (DLs) are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and roles, thus providing the motivation for this work. In this paper, we present a type-2 fuzzy attributive concept language with complements (ALC) and provide its knowledge representation and reasoning algorithms. We also propose type-2 fuzzy web ontology language (OWL) to build a fuzzy ontology based on type-2 fuzzy ALC and analyze the soundness, completeness, and complexity of the reasoning algorithms. Compared to type-1 fuzzy ALC, type-2 fuzzy ALC can describe imprecise knowledge more meticulously by using the membership degree interval. We implement a semantic search engine based on type-2 fuzzy ALC and carry out experiments on real data to test its performance. The results show that the type-2 fuzzy ALC can improve the precision and increase the number of relevant hits for imprecise information searches.
Figures and Tables |
References |
Related Articles |
Metrics
|
|
Individual difference of artificial emotion applied to a service robot
Wei WANG, Zhiliang WANG, Siyi ZHENG, Xuejing GU
Front Comput Sci Chin. 2011, 5 (2): 216-226.
https://doi.org/10.1007/s11704-010-0145-9
In order to enable personalized natural interaction in service robots, artificial emotion is needed which helps robots to appear as individuals. In the emotion modeling theory of emotional Markov chain model (eMCM) for spontaneous transfer and emotional hidden Markov model (eHMM) for stimulated transfer, there are three problems: 1) Emotion distinguishing problem: whether adjusting parameters of the model have any effects on individual emotions; 2) How much effect the change makes; 3) The problem of different initial emotional states leading to different resultant emotions from a given stimuli. To solve these problems, a research method of individual emotional difference is proposed based on metric multidimensional scaling theory. Using a dissimilarity matrix, a scalar product matrix is calculated. Subsequently, an individual attribute reconstructing matrix can be obtained by principal component factor analysis. This can display individual emotion difference with low dimension. In addition, some mathematical proofs are carried out to explain experimental results. Synthesizing the results and proofs, corresponding conclusions are obtained. This new method provides guidance for the adjustment of parameters of emotion models in artificial emotion theory.
Figures and Tables |
References |
Related Articles |
Metrics
|
|
Improving performance by creating a native join-index for OLAP
Yansong ZHANG, Shan WANG, Jiaheng LU
Front Comput Sci Chin. 2011, 5 (2): 236-249.
https://doi.org/10.1007/s11704-011-9181-3
The performance of online analytical processing (OLAP) is critical for meeting the increasing requirements of massive volume analytical applications. Typical techniques, such as in-memory processing, column-storage, and join indexes focus on high performance storage media, efficient storage models, and reduced query processing. While they effectively perform OLAP applications, there is a vital limitation: main-memory database based OLAP (MMOLAP) cannot provide high performance for a large size data set. In this paper, we propose a novel memory dimension table model, in which the primary keys of the dimension table can be directly mapped to dimensional tuple addresses. To achieve higher performance of dimensional tuple access, we optimize our storage model for dimension tables based on OLAP query workload features. We present directly dimensional tuple accessing (DDTA) based join (DDTA-JOIN), a technique to optimize query processing on the memory dimension table by direct dimensional tuple access. We also contribute by proposing an optimization of the predicate tree to shorten predicate operation length by pruning useless predicate processing. Our experimental results show that the DDTA-JOIN algorithm is superior to both simulated row-store main memory query processing and the open-source column-store main memory database MonetDB, thanks to the reduced join cost and simple yet efficient query processing.
References |
Related Articles |
Metrics
|
12 articles
|