The conventional ring signature schemes cannot address the scenario where the rank of members of the ring needs to be distinguished, for example, in electronically commerce application. To solve this problem, we prese...
详细信息
The conventional ring signature schemes cannot address the scenario where the rank of members of the ring needs to be distinguished, for example, in electronically commerce application. To solve this problem, we presented a Trusted Platform Module (TPM)-based threshold ring signature schen. Employing a reliable secret Share Distribution Center (SDC), the proposed approach can authenticate the TPM-based identity rank of members of the ring but not track a specific member's identity. A subset including t members with the same identity rank is built. With the signing cooperation of t members of the subset, the ring signature based on Chinese remainder theorem is generated. We proved the anonymity and unforgeability of the proposed scheme and compared it with the threshold ring signature based on Lagrange interpolation polynomial. Our scheme is relatively simpler to calculate.
The flow and congestion control methods based on one-shot game model with non-cooperative game theory can explain the non-cooperative behavior of Internet ***,the low effciency of equilibrium solutions affects their *...
详细信息
The flow and congestion control methods based on one-shot game model with non-cooperative game theory can explain the non-cooperative behavior of Internet ***,the low effciency of equilibrium solutions affects their *** the behavior of flow and congestion control based on infinitely repeated game models is addressed;the repeated and infinitely repeated flow and congestion control game model is presented; the existence and optimization of the Nash equilibrium point are proved;the discount factor in repeated game is discussed;the punishment and threat strategy to users'misbehavior is studied in N-users infinitely flow control game;the punishment restrictive method of users'behavior is designed in infinitely and finitely games;finally,a flow control algorithm based on repeated game,FCAR,is provided based on the conclusions of repeated game *** results of experiment and simulation show that FCAR algorithm could regularize and restrict users' misbehavior *** algorithm can also make non-cooperative Internet users achieve cooperation in order to optimize the utility of the whole flow and congestion control system.
Vehicular Ad hoc networks (VANET) consists of several vehicular nodes and uses 802.11p protocol for communication. Because of its unique characteristics, such as fast speed, serious Doppler effect, large node number e...
详细信息
The set of frequent closed itemsets is much smaller than the one of all frequent itemsets. Meanwhile it retains the completeness. In this paper, we propose an ITBitree-based algorithm, called ITBitreeFCIM (ITBitree Fr...
详细信息
The set of frequent closed itemsets is much smaller than the one of all frequent itemsets. Meanwhile it retains the completeness. In this paper, we propose an ITBitree-based algorithm, called ITBitreeFCIM (ITBitree Frequent Closed Itemsets Miner), for mining the frequent closed itemsets directly. A novel structure termed ITBitree (Itemset Tidset Binary Tree) is defined to store the transaction and itemset information. Frequent closed itemsets are generated directly by searching the right nodes in each layer and the right nodes in their respective search space deeply from this tree using top-down strategy. For the items with same support in the adjacent layers or the items with the same Tids, we use item merging technique to prune the search space. The searched space is used to avoid the generation of duplicates and enormous closure checks. In the process we do not need to check whether a candidate itemset is closed, so we save a lot of time. The experiment proofs the efficiency of the proposed approach.
Algorithms based on row enumeration always scan and construct conditional transposed tables, which increases the execution time and space cost. To address this problem, we adopt the DAG (Directed Acyclic Graph) to com...
详细信息
Algorithms based on row enumeration always scan and construct conditional transposed tables, which increases the execution time and space cost. To address this problem, we adopt the DAG (Directed Acyclic Graph) to compress the dataset to save the memory space. In DAG, each node is related to a rowid, and each two nodes have a corresponding directed edge which stores the common items of the two rowids. Each row is given an integer according to its coming order and the DAG follows that order. A directed acyclic graph records the relation between rows and items by doing AND(&) operation with the nodes' binary code of the edges. We also present DAGHDDM which is a new approach for mining frequent closed itemsets in high dimensional datasets. In this algorithm, we adopt the BitTable to compress the dataset firstly, and then construct DAG according to the BitTable. We increase the same items of the adjacent edges to implement pattern growth, traverse the DAG in reversal way and adopt a close-checking method to generate all frequent closed itemsets. It scans the dataset only once and does not generate candidate itemsets. The experimental results show that the proposed DAGHDDM algorithm can decrease the cost of time.
While the traditional Web, Email and other Internet applications are still used large-scale, Internet applications, such as typical P2P resource sharing, streaming, games, instant messaging and other new applications ...
详细信息
Masking in gate level could efficiently protect AES S-box out of power analysis attack. But there still exists a kind of attack, called glitch attack, to achieve the sensitive information from gate cell leakage. Some ...
详细信息
Masking in gate level could efficiently protect AES S-box out of power analysis attack. But there still exists a kind of attack, called glitch attack, to achieve the sensitive information from gate cell leakage. Some works had been done to resist against glitch attack, which carefully masked AND gate or used Wave Dynamic Differential Logic (WDDL) cell. In this paper, we propose an improved masked AND gate, in which the relationship between input masked values and masks is nonlinear. Usually, when converting S-box operations from GF(2 8 ) to GF(((2 2 ) 2 ) 2 ), all the necessary computations become XOR and AND operations. Therefore, to fully mask AES S-box is to substitute the unmasked XOR and AND operations with the proposed masked AND gate and protected XOR gate. Although the proposed masked AND gate take up one extra XOR gate than Trichina's design and Baek's design, it can resist against glitch attack without using specific gate cell, such as WDDL.
In order to ensure the security of information systems, it's essential to make sure that system behaviors are trusted. By analyzing threats that exist in executing procedures, a trust model based on structured pro...
详细信息
In order to ensure the security of information systems, it's essential to make sure that system behaviors are trusted. By analyzing threats that exist in executing procedures, a trust model based on structured protection is proposed. We consider that functional components, system actions and message flows between components are three key factors of information systems. Structured protection requirements on components, connections and action parameters are also provided. Four trusted properties of the model are deducted through formal analysis, and trusted system behavior is defined based on these properties. Furthermore, decision theorem of trusted system behavior is proved. The developed prototype system indicates the model is practical. It is a general theory model built on logic deduction and independent on specific environment and the behaviors of the system designed and implemented following the model are trusted.
In recent years, Principle Component Analysis is an extraction method for statistics characteristic, which has been more researched and widely used in the signal processing, pattern recognition, digital image processi...
详细信息
In recent years, Principle Component Analysis is an extraction method for statistics characteristic, which has been more researched and widely used in the signal processing, pattern recognition, digital image processing and other fields. This paper mainly describe that original currency characteristic vectors will be carried the linear transform by Principle Component Analysis Method, and then reduced-dimension original currency characteristic vector is automatically classified by BP Neural networks, and finally identification research experiment is made for different kinds of currency,such as 1 yuan, 5 yuan, 10 yuan and 20 yuan. The experiment results indicate that currency characteristic extraction and identification algorithm based on Principle Component Analysis and BP neural network has higher identification rate and better identification effect.
Broadcast is a hot topic in wireless sensor network research. The main challenges are from network instability and complexity of communication collision. Currently, the broadcast protocols for sensor network focus on ...
详细信息
暂无评论