3764870
Protection Against Spam Using Pre-Challenges
Spam turns out to be an increasingly serious problem to email users. A number of anti-spam schemes have been proposed and deployed, but the problem has yet been well addressed. One of those schemes is challenge-response, in which a challenge is imposed on an email sender. However, such a scheme introduces new problems for the users, e.g., delay of service and denial of service attacks. In this paper, we introduce a pre-challenge scheme that avoids those problems. It assumes each user has a challenge that is defined by the user himself/herself and associated with his/her email address, in such a way that an email sender can simultaneously retrieve a new receiver’s email address and challenge before sending an email in the first contact. Some new mechanisms are employed to reach a good balance between security against spam and convenience to email users.
1909548
An intensive survey of fair non-repudiation protocols
With the phenomenal growth of the Internet and open networks in general, security services, such as non-repudiation, become crucial to many applications. Non-repudiation services must ensure that when Alice sends some information to Bob over a network, neither Alice nor Bob can deny having participated in a part or the whole of this communication. Therefore a fair non-repudiation protocol has to generate non-repudiation of origin evidences intended to Bob, and non-repudiation of receipt evidences destined to Alice. In this paper, we clearly define the properties a fair non-repudiation protocol must respect, and give a survey of the most important non-repudiation protocols without and with trusted third party (TTP). For the later ones we discuss the evolution of the TTP's involvement and, between others, describe the most recent protocol using a transparent TTP. We also discuss some ad-hoc problems related to the management of non-repudiation evidences.
2500764
Securing digital signatures for non-repudiation
Dispute of transactions is a common problem that could jeopardise business. Hence non-repudiation services are essential in business transactions which provide evidence to enable dispute resolution. To be eligible as non-repudiation evidence, the digital signature on an electronic document should remain valid until its expiry date which is specified by some non-repudiation policy. The conventional approaches are either inefficient or insecure to achieve non-repudiation in electronic commerce. This article presents a practical scheme to secure digital signatures as non-repudiation evidence with an adjustable degree of risk.
26863874
Efficient Signature Validation Based on a New PKI
Digital signatures usually serve as irrefutable cryptographic evidence to support dispute resolution in electronic transactions. Trusted time-stamping and certificate revocation services, although very costly in practice, must be available to prevent big loss due to compromising of the signing key. In this paper, we employ a revocation-free public-key framework to improve the efficiency in maintaining the validity of digital signatures as non-repudiation evidence. The new PKI allows an end user to control the validity of his own public-key certificate and enables certificate verification without retrieving the revocation information from the CA. Based on this new PKI, we could validate generic digital signatures using a TSA only. Moreover, we could validate forward-secure digital signatures without the TTP’s involvement.
40659634
Observations on Non-repudiation
This paper discusses non-repudiation services regarding the transfer of a message and classifies the roles of trusted third parties involved in non-repudiation services. We examine the selective receipt problem and the generation of time evidence, analyse the current state of the ISO/IEC 13888 drafts on non-repudiation mechanisms, and present a fair non-repudiation protocol including time evidence to promote the development of these drafts.
1762691
Non-Repudiation in Electronic Commerce
Introduction - Electronic Commerce and Security. Repudiation and Dispute Resolution. Non-Repudiation and Network Security. Non-Repudiation in Message Handling Systems. Non-Repudiation in Electronic Payment Systems. Book Outline. Fundamentals of Non-Repudiation - Goals of Non-Repudiation. Non-Repudiation Services. Non-Repudiation Evidence. Roles of Trusted Third Parties. Phases of Non-Repudiation. Non-Repudiation Policy. Requirements for Non-Repudiation. Securing Digital Signatures for Non-Repudiation - Security Requirements on Digital Signatures. Time Stamps in Digital Signatures. Securing TTP's Digital Signatures. Time-Stamping Approach. Auditing Approach. One-Way Sequential Link Approach. Temporary Certificate Approach. Comparison. Summary. Achieving Fair Non-Repudiation - Factors against Fair Non-Repudiation. Approaches for Fair Non-Repudiation. Protocol NR1: Using Light-Weighted On-Line TTP. Protocol NR2: Using Off-Line TTP without Timely Termination. Protocol NR3: Using Off-Line TTP with Timely Termination. Protocol NR4: Using In-Line TTP for Timely Delivery. Summary. Related Work on Fair Non-Repudiation - Protocols Using In-Line TTP. Protocols Using On-Line TTP. Protocols Using Off-Line TTP. Protocols with Probablistic Fairness. Summary. ISO's Non-Repudiation Mechanisms - Overview of ISO/IEC 13888. Mechanisms Using Symmetric Techniques. Mechanisms Using Asymmetric Techniques. Time-Stamping Evidence. Summary. Case Studies - Non-Repudiation in Electronic Payment. Undeniable Billing in Mobile Communication. Summary. Conclusion. Towards Formal Verification of Non-Repudiation - The SVO Logic. Formalization of Non-Repudiation. Verification of a Non-Repudiation Protocol. Summary.
2288037
An Overlay Subscription Network for Live Internet TV Broadcast
We propose a framework, called overlay subscription network (OSN), for live Internet TV broadcast, where a subscriber can choose to watch at any time. This framework allows the source server to incrementally build a topology graph that contains the network connections not only from the server to each subscriber, but also among the subscribers themselves. With such a topology graph in place, we consider efficient overlay multicast for scalable OSN services. We first show that idling nodes, which do not receive video data for their own playback, can actually be used for data forwarding to significantly reduce the cost of overlay multicast. In light of this observation, we then propose a novel overlay multicast technique that distinguishes itself from existing schemes with these three aspects. First, the proposed technique is centered on the topology graph and can take advantage of the actual network connections among the subscribing nodes. Second, the new scheme is able to find and incorporate appropriate idling nodes in multicast to reduce network traffic. Third, with our approach, a node can be used in multiple multicast trees for data forwarding to improve the overall system performance. We evaluate the performance of the proposed technique through simulation. Our extensive studies show that the proposed framework has the potential to enable the Internet, a vehicle up to date mainly for transferring text and image data, for large-scale and cost-effective TV broadcast
15424385
Data driven approach to designing minimum hamming distance polychotomizer
A polychotomous classifier assigns an observation to one of the K categories with K > = 3. Multiple binary classifiers (K = 2) such as the popular Support Vector Machines can be combined to achieve multi-class classification. Commonly used approaches include the one-vs-others scheme and the one-vs-one (pairwise coupling) scheme. While literature reported better performance from pairwise coupling than one-vs-others, the number of base learners required by pairwise coupling is quadratic in K. Alternatively, error correcting output codes (ECOC) provides a more general framework for designing polychotomizers. It associates each class with a codeword, which provides the capability to unify the traditional schemes. However, the design of an effective "coding matrix" remains an open problem. We study one kind of ECOC polychotomizer that decodes using minimum hamming distance. We propose a novel data-driven way to design the codewords based on inter-cluster distance. It provides a systematic way to extend the traditional schemes and construct effective polychotomizers. Experiments are conducted on synthetic data and real world applications including UCI repository problems and CENPARMI handwritten numerals. Experiments show that the proposed scheme can achieve competitive accuracy compared with both traditional schemes, and the number of base learners is typically much less than the requirement of the pairwise scheme.
31245503
On the ascending star subgraph decomposition of star forests
AbstractLetG be a graph of size
$$\left( {n_2^ + 1} \right)$$
 for some integern≥2. ThenG is said to have an ascending star subgraph decomposition ifG can be decomposed inton subgraphsG1,G2, ...,Gn such that eachGi is a star of sizei with 1≤i≤n. We shall prove in this paper that a star forest with size
