Ubiquitous computing systems typically have lots of security problems in the area of identity authentication by means of classical PKI methods. The limited computing resources, the disconnection network, the classific...Ubiquitous computing systems typically have lots of security problems in the area of identity authentication by means of classical PKI methods. The limited computing resources, the disconnection network, the classification requirements of identity authentication, the requirement of trust transfer and cross identity authentication, the bi-directional identity authentication, the security delegation and the simple privacy protection etc are all these unsolved problems. In this paper, a new novel ubiquitous computing identity authentication mechanism, named UCIAMdess, is presented. It is based on D-S Evidence Theory and extended SPKI/SDSI. D-S Evidence Theory is used in UCIAMdess to compute the trust value from the ubiquitous computing environment to the principal or between the different ubiquitous computing environments. SPKI-based authorization is expanded by adding the trust certificate in UCIAMdess to solve above problems in the ubiquitous computing environments. The identity authentication mechanism and the algorithm of certificate reduction are given in the paper to solve the multi-levels trust-correlative identity authentication problems. The performance analyses show that UCIAMdess is a suitable security mechanism in solving the complex ubiquitous computing problems.展开更多
A new uncertainty relation(UR) is obtained for a system of N identical pure entangled particles if we use symmetrized observables when deriving the inequality. This new expression can be written in a form where we ide...A new uncertainty relation(UR) is obtained for a system of N identical pure entangled particles if we use symmetrized observables when deriving the inequality. This new expression can be written in a form where we identify a term which explicitly shows the quantum correlations among the particles that constitute the system. For the particular cases of two and three particles, making use of the Schwarz inequality, we obtain new lower bounds for the UR that are different from the standard one.展开更多
基金Supported by the Ministry of Educationin China (No.104086)
文摘Ubiquitous computing systems typically have lots of security problems in the area of identity authentication by means of classical PKI methods. The limited computing resources, the disconnection network, the classification requirements of identity authentication, the requirement of trust transfer and cross identity authentication, the bi-directional identity authentication, the security delegation and the simple privacy protection etc are all these unsolved problems. In this paper, a new novel ubiquitous computing identity authentication mechanism, named UCIAMdess, is presented. It is based on D-S Evidence Theory and extended SPKI/SDSI. D-S Evidence Theory is used in UCIAMdess to compute the trust value from the ubiquitous computing environment to the principal or between the different ubiquitous computing environments. SPKI-based authorization is expanded by adding the trust certificate in UCIAMdess to solve above problems in the ubiquitous computing environments. The identity authentication mechanism and the algorithm of certificate reduction are given in the paper to solve the multi-levels trust-correlative identity authentication problems. The performance analyses show that UCIAMdess is a suitable security mechanism in solving the complex ubiquitous computing problems.
基金supported by Fundacao de Amparo à Pesquisa do Estado de Sao Paulo(FAPESP)
文摘A new uncertainty relation(UR) is obtained for a system of N identical pure entangled particles if we use symmetrized observables when deriving the inequality. This new expression can be written in a form where we identify a term which explicitly shows the quantum correlations among the particles that constitute the system. For the particular cases of two and three particles, making use of the Schwarz inequality, we obtain new lower bounds for the UR that are different from the standard one.
