Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 17611 - 17640 of 20645

Full-Text Articles in Entire DC Network

Adaptive Critic Neural Network Force Controller For Atomic Force Microscope-Based Nanomanipulation, Qinmin Yang, Jagannathan Sarangapani Oct 2006

Adaptive Critic Neural Network Force Controller For Atomic Force Microscope-Based Nanomanipulation, Qinmin Yang, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Automating the task of nanomanipulation is extremely important since it is tedious for humans. This paper proposes an atomic force microscope (AFM) based force controller to push nano particles on the substrates. A block phase correlation-based algorithm is embedded into the controller for the compensation of the thermal drift which is considered as the main external uncertainty during nanomanipulation. Then, the interactive forces and dynamics between the tip and the particle, particle and the substrate are modeled and analyzed. Further, an adaptive critic NN controller based on adaptive dynamic programming algorithm is designed and the task of pushing nano particles …

Go to article

India’S Rise As A Software Power: Governmental Policy Factors, Tad Drozdowski, Hai Huynh, Brian Lininger, Yicheng Peng, Naruedom Sakulyong Oct 2006

India’S Rise As A Software Power: Governmental Policy Factors, Tad Drozdowski, Hai Huynh, Brian Lininger, Yicheng Peng, Naruedom Sakulyong

Engineering and Technology Management Student Projects

The Indian government’s policies toward an open, global market, support of educational institutions, and enhancement of appropriate infrastructure helped enable their software industry to become critical components of India’s economic growth in the 1990s. The Technical, Organizational, and Personal perspective (T, O, and P) model is utilized to examine different affects that each perspective, inclusive of government policies, has on a socio-technical system (Software development in India). The Indian government has provided substantial economic liberalization to support their software industries, though continued reform is necessary to ensure that they remain a software superpower.

Go to article

Fast Tracking Of Near-Duplicate Keyframes In Broadcast Domain With Transitivity Propagation, Chong-Wah Ngo, Wan-Lei Zhao, Yu-Gang Jiang Oct 2006

Fast Tracking Of Near-Duplicate Keyframes In Broadcast Domain With Transitivity Propagation, Chong-Wah Ngo, Wan-Lei Zhao, Yu-Gang Jiang

Research Collection School Of Computing and Information Systems

The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this paper, we propose a novel approach for the discovery and tracking of NDK pairs and threads in the broadcast domain. The detection of NDKs in a large data set is a challenging task due to the fact that when the data set increases linearly, the computational cost increases in a quadratic speed, and so does the number of false alarms. This paper explores the symmetric and transitive nature of near-duplicate for the effective …

Go to article

Critical Success Factors For Erp Implementation And Upgrade, Fiona Fui-Hoon Nah, Santiago Delgado Oct 2006

Critical Success Factors For Erp Implementation And Upgrade, Fiona Fui-Hoon Nah, Santiago Delgado

Research Collection School Of Computing and Information Systems

Seven categories of critical success factors were identified from the ERP literature: (1) business plan and vision; (2) change management, (3) communication; (4) ERP team composition, skills and compensation; (5) management support and championship; (6) project management, (7) system analysis, selection and technical implementation. We conducted a case study of two organizations that had implemented and upgraded ERP systems. We adopted Markus and Tanis' four-phase model and compared the importance of these critical success factors across the phases of ERP implementation and upgrade. The importance of these factors across the phases of ERP implementation and upgrade is very similar. 'Business …

Go to article

Service Pattern Discovery Of Web Service Mining In Web Service Registry-Repository, Qianhui Althea Liang, Jen-Yao Chung, Steven M. Miller, Yang Ouyang Oct 2006

Service Pattern Discovery Of Web Service Mining In Web Service Registry-Repository, Qianhui Althea Liang, Jen-Yao Chung, Steven M. Miller, Yang Ouyang

Research Collection School Of Computing and Information Systems

This paper presents and elaborates the concept of Web service usage patterns and pattern discovery through service mining. We define three different levels of service usage data: i) user request level, ii) template level and iii) instance level. At each level, we investigate patterns of service usage data and the discovery of these patterns. An algorithm for service pattern discovery at the template level is presented. We show the system architecture of a service-mining enabled service registry repository. Web service patterns, pattern discovery and pattern mining supports the discovery and composition of complex services, which in turn supports the application …

