18701856
Protecting RFID communications in supply chains
Recent years have seen much growing attention on RFID security. However, little work has been performed to address the security issues in the context of supply chain management, which is exactly the major field for RFID applications. Existing RFID solutions cannot be applied directly in this field because of a set of special RFID security requirements to be addressed for supply chain management. The major contribution of this paper is to identify the unique set of security requirements in supply chains and to propose a practical design of RFID communication protocols that satisfy the security requirements.
36131731
Disclosure Risk in Dynamic Two-Dimensional Contingency Tables (Extended Abstract)
Two-dimensional contingency tables are central products of many information organizations such as statistical agencies, census bureaus, and health insurance information agencies. In a contingency table, any sensitive information about individuals must be protected, while some aggregated information can be released. The disclosure risk is that the aggregated information can be used to infer some sensitive information about individuals. Since the disclosure of sensitive information may compromise privacy, confidentiality, and national interests, one needs to carefully assess the latent risk of disclosure and take effective methods to protect the data.
26456568
Disclosure Analysis for Two-Way Contingency Tables
Disclosure analysis in two-way contingency tables is important in categorical data analysis. The disclosure analysis concerns whether a data snooper can infer any protected cell values, which contain privacy sensitive information, from available marginal totals (i.e., row sums and column sums) in a two-way contingency table. Previous research has been targeted on this problem from various perspectives. However, there is a lack of systematic definitions on the disclosure of cell values. Also, no previous study has been focused on the distribution of the cells that are subject to various types of disclosure. In this paper, we define four types of possible disclosure based on the exact upper bound and/or the lower bound of each cell that can be computed from the marginal totals. For each type of disclosure, we discover the distribution pattern of the cells subject to disclosure. Based on the distribution patterns discovered, we can speed up the search for all cells subject to disclosure.
18397167
New Paradigm of Inference Control with Trusted Computing
The database server is a crucial bottleneck in traditional inference control architecture, as it enforces highly computation-intensive auditing for all users who query the protected database. As a result, most auditing methods, though rigorously studied, can never be implemented in practice for protecting largescale real-world database systems. To shift this paradigm, we propose a new inference control architecture that will entrust inference control to each users platform, provided that the platform is equipped with trusted computing technology. The trusted computing technology is designed to attest the state of a users platform to the database server, so as to assure the server that inference control could be enforced as expected. A generic protocol is proposed to formalize the interactions between the users platform and database server. Any existing inference control technique can work with our protocol, for which the security properties are formally proven. Since each user's platform enforces inference control for its own queries, our solution avoids the bottleneck.
14671442
An Approach to Outsourcing Data Mining Tasks while Protecting Business Intelligence and Customer Privacy
Data mining is playing an important role in decision making. It is beneficial to outsource data mining tasks if an organization does not have required expertise in-house. However, the organization may lose business intelligence and customer privacy during this outsourcing process. In this paper, we present a Bloom filter based solution to enable organizations to outsource their tasks of mining association rules while protecting their business intelligence and customer privacy. Our approach can achieve high precision in data mining by trading-off storage requirements
45088529
Chaining watermarks for detecting malicious modifications to streaming data
Abstract Authenticating streaming data is a very important research area due to its wide range of applications. Previous technologies mainly focused on authenticating data packets at the IP layer and ensuring the robustness of the verification. These schemes usually incur large communications overhead, which is not desirable in applications with limited bandwidth. In this paper, we propose a novel fragile watermarking algorithm which verifies the integrity of streaming data at the application layer. The data are divided into groups based on synchronization points, so each group can be synchronized and any modifications made to one group only affect up to two groups. A unique watermark is embedded directly into each group to save communications bandwidth. The embedded watermark can detect as well as locate any modifications made to a data stream. To ensure the completeness of the data stream, watermarks are chained across groups so that no matter how many data are deleted, these deletions can be correctly detected. Security analysis and experimental results show that the proposed scheme can efficiently detect and locate modifications and ensure the completeness of data streams.
8622581
BrickRoad: a light-weight tool for spontaneous design of location-enhanced applications
It is difficult to design and test location-enhancedapplications. A large part of this difficulty is due to the added complexity of supporting location. Wizard of Oz (WOz) has become an effective technique for the early stage design of location-enhanced applications because it allows designers to test an application prototype bysimulating nonexistent components such as location sensing. However, existing WOz tools 1) require nontrivial effort from designers to specify how a prototype should behave before it can be tested with end users, and 2)support only limited control over application behavior during a test. BrickRoad is a WOz tool for spontaneousdesign of location-enhanced applications. It lowers the threshold to acquiring user feedback and exploring a design space. With BrickRoad, a designer does not need to specify any interaction logic and can experiment on-the-fly with different designs during testing. BrickRoad is a valuable complement to existing tool support for the early stage design of location-enhanced applications.
1371524
Continuous-time digital signal processors
In this paper, we discuss how asynchronous design techniques can be used in the implementation of continuous-time signal processors. Such processors are presented by signals developed by continuous-time analog-to-digital converters which involve no sampling, and thus do not exhibit aliasing; in addition, the resulting in-band quantization error is lower than in conventional techniques. Several design considerations are given, and preliminary experimental results are presented.
32047
Constructing a Generic Natural Language Interface for an XML Database
We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which can be quite complex and include aggregation, nesting, and value joins, among other things. This query is translated, potentially after reformulation, into an XQuery expression. The translation is based on mapping grammatical proximity of natural language parsed tokens in the parse tree of the query sentence to proximity of corresponding elements in the XML data to be retrieved. Our experimental assessment, through a user study, demonstrates that this type of natural language interface is good enough to be usable now, with no restrictions on the application domain.
11801606
Efficient communication in metacube: a new interconnection network
This paper introduces a new interconnection network for very large parallel computers called metacube (MC). An MC network has a 2-level cube structure. An MC(k,m) network connects 2(m2/sup k/+k) nodes with m + k links per node, where k is the dimension of a high-level cube and m is the dimension of low-level cubes (clusters). An MC network is a symmetric network with short diameter, easy and efficient routing similar to that of hypercubes. However, an MC network can connect more than one hundred of millions of nodes with only 6 links per node. Design of efficient routing algorithms for collective communications is the key issue for any interconnection network. In this paper we also show that total exchange (all-to-all personalized communication) can be done efficiently in metacube.
6422073
Efficient Collective Communications in Dual-Cube
The hypercube, or n-cube, has been widely used as the interconnection network in parallel computers. However, the major drawback of the hypercube is the increase in the number of communication links for each node with the increase in the total number of nodes in the system. This paper introduces a new interconnection network, namely dual-cube, for large-scale parallel computers and describes the algorithms for efficient collective communications in dual-cube. The dual-cube network mitigates the problem of increasing number of links in the large-scale hypercube network while retains hypercube's topological properties. Design of efficient routing algorithms for collective communications is the key issue for any interconnection network. In this paper, we show that the collective communications can be done in dual-cube with almost the same communication times as in hypercube.