Two-Party Privacy-Preserving Agglomerative Document Clustering
Document clustering is a powerful data mining technique to analyze the large amount of documents and structure large sets of text or hypertext documents. Many organizations or companies want to share their documents in a similar theme to get the joint benefits. However, it also brings the problem of sensitive information leakage without consideration of privacy. In this paper, we propose a cryptography-based framework to do the privacy-preserving document clustering among the users under the distributed environment: two parties, each having his private documents, want to collaboratively execute agglomerative document clustering without disclosing their private contents.

title: Observations on Non-repudiation
abstract: 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.

title: Efficient Signature Validation Based on a New PKI
abstract: 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.

title: Securing digital signatures for non-repudiation
abstract: 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.

title: Non-Repudiation in Electronic Commerce
abstract: 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.  One-Way Sequential Link Approach.   Achieving Fair Non-Repudiation - Factors against Fair Non-Repudiation. Approaches for Fair Non-Repudiation.  Using Light-Weighted On-Line TTP.  Using Off-Line TTP without Timely Termination.  Using Off-Line TTP with Timely Termination.  Using In-Line TTP for Timely Delivery.  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.  ISO's Non-Repudiation Mechanisms - Overview of ISO/IEC 13888. Mechanisms Using Symmetric Techniques. Mechanisms Using Asymmetric Techniques. Time-Stamping Evidence.  Case Studies - Non-Repudiation in Electronic Payment. Undeniable Billing in Mobile Communication.  Towards Formal Verification of Non-Repudiation - The SVO Logic. Formalization of Non-Repudiation. Verification of a Non-Repudiation Protocol.

title: An intensive survey of fair non-repudiation protocols
abstract: 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.

title: Improving Database Performance on Simultaneous Multithreading Processors
abstract: Simultaneous multithreading (SMT) allows multiple threads to supply instructions to the instruction pipeline of a superscalar processor. Because threads share processor resources, an SMT system is inherently different from a multiprocessor system and, therefore, utilizing multiple threads on an SMT processor creates new challenges for database implementers.We investigate three thread-based techniques to exploit SMT architectures on memory-resident data. First, we consider running independent operations in separate threads, a technique applied to conventional multi-processor systems. Second, we describe a novel implementation strategy in which individual operators are implemented in a multi-threaded fashion. Finally, we introduce a new data-structure called a work-ahead set that allows us to use one of the threads to aggressively preload data into the cache.We evaluate each method with respect to its performance, implementation complexity, and other measures. We also provide guidance regarding when and how to best utilize the various threading techniques. Our experimental results show that by taking advantage of SMT technology we achieve a 30% to 70% improvement in throughput over single threaded implementations on in-memory database operations.

title: Image Rectification for Stereoscopic Visualization Without 3D Glasses
abstract: There exist various methods for stereoscopic viewing of images, most requiring that a viewer wears some special glasses. Recent technology developments have resulted in displays that enable 3D viewing without glasses. In this paper, we present results from our proposed approach to automatic rectification of two images of the same scene captured by cameras at general positions, so that the results can be viewed on a 3D display. Both simulated and real data experiments are presented.

title: Understanding Human-Computer Interactions in Map Revision
abstract: It is difficult to track, parse and model human-computer interactions during editing and revising of documents, but it is necessary if we are to develop automated technologies that will aid or replace humans. This paper introduces a system for accessing and recording a stream of events related to human actions in a real-time cartographic map revision system. The recorded events are parsed into a sequence of meaningful user actions and an action representation in XML format is generated. We also report results of experiments on predicting user actions such as view changes, edits, road tracking/production using hidden Markov models.

title: Verification - a method of enhancing the recognizers of isolated and touching handwritten numerals
abstract: This paper investigates verification schemes and their applications to the recognition of both isolated and touching handwritten numerals. Definitions and functionality analyses of the verifiers are given. The measurement of precision rate is used to assess the system reliability in a class-specific manner. Verification-enhanced systems are proposed with extensive experiments conducted on both isolated and touching numerals. Two databases for touching numerals are built/organized to serve as standard data sets. Experimental results indicate a substantial improvement in system precision rates by the verification scheme, which proves the effectiveness of the proposed systems and justifies the important role of verifiers in OCR systems.

title: A selector method for providing mobile location estimation services within a radio cellular network
abstract: 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.