Go to article

Two-Instant Reallocation In Two-Echelon Spare Parts Inventory Systems, Huawei Song, Hoong Chuin Lau Oct 2006

Two-Instant Reallocation In Two-Echelon Spare Parts Inventory Systems, Huawei Song, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we study the problem of deciding when and how to perform reallocation of existing spare parts in a multi-echelon reparable item inventory system. We present a mathematical model that solves the problem when there are two reallocation instants, in response to the open challenge post by Cao and Silver(2005) to consider two or more possible reallocations within a replenishment cycle.

Go to article

Audio Similarity Measure By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo, Cuihua Fang, Xiaoou Chen, Jianguo Xiao Oct 2006

Audio Similarity Measure By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo, Cuihua Fang, Xiaoou Chen, Jianguo Xiao

Research Collection School Of Computing and Information Systems

This paper proposes a new approach for the similarity measure and ranking of audio clips by graph modeling and matching. Instead of using frame-based or salient-based features to measure the acoustical similarity of audio clips, segment-based similarity is proposed. The novelty of our approach lies in two aspects: segment-based representation, and the similarity measure and ranking based on four kinds of similarity factors. In segmentbased representation, segments not only capture the change property of audio clip, but also keep and present the change relation and temporal order of audio features. In the similarity measure and ranking, four kinds of similarity …

Go to article

Natural Document Clustering By Clique Percolation In Random Graphs, Wei Gao, Kam-Fai Wong Oct 2006

Natural Document Clustering By Clique Percolation In Random Graphs, Wei Gao, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/or the probability distribution of clustered data. As a result, the clustering effects tend to be unnatural and stray away more or less from the intrinsic grouping nature among the documents in a corpus. We propose a novel graph-theoretic technique called Clique Percolation Clustering (CPC). It models clustering as a process of enumerating adjacent maximal cliques in a random graph that unveils inherent structure of the underlying data, in which we unleash the commonly practiced constraints in …

Go to article

Extracting Link Chains Of Relationship Instances From A Website, Myo-Myo Naing, Ee Peng Lim, Roger Hsiang-Li Chiang Oct 2006

Extracting Link Chains Of Relationship Instances From A Website, Myo-Myo Naing, Ee Peng Lim, Roger Hsiang-Li Chiang

Research Collection School Of Computing and Information Systems

Web pages from a Web site can often be associated with concepts in an ontology, and pairs of Web pages also can be associated with relationships between concepts. With such associations, the Web site can be searched, browsed, or even reorganized based on the concept and relationship labels of its Web pages. In this article, we study the link chain extraction problem that is critical to the extraction of Web pages that are related. A link chain is an ordered list of anchor elements linking two Web pages related by some semantic relationship. We propose a link chain extraction method …

Go to article

Privacy Enhanced Superdistribution Of Layered Content With Trusted Access Control, Daniel J. T. Chong, Robert H. Deng Oct 2006

Privacy Enhanced Superdistribution Of Layered Content With Trusted Access Control, Daniel J. T. Chong, Robert H. Deng

Research Collection School Of Computing and Information Systems

Traditional superdistribution approaches do not address consumer privacy issues and also do not reliably prevent the malicious consumer from indiscriminately copying and redistributing the decryption keys or the decrypted content. The layered nature of common digital content can also be exploited to efficiently provide the consumer with choices over the quality of the content, allowing him/her to pay less for lower quality consumption and vice versa. This paper presents a system that superdistributes encrypted layered content and (1) allows the consumer to select a quality level at which to decrypt and consume the content; (2) prevents the merchant from knowing …

Go to article

Viz: A Visual Analysis Suite For Explaining Local Search Behavior, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau Oct 2006

