9836982
Undeniable Mobile Billing Schemes
An undeniable mobile billing system allows a mobile network service provider to bill its subscribers with trustworthy evidences. Chen, Jan and Chen proposed such a billing system by introducing a trusted third party - Observer and exploiting a hash chain mechanism. In their system, the Observer provides call time evidence to both cellular carriers and subscribers for billing. In this paper, we first identify some vulnerabilities in their mobile billing system. Then, we propose an undeniable billing scheme based on a proper combination of digital signature and hash chain mechanism. The proposed scheme can achieve authentication, non-repudiation, and fairness, which are desirable security requirements for an undeniable mobile billing system.
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.
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.
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.
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.
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
1140356
Every 3-connected, essentially 11-connected line graph is Hamiltonian
Thomassen conjectured that every 4-connected line graph is Hamiltonian. A vertex cut X of G is essential if G - X has at least two non-trivial components. We prove that every 3-connected, essentially 11-connected line graph is Hamiltonian. Using Ryjacek's line graph closure, it follows that every 3-connected, essentially 11-connected claw-free graph is Hamiltonian.
2261663
A selector method for providing mobile location estimation services within a radio cellular network
Mobile location estimation or mobile positioning is becoming an important service for a mobile phone network. It is well-known that GPS can provide accurate location estimation, but it is also a known fact that GPS does not perform well in urban areas like downtown New York and cities like Hong Kong. Then many mobile location estimation approaches based on radio cellular networks have been proposed to compensate the problem of the lost of GPS signals in providing location services to mobile users in metropolitan areas. In this paper, we present a selector method with the linear discriminant analysis (LDA) among different kinds of mobile location estimation technologies we had proposed in previous work in order to combine their merits, then provide a more accurate estimation for location services. We build up a three-level binary tree to classify these four algorithms. These three levels are named as Stat-Geo level, CG-nonCG level and CT-EPM level. And these success ratios of these three levels are 85.22%, 88.45% and 88.89% respectively. We have tested our selector method with real data taken in Hong Kong and it is proven that it outperforms other existing location estimation algorithms among different kinds of terrains.
1706470
Regularized B-spline network and its application to heart arrhythmia classification
This paper presents an effective learning scheme that combines B-spline modeling and regularized neural networks. Essential issues of structural design and learning process are discussed. Regularization theory is leveraged to design the topological structure of the network. A training algorithm is derived for the learning of both synaptic weights and B-spline coefficients. The approach is then applied to the medical problem of heart arrhythmia detection, particularly the detection of premature ventricular contraction. Promising results demonstrate the potential benefits of the proposed method.