$$\left( {n_2^ + 1} \right)$$
, possesses an ascending star subgraph decomposition if the size of each component is at leastn, which is stronger than the conjecture proposed by Y. Alavi, A. J. Boals, G. Chartrand, P. Erdős and O. R. Oellermann.
17981178
An improved ellipse propagation model for location estimation in facilitating ubiquitous computing
Positioning is a crucial technology for ubiquitous computing. A directional propagation model - the ellipse propagation model (EPM) is proposed by our research group for locating a mobile station (MS) within a radio cellular network with an accuracy that can enable a number of location based services to realize ubiquitous computing. By using a geometric algorithm, the location of the mobile station can be estimated. However, since one parameter in our geometric algorithm is fixed, errors may be induced as the surrounding environment changes. In view of this, we would like to propose a new algorithm - the iterative algorithm to provide the positioning based on EPM. With the technical support of two local mobile phone operators, we have conducted a series of experiments using real data and experiment results showed that the proposed iterative algorithm outperforms the geometric algorithm by a good margin of 18% in terms of average error.
11738299
Optimizing parallel execution of detailed wireless network simulation
With parallel and discrete event simulation (PDES) techniques, the runtime performance of detailed wireless network simulation can be improved significantly without compromising fidelity of the simulation results. However, modelling characteristics of wireless communications such as signal propagation and interference may severely hinder the potential speedup yielded by PDES. This paper proposes various optimization techniques to address three major concerns in achieving efficient parallel execution of wireless network simulation: i.e., (1) reducing communication and computation overhead of simulating signal propagation across multiple logical processes; (2) reducing synchronization overhead among logical processes; (3) minimizing event scheduling overhead within individual logical processes. These techniques have been implemented in a parallel version of GloMoSim and QualNet. The experimental results with mobile ad hoc networking scenarios demonstrate that the proposed optimization techniques can improve the performance of parallel wireless network simulation by up to an order of magnitude.