Viz: A Visual Analysis Suite For Explaining Local Search Behavior, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algorithms are heuristic-based, it is hard to understand how to improve or tune them. We propose an interactive visualization tool, VIZ, meant for understanding the behavior of local search. VIZ uses animation of abstract search trajectories with other visualizations which are also animated in a VCR-like fashion to graphically playback the algorithm behavior. It combines generic visualizations applicable on arbitrary algorithms with algorithm and problem specific visualizations. We use a variety of techniques such as …

Go to article

Effects Of Gap Open And Gap Extension Penalties, Hyrum Carroll, Mark J. Clement, Perry Ridge, Quinn O. Snell Oct 2006

Effects Of Gap Open And Gap Extension Penalties, Hyrum Carroll, Mark J. Clement, Perry Ridge, Quinn O. Snell

Faculty Publications

Fundamental to multiple sequence alignment algorithms is modeling insertions and deletions (gaps). The most prevalent model is to use gap open and gap extension penalties. While gap open and gap extension penalties are well understood conceptually, their effects on multiple sequence alignment, and consequently on phylogeny scores are not as well understood. We use exhaustive phylogeny searching to explore the effects of varying the gap open and gap extension penalties for three nuclear ribosomal data sets. Particular attention is given to optimal phylogeny scores for 200 alignments of a range of gap open and gap extension penalties and their respective …

Go to article

Pharmacogenomics: Analyzing Snps In The Cyp2d6 Gene Using Amino Acid Properties, Wesley A. Beckstead, Mark J. Clement, Mark Ebbert, David Mcclellan, Timothy O'Connor Oct 2006

Pharmacogenomics: Analyzing Snps In The Cyp2d6 Gene Using Amino Acid Properties, Wesley A. Beckstead, Mark J. Clement, Mark Ebbert, David Mcclellan, Timothy O'Connor

Faculty Publications

Each year people suffer from complications of adverse drug reactions, but with pharmacogenomics there is hope to prevent thousands of these people from suffering or dying needlessly. The CYP2D6 gene is responsible for metabolizing a large portion of these drugs. Because of the gene’s importance, various approaches have been taken to analyze CYP2D6 and single nucleotide polymorphisms (SNPs) throughout its sequence. This study introduces a novel method to analyze the effects of SNPs on encoded protein complexes by focusing on the biochemical properties of each nonsynonymous substitution using the program TreeSAAP. We apply this technique to SNPs found in the …

Go to article

Performance Benchmarks For Custom Applications: Considerations And Strategies, Braulio J. Cabral Sep 2006

Performance Benchmarks For Custom Applications: Considerations And Strategies, Braulio J. Cabral

Regis University Student Publications (comprehensive collection)

The motivation for this research came from the need to solve a problem affecting not only the company used in this study, but also the many other companies in the information technology industry having similar problem: how to conduct performance benchmarks for custom applications in an effective, unbiased, and accurate manner. This paper presents the pros and cons of existing benchmark methodologies. It proposes a combination of the best characteristics of these benchmarks into a methodology that addresses the problem from an application perspective considering the overall synergy between operating system and software. The author also discusses a software design …

Go to article

Setting Up Information Technology Structures For Trade Unions, Harvey Hecht Sep 2006

Setting Up Information Technology Structures For Trade Unions, Harvey Hecht

Regis University Student Publications (comprehensive collection)

Trade Unions also know as Labor Unions are non-profit organizations whose purpose is to represent workers in their work place, negotiate collective bargaining agreements, and enforce those agreements while representing its membership. In the past three decades, United States Trade Union populations have been dropping. One of the reasons behind the reduction is the lack of leadership to keep infrastructure contemporary and able to meet the changing pace of business. International Union has been working on different projects in an effort to change how they do business. One approach International Union exercised is upgrading its larger premier locals such as …

Go to article

An Automated Method For Rapid Identification Of Putative Gene Family Members In Plants, Ronald L. Frank, Ajay Mane, Fikret Erçal Sep 2006

An Automated Method For Rapid Identification Of Putative Gene Family Members In Plants, Ronald L. Frank, Ajay Mane, Fikret Erçal

Biological Sciences Faculty Research & Creative Works

