10472791
Certified Email Delivery with Offline TTP
Email has become a standard communication method nowadays. But when it comes to important correspondences containing sensitive governmental, commercial or medical information, certified delivery is required. We present in this paper a new certified email protocol which assures fair delivery, non-repudiability, confidentiality and timeliness. To achieve definite fairness, an offline TTP is employed which will be involved only if there is a dispute.
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.
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.
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.
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.
1947084
Fair Payment Protocols for E-Commerce
It has been widely accepted that fairness is a critical property for electronic commerce. Fair payment protocol is designed to guarantee fairness in a payment process over asynchronous network. Fairness means that when the protocol terminates, either both parties get their expected items, or neither does. In this paper we first present a new generic offline fair payment protocol with fairness, timeliness and invisibility of TTP. Then we introduce the property of abuse-freeness into electronic payment and implement a fair abuse-free payment protocol.
15452882
On Cellular Capacity with Base Station Cooperation
This paper is concerned with cellular systems with rate constraints in fading environments. We consider a simple but asymptotically optimal matched filtering/successive interference cancellation (MF-SIC) scheme. We derive several concise and closed-form bounds for the power and spectral efficiencies of various base station cooperation strategies, which provide some useful insights into cellular systems.
13862518
Low Cost Mechanism for QoS-Aware Re-Planning of Composite Service
To meet the business and user requirements, it is crucial to manage the Quality of Service (QoS) of composite web service. Due to the dynamics nature of the web services, the runtime behavior of web services is likely to differ from the initial estimated one. Therefore, a re-planning to adapt the composite service to the QoS violated services, ensuring the global constraints and preferences will be needed. In this paper, we propose a low cost mechanism for re-planning. Such mechanism is supported by an offline re-planning execution environment and a performance prediction based low cost policy.The experimentations show better performance of the mechanism.
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.
9363924
RNA pseudoknot prediction using term rewriting
RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in all types of RNA and are also functionally important. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot prediction method based on term rewriting rather than on dynamic programming, comparative sequence analysis, or context-free grammars. The method we describe is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. Our method was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085% compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90%. These results indicate that term rewriting has a broad potential in RNA applications from prediction of pseudoknots to higher level RNA structures involving complex RNA tertiary interactions.
43577142
Undecidable Sentences Generated by Semantic Paradoxes
In applying the method of arithmetization to a proof of the completeness of the predicate calculus, Bernays has obtained a result which, when applied to set theories formulated in the predicate calculus, may be stated thus. 1.1. By adding an arithmetic sentence Con( S ) (expressing the consistency of a set theory S ) as a new axiom to the elementary number theory Z μ (HB II, p. 293), we can prove in the resulting system arithmetic translations of all theorems of S . It then follows that things definable or expressible in S have images in a simple extension of Z μ , if S is consistent. Since S can be a “strong” system, this fact has interesting consequences. Some of these are discussed by me and some are discussed by Kreisel. Kreisel finds an undecidable sentence of set theory by combining 1.1 and the Cantor diagonal argument. I shall prove below, using similar methods, a few further results, concerned with the notions of truth and designation. The method of numbering sets which I use (see 3.1 below) is different from Kreisel's. While the method used here is formally more elegant, Kreisel's method is much more efficient if we wish actually to calculate the numerical values.