17656556
A Non-repudiable Protocol for Secure Messaging
As Oppliger stated, secure messaging refers to the ability to provide data confidentiality, data integrity, data origin authentication, and non-repudiation of origin services for email. It is very important but poorly developed and has very limited application. We propose an email protocol assures non-repudiability which means that if the email is successfully sent, the sender cannot deny she/he has actually sent the mail and the recipient cannot deny she/he has actually received it. The protocol uses an efficient RSA-based convertible signature.
7625765
Solving QoS-driven Web service dynamic composition as fuzzy constraint satisfaction
The creation of value-added composite web service raises an opportunity to the formation of online B2B collaborations. However, web services are usually overlapping in functionality. How to make a choice based on non-functional factors becomes a problem that needs to be solved. In this paper, it argues that the selection of component services should be considered in a global manner and the user's QoS preferences is more appropriate to be expressed in a fuzzy way. It advocates using fuzzy set to express the user's QoS preference on a specific QoS criteria and using fuzzy expression to express the user's trade-off among QoS criteria's. The service selection problem is formalized as a fuzzy constraint satisfaction problem and deep-first branch-and-bound method is chosen to search for a solution with some adjustments to web service composition. It also develops an uncritical fuzzy consistency checking algorithm as an aid to faster search. Experiments are conducted to prove the effectiveness of the approach.
15968114
An Efficient Explicit-time Description Method for Timed Model Checking
Timed modelchecking,the methodtoformallyverifyreal-timesystems, is attractingincreasingatten-tion from both the model checking community and the real-time community. Explicit-time descrip-tion methods verify real-time systems using general model constructs found in standard un-timedmodel checkers. Lamport proposed an explicit-time description method [17] using a clock-tickingprocess (Tick) to simulate the passage of time together with a group of global variables to model timerequirements. Two methods, the Sync-based Explicit-time Description Methodusing rendezvoussynchronization steps and the Semaphore-based Explicit-time Description Methodusing only oneglobal variable were proposed [27, 26]; they both achieve better modularity than Lamport’s methodin modelingthe real-time systems. In contrast to timed automatabased model checkerslike UPPAAL[7], explicit-time description methods can access and store the current time instant for future calcula-tions necessary for many real-time systems, especially those with pre-emptive scheduling. However,the Tick process in the above three methods increments the time by one unit in each tick; the statespaces therefore grow relatively fast as the time parameters increase, a problem when the system’stime period is relatively long. In this paper, we propose a more efﬁcient method which enables theTick process to leap multiple time units in one tick. Preliminary experimentalresults in a high perfor-mance computing environment show that this new method signiﬁcantly reduces the state space andimproves both the time and memory efﬁciency.
14158906
A New Certified Email Protocol
As a continuative effort of our WICS'05 paper, a new certified Email protocol is proposed. Email is a standard communication method nowadays but certified email is poorly developed and has very limited application. A certified email protocol assures non-repudiability which means that if the email is successfully sent, the sender cannot deny s/he has actually sent the mail and the recipient cannot deny s/he has actually received it. Our protocol uses an efficient RSA-based convertible signature with non- interactive partial signature proof method and additively split signing secret key.
4594972
New Fair Payment Protocols
Fair payment protocol is designed to guarantee fairness in electronic purchasing, that is, no party can falsely deny involvement in the transaction or having sent/received the specific items/payment. In this paper we first present an efficient fair payment protocol providing invisibility of TTP, timeliness, and standard RSA signatures as the final non-repudiation evidences. Then we present a second payment protocol which is the first one to provide abuse-freeness. Our protocols can be easily integrated into the existing electronic payment systems.
38699742
Dependable Transaction for Electronic Commerce
Electronic transaction becomes common practice in real world business. This paper focuses on the issue of dependability in critical transactions like electronic payment, electronic contract signing. Recent fair protocols can recover transactions from network crashes, but cannot survive local system crashes. A two-party dependable transaction protocol is proposed. During the protocol, both parties can recover the transaction from network and local system failures in a transparent way, which means that after the recovery, outcome messages would be just the same as those from a successful run of the transaction.
940637
Apply ant colony optimization to Tetris
Tetris is a falling block game where the player's objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, agent imitates the real player and chooses the best move based on a linear value function. In this paper, we apply Ant Colony Optimization (ACO) method to learn the weights of the function, trying to search an optimal weight-path in the weight graph. We use dynamic heuristic to prevent premature convergence to local optima. Our experimental result is better than most of traditional reinforcement learning methods.
9428173
A Note on Quine's Principles of Quantification
In his Mathematical logic Quine characterizes the theorems of quantification theory by six principles:
39099940
Efficient error recovery techniques in a novel multimedia streaming framework with peer-paired collaboration
Recently, active research has gone to application-level multicast that tries to bring all the merits of unicast and IP multicast together while avoiding their drawbacks. How to efficiently recover from errors in such a system is a difficult question yet to be answered. The current research focus is primarily on developing local error recovery techniques, but these techniques would not work in case of shared losses, which often occur in application-level multicast. In this paper, a novel multimedia streaming framework called peer-paired pyramid streaming (P/sup 3/S) is proposed. It is basically a hybrid client/server and peer-to-peer structure. In P/sup 3/S, clients are hierarchically organized and those at the same level are coupled and peer-pairs are then formed. Based on P/sup 3/S, we introduce some controlled delay between packets that are vulnerable to shared losses to combat with the shared losses. The proposed technique is supported by both theoretical and experimental results presented in this paper.
16457860
A New Secure Authentication Scheme Based Threshold ECDSA For Wireless Sensor Network
Security is an important issue for Wireless Sensor Network (WSN), especially for security-sensitive application. In this paper, we address secure authentication problems in WSN. First, we propose distributed authentication model for WSN, and secondly, advance the threshold ECDSA authentication scheme in this model, finally construct a new way to choose distributed CA severs of threshold authentication scheme. Our simulation results and analysis show that our scheme can reduce effectively bandwidth and computation resources while providing a robust, highly secure and highly available authentication service.
15067408
Adapting LDA Model to Discover Author-Topic Relations for Email Analysis
Analyzing the author and topic relations in email corpus is an important issue in both social network analysis and text mining. The Author-Topic model is a statistical model that identifies the author-topic relations. However, in its inference process, it ignores the information at the document level, i.e., the co-occurrence of words within documents are not taken into account in deriving topics. This may not be suitable for email analysis. We propose to adapt the Latent Dirichlet Allocation model for analyzing email corpus. This method takes into account both the author-document relations and the document-topic relations. We use the Author-Topic model as the baseline method and propose measures to compare our method against the Author-Topic model. We did empirical analysis based on experimental results on both simulated data sets and the real Enron email data set to show that our method obtains better performance than the Author-Topic model.