智能卡与信息高速公路的数据库

介绍一种用智能卡访问信息高速公路中匿名和可认证数据库的机制。     

A Cellular Automata Based Verifiable Multi-secret Sharing Scheme Without a Trusted Dealer

—We proposed a verifiable multi-secret shar-ing scheme without a dealer. We use cellular automata, having the properties of linear computations and parallel computations, to construct our scheme. The linear com-putational property makes it possible to build a scheme without the assistance of a trusted dealer, and the parallel computational property contributes to the high efficiency of the scheme. Hash function is used to realize the verifica-tion of shares, which also makes our scheme more efficient. The security of the scheme is also analyzed.     

Physical Propositions and Quantum Languages

The word proposition is used in physics with different meanings, which must be distinguished to avoid interpretational problems. We construct two languages ℒ ^* (x) and ℒ(x) with classical set-theoretical semantics which allow us to illustrate those meanings and to show that the non-Boolean lattice of propositions of quantum logic (QL) can be obtained by selecting a subset of p-testable propositions within the Boolean lattice of all propositions associated with sentences of ℒ(x). Yet, the aforesaid semantics is incompatible with the standard interpretation of quantum mechanics (QM) because of known no-go theorems. But if one accepts our criticism of these theorems and the ensuing SR (semantic realism) interpretation of QM, the incompatibility disappears, and the classical and quantum notions of truth can coexist, since they refer to different metalinguistic concepts (truth and verifiability according to QM, respectively). Moreover one can construct a quantum language ℒ _TQ (x) whose Lindenbaum–Tarski algebra is isomorphic to QL, the sentences of which state (testable) properties of individual samples of physical systems, while standard QL does not bear this interpretation.