Background: Gene duplication events have played a significant role in genome evolution, particularly in plants. Exhaustive searches for all members of a known gene family as well as the identification of new gene families has become increasingly important. Subfunctionalization via changes in regulatory sequences following duplication (adaptive selection) appears to be a common mechanism of evolution in plants and can be accompanied by purifying selection on the coding region. Such negative selection can be detected by a bias toward synonymous over nonsynonymous substitutions. However, the process of identifying this bias requires many steps usually employing several different software programs. We …

Go to article

Improving Error Discovery Using Guided Model Checking, Neha Shyam Rungta Sep 2006

Improving Error Discovery Using Guided Model Checking, Neha Shyam Rungta

Theses and Dissertations

State exploration in directed software model checking is guided using a heuristic function to move states near errors to the front of the search queue. Distance heuristic functions rank states based on the number of transitions needed to move the current program state into an error location. Lack of calling context information causes the heuristic function to underestimate the true distance to the error; however, inlining functions at call sites in the control flow graph to capture calling context leads to exponential growth in the computation. This paper presents a new algorithm that implicitly inlines functions at call sites to …

Go to article

Pervasive Data Access In Wireless And Mobile Computing Environments, Ken C. K. Lee, Wang-Chien Lee, Sanjay Kumar Madria Sep 2006

Pervasive Data Access In Wireless And Mobile Computing Environments, Ken C. K. Lee, Wang-Chien Lee, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

The rapid advance of wireless and portable computing technology has brought a lot of research interests and momentum to the area of mobile computing. One of the research focus is on pervasive data access. with wireless connections, users can access information at any place at any time. However, various constraints such as limited client capability, limited bandwidth, weak connectivity, and client mobility impose many challenging technical issues. In the past years, tremendous research efforts have been put forth to address the issues related to pervasive data access. A number of interesting research results were reported in the literature. This survey …

Go to article

Tools And Algorithms To Advance Interactive Intrusion Analysis Via Machine Learning And Information Retrieval, Javed Aslam, Sergey Bratus, Virgil Pavlu Sep 2006

Tools And Algorithms To Advance Interactive Intrusion Analysis Via Machine Learning And Information Retrieval, Javed Aslam, Sergey Bratus, Virgil Pavlu

Computer Science Technical Reports

We consider typical tasks that arise in the intrusion analysis of log data from the perspectives of Machine Learning and Information Retrieval, and we study a number of data organization and interactive learning techniques to improve the analyst's efficiency. In doing so, we attempt to translate intrusion analysis problems into the language of the abovementioned disciplines and to offer metrics to evaluate the effect of proposed techniques. The Kerf toolkit contains prototype implementations of these techniques, as well as data transformation tools that help bridge the gap between the real world log data formats and the ML and IR data …

Go to article

Multi-Learner Based Recursive Supervised Training, Laxmi R. Iyer, Kiruthika Ramanathan, Sheng-Uei Guan Sep 2006

Multi-Learner Based Recursive Supervised Training, Laxmi R. Iyer, Kiruthika Ramanathan, Sheng-Uei Guan

Research Collection School Of Computing and Information Systems

In this paper, we propose the multi-learner based recursive supervised training (MLRT) algorithm, which uses the existing framework of recursive task decomposition, by training the entire dataset, picking out the best learnt patterns, and then repeating the process with the remaining patterns. Instead of having a single learner to classify all datasets during each recursion, an appropriate learner is chosen from a set of three learners, based on the subset of data being trained, thereby avoiding the time overhead associated with the genetic algorithm learner utilized in previous approaches. In this way MLRT seeks to identify the inherent characteristics of …

Go to article

Multi-Learner Based Recursive Supervised Training, Laxmi R. Iyer, Kiruthika Ramanathan, Sheng-Uei Guan Sep 2006

Multi-Learner Based Recursive Supervised Training, Laxmi R. Iyer, Kiruthika Ramanathan, Sheng-Uei Guan

Research Collection School Of Computing and Information Systems

