45918891
Certified Electronic Mail
This paper examines certified mail delivery in postal systems and derives the essential requirements that may be met by a service called certified electronic mail. Protocols are presented to demonstrate how various flavours of certified electronic mail services may be implemented.
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.
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.
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.
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.
1326222
Scalable simulation of large-scale wireless networks with bounded inaccuracies
Discrete event network simulators have emerged as popular tools for verification and performance evaluation for various wireless networks. Nevertheless, the desire to model such networks at high fidelity implies high computational costs, prohibiting most researchers from simulating wireless networks with thousands of nodes. There have been attempts on performance optimizations for large-scale wireless network simulation, but they have not appropriately modeled accumulation of weak interference, thereby suffering inaccuracies which may be magnified by upper layer protocols. This paper presents analysis of the effects of common optimization techniques for large-scale wireless network simulation on the overall network performance and also proposes modifications and novel techniques that introduce only limited inaccuracies or no additional inaccuracy at all. The study quantifies the effects of those optimizations on the simulation results for given thresholds and network parameters, and also identifies thresholds tolerable to most network studies. The experimental results show that these optimizations can improve the runtime performance of an already efficient wireless network simulator substantially, by a factor of up to 55 for wireless networks with 3200 nodes without compromising accuracy of the simulation results.
17429132
Rule-base technique for component adaptation to support QoS-based reconfiguration
Many critical application systems require reconfigurability in order to adapt under changing environment. To achieve system reconfigurability, it is possible to use adaptation mechanisms that are external to components or to use parameterized components. This paper focuses on making components reconfigurable in terms of QoS tradeoffs. We propose a new component parameterization technique which can transform individual components to reconfigurable ones such that they can support various QoS tradeoffs to achieve overall system QoS requirements. The parameterized components can be used to develop both statically and dynamically reconfigurable systems. The proposed technique is rule based, which provides flexibility and extensibility to enhance and improve the technique. A tool set has been developed based on the proposed technique to achieve semi-automated component parameterization.
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.
6466084
Architecture Sensitive Database Design: Examples from the Columbia Group
In this article, we discuss how different aspects of modern CPU architecture can be effectively used by database systems. While we shall try to cover most important aspects of modern architectures, we shall not aim to provide an exhaustive survey of the literature. Rather, we will use examples from our own recent work to illustrate the principles involved. While there is related work on using other components of modern machines such as graphics cards and intelligent disk controllers for database work, we limit our discussion here to just a single CPU and the memory hierarchy (excluding disks). In recent years the primary focus of database performance research has fundamentally shifted from disks to main memory. Systems with a very large main memory allow a database’s working set to fit in RAM. At the same time processors have continued to double in performance roughly every eighteen months in line with “Moore’s Law,” while memory speed improvements have been marginal. The CPU now spends many hundreds of cycles waiting for data to arrive from main memory, and database workloads are often memory-bound. Because of this bottleneck, database research at Columbia and elsewhere has focused on effectively using the cache hierarchy to improve database performance. Changes in processor technology have also influenced database research. Modern processors feature a very long pipeline, which helps to provide better performance. It also results in a higher branch misprediction penalty, because the pipeline must be flushed and restarted when a branch is mispredicted. Modern CPUs provide the database programmer with a rich instruction set. Using specialized instructions, such as SIMD instructions, database performance can be improved by allowing a degree of parallelism and eliminating some conditional branch instructions, thus reducing the impact of branch mispredictions.
557343
MAYA: Integrating hybrid network modeling to the physical world
The flourish of large-scale network applications across the Internet and or MANET has raised a challenge to network modeling environments that support experimentation and analysis of close interactions between real applications and network dynamics. To facilitate such experimentations, this paper presents MAYA, a multiparadigm network modeling framework including discrete event models, analytical models and physical network interfaces, together with its illustrative implementation using QualNet, fluid flow TCP model and physical network interface. MAYA framework allows users to interface simulated networks directly with physical networks, while attaining real-time constraints even for large-scale networks by incorporating above multiparadigm network modeling techniques. It also gives user the flexibility to emulate applications on nodes in both real and simulated networks. Experiments are conducted to validate the interoperation of QualNet and fluid flow model, to examine the performance of MAYA as well as to evaluate the optimization techniques, namely interleaved execution of fluid flow model and causality-preserve realtime synchronization relaxation. Experimental results indicate that MAYA is a scalable and extensible solution to modeling of close interactions between real application and network dynamics.