17926099
Research and Design of One Key Agreement Scheme in Bluetooth
Since there is eavesdropping and MITM attack during establishing encryption key between two Bluetooth devices, a secure key agreement scheme is designed based on elliptic curves cryptography and interlock protocol. This scheme can defend two kinds of attacks mentioned above. It provides bidirectional authentication for two devices and key integrity verification by exchanging the keyspsila Hash-value. Then security of the scheme is theoretically analyzed and efficiency of it is compared with that of other schemes in relative papers. The results demonstrate the scheme proposed in this paper is secure and efficient.
18904561
A New Method of Realizing Fingerprint Authentication on Smartcard
A new method of realizing fingerprint authentication on Smartcard has been presented. Based on SOC, this method puts the pre-processing algorithm, which is the most time-wasting process, out of card. It not only decreases the complexity of realizing fingerprint authentication on Smartcard, but also ensures the security of fingerprint information due to the original fingerprint image has been transformed with cryptography algorithm of this paper. The experimental results demonstrate that this method can shorten the time of fingerprint verification effectively.
7786738
A Modified Multi-Secret Sharing Visual Cryptography Scheme
A modified threshold visual cryptography scheme (k, l, n)-VCS is proposed, which is used to analyze the relationship between the pixel expansion and the range of the participants¿ number. Based on (k, l, n)-VCS, a more precise definition of multi-secret sharing visual cryptography scheme is given, and a new method is presented. Experimental results demonstrate that both pixel expansion and relative difference of this method are better than those of the previous ones.
16677111
A Verifiable Visual Cryptography Scheme
To solve the problem of cheating in the reconstructing process of visual cryptography, a verifiable visual cryptography was proposed by adding a verifier to common visual cryptography scheme (VCS). This scheme can be used in any access structure and can check every share to prevent attackers from spoiling and grabbing the secret information.
28131114
Utilizing Fuzzy Petri Net for Choreography Based Semantic Web Services Discovery
Semantic Web Services have received great popularity these days for their capability of providing more automatic web services discoveries and compositions. However, the issue of behavior compatibility is still not properly solved. In this paper, we propose a choreography-based formal approach to discover semantic web services that are compatible with their behaviors. The fuzzy petri net is used to perform the modeling, verification, analysis and evaluation for the matchmaking of semantic web services. The requested and provided services are modeled by two fuzzy petri nets combined through a set of combination rules. By analyzing the composite fuzzy petri net, the behavior compatibility can be verified, and the matching degree between requested and provided services can be obtained. With our approach, the success rate and accuracy of the semantic web services discoveries can be improved, and the final services set can be optimized.
10926456
An agent-based approach to knowledge management
Traditional approaches to knowledge management are essentially limited to document management. However, much knowledge in organizations or communities resides in an informal social network and may be accessed only by asking the right people. This paper describes MARS, a multiagent referral system for knowledge management. MARS assigns a software agent to each user. The agents facilitate their users' interactions and help manage their personal social networks. Moreover, the agents cooperate with one another by giving and taking referrals to help their users find the right parties to contact for a specific knowledge need.
16993770
Service matchmaking with rough sets
With the wide adoption of open grid services architecture (OGSA) and Web services resource framework (WSRF), the grid is emerging as a service-oriented computing infrastructure for engineers and scientists to solve data and computationally intensive problems. It is envisioned that computing resources in a future grid environment will be exposed as services. Service discovery becomes an issue of vital importance for a wider uptake of the grid. This paper presents RSSM, a rough sets based service matchmaking algorithm for service discovery with an aim to tolerate uncertainty in identifying service properties. The evaluation results show that the RSSM algorithm is more effective in service discovery compared with other mechanisms such as UDDI and OWLS.