In this paper, we propose the multi-learner based recursive supervised training (MLRT) algorithm, which uses the existing framework of recursive task decomposition, by training the entire dataset, picking out the best learnt patterns, and then repeating the process with the remaining patterns. Instead of having a single learner to classify all datasets during each recursion, an appropriate learner is chosen from a set of three learners, based on the subset of data being trained, thereby avoiding the time overhead associated with the genetic algorithm learner utilized in previous approaches. In this way MLRT seeks to identify the inherent characteristics of …

Go to article

Masking Page Reference Patterns In Encryption Databases On Untrusted Storage, Xi Ma, Hwee Hwa Pang, Kian-Lee Tan Sep 2006

Masking Page Reference Patterns In Encryption Databases On Untrusted Storage, Xi Ma, Hwee Hwa Pang, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

To support ubiquitous computing, the underlying data have to be persistent and available anywhere-anytime. The data thus have to migrate from devices that are local to individual computers, to shared storage volumes that are accessible over open network. This potentially exposes the data to heightened security risks. In particular, the activity on a database exhibits regular page reference patterns that could help attackers learn logical links among physical pages and then launch additional attacks. We propose two countermeasures to mitigate the risk of attacks initiated through analyzing the shared storage server’s activity for those page patterns. The first countermeasure relocates …

Go to article

Three Architectures For Trusted Data Dissemination In Edge Computing, Shen-Tat Goh, Hwee Hwa Pang, Robert H. Deng, Feng Bao Sep 2006

Three Architectures For Trusted Data Dissemination In Edge Computing, Shen-Tat Goh, Hwee Hwa Pang, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

Edge computing pushes application logic and the underlying data to the edge of the network, with the aim of improving availability and scalability. As the edge servers are not necessarily secure, there must be provisions for users to validate the results—that values in the result tuples are not tampered with, that no qualifying data are left out, that no spurious tuples are introduced, and that a query result is not actually the output from a different query. This paper aims to address the challenges of ensuring data integrity in edge computing. We study three schemes that enable users to check …

Go to article

A Methodology For Structured Object-Oriented Elicitation And Analysis Of Temporal Constraints In Hardware/Software Co-Analysis And Co-Design Of Real-Time Systems, Sun Yan, Xiaoqing Frank Liu, Bruce M. Mcmillin Sep 2006

A Methodology For Structured Object-Oriented Elicitation And Analysis Of Temporal Constraints In Hardware/Software Co-Analysis And Co-Design Of Real-Time Systems, Sun Yan, Xiaoqing Frank Liu, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

The hardware/software co-design of a high-quality real-time system relies heavily on the modeling of both the hardware and software components from three aspects: structures, functionalities, and constraints, especially the temporal constraints. However, there is not a systematic process for the elicitation and analysis of temporal constraints in hardware/software co-design. Furthermore, existing object-oriented methods provide no means for the explicit specification of system/component constraints in object models. This paper presents a systematic methodology for structured object-oriented analysis and specification of temporal constraints in hardware/software co-analysis and co-design using an extended High-Order Object-Oriented Modeling Technique (HOOMT). This methodology hierarchically elicits and analyzes …

Go to article

Cuhk At Imageclef 2005: Cross-Language And Cross Media Image Retrieval, Steven Hoi, Jianke Zhu, Michael R. Lyu Sep 2006

Cuhk At Imageclef 2005: Cross-Language And Cross Media Image Retrieval, Steven Hoi, Jianke Zhu, Michael R. Lyu

Research Collection School Of Computing and Information Systems

In this paper, we describe our studies of cross-language and cross-media image retrieval at the ImageCLEF 2005. This is the first participation of our CUHK (The Chinese University of Hong Kong) group at ImageCLEF. The task in which we participated is the “bilingual ad hoc retrieval” task. There are three major focuses and contributions in our participation. The first is the empirical evaluation of language models and smoothing strategies for cross-language image retrieval. The second is the evaluation of cross-media image retrieval, i.e., combining text and visual contents for image retrieval. The last is the evaluation of bilingual image retrieval …

Go to article

Mining Rdf Metadata For Generalized Association Rules, Tao Jiang, Ah-Hwee Tan Sep 2006

Mining Rdf Metadata For Generalized Association Rules, Tao Jiang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

In this paper, we present a novel frequent generalized pattern mining algorithm, called GP-Close, for mining generalized associations from RDF metadata. To solve the over-generalization problem encountered by existing methods, GP-Close employs the notion of generalization closure for systematic over-generalization reduction. Empirical experiments conducted on real world RDF data sets show that our method can substantially reduce pattern redundancy and perform much better than the original generalized association rule mining algorithm Cumulate in term of time efficiency.

Go to article

Discovering Image-Text Associations For Cross-Media Web Information Fusion, Tao Jiang, Ah-Hwee Tan Sep 2006

Discovering Image-Text Associations For Cross-Media Web Information Fusion, Tao Jiang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

The diverse and distributed nature of the information published on the World Wide Web has made it difficult to collate and track information related to specific topics. Whereas most existing work on web information fusion has focused on multiple document summarization, this paper presents a novel approach for discovering associations between images and text segments, which subsequently can be used to support cross-media web content summarization. Specifically, we employ a similarity-based multilingual retrieval model and adopt a vague transformation technique for measuring the information similarity between visual features and textual features. The experimental results on a terrorist domain document set …

Go to article

An Instance-Based Structured Object Oriented Method For Co-Analysis/Co-Design Of Concurrent Embedded Systems, Matt Ryan, Xiaoqing Frank Liu, Bruce M. Mcmillin, Ying Cheng, Sule Simsek Sep 2006

An Instance-Based Structured Object Oriented Method For Co-Analysis/Co-Design Of Concurrent Embedded Systems, Matt Ryan, Xiaoqing Frank Liu, Bruce M. Mcmillin, Ying Cheng, Sule Simsek

Computer Science Faculty Research & Creative Works

The current object-oriented class-based approaches to hardware/software co-analysis/co-design of embedded systems are limited in their abilities to properly capture the structure of individual instances of hardware and software components and their interactions. This paper discusses a methodology to extend a structured objectoriented hardware/software co-design methodology based on the High Order Object-oriented Modeling Technique (HOOMT) to incorporate instance-based object and behavioral models. The instance-based structured object-oriented methodology will enable description of a system's structure based on individual instances of hardware and software components and specification of the interactions among them. In addition, lattices are introduced to specify the concurrent behavior of …

Go to article

Wireless Indoor Positioning System With Enhanced Nearest Neighbors In Signal Space Algorithm, Quang Tran, Juki Wirawan Tantra, Ah-Hwee Tan, Ah-Hwee Tan, Kin-Choong Yow, Dongyu Qiu Sep 2006

Wireless Indoor Positioning System With Enhanced Nearest Neighbors In Signal Space Algorithm, Quang Tran, Juki Wirawan Tantra, Ah-Hwee Tan, Ah-Hwee Tan, Kin-Choong Yow, Dongyu Qiu

Research Collection School Of Computing and Information Systems

With the rapid development and wide deployment of wireless Local Area Networks (WLANs), WLAN-based positioning system employing signal-strength-based technique has become an attractive solution for location estimation in indoor environment. In recent years, a number of such systems has been presented, and most of the systems use the common Nearest Neighbor in Signal Space (NNSS) algorithm. In this paper, we propose an enhancement to the NNSS algorithm. We analyze the enhancement to show its effectiveness. The performance of the enhanced NNSS algorithm is evaluated with different values of the parameters. Based on the performance evaluation and analysis, we recommend some …

Go to article

Practical Private Data Matching Deterrent To Spoofing Attacks, Yanjiang Yang, Robert H. Deng, Feng Bao Sep 2006

Practical Private Data Matching Deterrent To Spoofing Attacks, Yanjiang Yang, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

Private data matching between the data sets of two potentially distrusted parties has a wide range of applications. However, existing solutions have substantial weaknesses and do not meet the needs of many practical application scenarios. In particular, practical private data matching applications often require discouraging the matching parties from spoofing their private inputs. In this paper, we address this challenge by forcing the matching parties to "escrow" the data they use for matching to an auditorial agent, and in the "after-the-fact" period, they undertake the liability to attest the genuineness of the escrowed data.

Go to article

First Prev Next Last