11926246
Data Hiding in Compiled Program Binaries for Enhancing Computer System Performance
Information hiding has been studied in many security applications such as authentication, copyright management and digital forensics. In this work, we introduce a new application where successful information hiding in compiled program binaries could bring system-wide performance improvements. Our goal is to enhance computer system performance by providing additional information to the processor, without changing the instruction set architecture. We first analyze the statistics of typical programs to demonstrate the feasibility of hiding data in them. We then propose several techniques to hide a large amount of data in the operand fields with very low computation and storage requirements during the extraction process. The data embedding is made reversible to recover the original instructions and to ensure the correct execution of the computer program. Our experiments on the SPEC CPU2000 benchmark programs show that up to 110K bits of information can be embedded in large programs with as little as 3K bits of additional run-time memory in the form of a simple look-up table.
7408654
Security evaluation for communication-friendly encryption of multimedia
This paper addresses the access control issues unique to multimedia, by using a joint signal processing and cryptographic approach to multimedia encryption. Based on three atomic encryption primitives, we present a systematic study on how to strategically integrate different atomic operations to build a video encryption system. We also propose a set of multimedia-specific security metrics to quantify the security against approximation attacks and to complement the existing notion of generic data security. The resulting system can provide superior performance to both generic encryption and its simple adaptation to video in terms of a joint consideration of security, bitrate overhead, and communication friendliness.
12822689
Data hiding in curves for collusion-resistant digital fingerprinting
This paper presents a new data hiding method for curves. The proposed algorithm parameterizes a curve using the B-spline model and adds a spread spectrum sequence in the coordinates of the B-spline control points. We demonstrate through experiments the robustness of the proposed data hiding algorithm against printing-and-scanning and collusions, and show its feasibility for collusion-resistant fingerprinting of topographic maps as well as writings/drawings from pen-based input devices.
6845274
Fingerprinting Curves
This paper presents a new method for robust data hiding in curves and highlights potential applications including digital fingerprinting of map document for trace and track purposes. We parameterize a curve using the B-spline model and add a spread spectrum sequence to the coordinates of the B-spline control points. In order to achieve robust fingerprint detection, we propose an iterative alignment-minimization algorithm to perform curve registration and deal with the non-uniqueness of B-spline control points. We show through experiments the robustness of our method against various attacks such as collusion, geometric transformations and perturbation, printing-and-scanning, and some of their combinations. We demonstrate the feasibility of our method for fingerprinting topographic maps as well as writings and drawings. The extension from hiding data in 2D topographic maps to 3D elevation data sets is also discussed.
18637696
Forensic analysis of nonlinear collusion attacks for multimedia fingerprinting
Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Unique identification information is embedded into each distributed copy of multimedia signal and serves as a digital fingerprint. Collusion attack is a cost-effective attack against digital fingerprinting, where colluders combine several copies with the same content but different fingerprints to remove or attenuate the original fingerprints. In this paper, we investigate the average collusion attack and several basic nonlinear collusions on independent Gaussian fingerprints, and study their effectiveness and the impact on the perceptual quality. With unbounded Gaussian fingerprints, perceivable distortion may exist in the fingerprinted copies as well as the copies after the collusion attacks. In order to remove this perceptual distortion, we introduce bounded Gaussian-like fingerprints and study their performance under collusion attacks. We also study several commonly used detection statistics and analyze their performance under collusion attacks. We further propose a preprocessing technique of the extracted fingerprints specifically for collusion scenarios to improve the detection performance.
1384427
Classification-based spatial error concealment for images
This paper presents a new, classification-based spatial error concealment algorithm for images. The proposed scheme takes advantage of two state-of-the-art concealment schemes and adaptively selects a better suitable concealment scheme for each corrupted block. Using a support vector machine (SVM) classifier, our proposed approach outperforms the prior art in terms of the concealment quality and has moderate computational complexity.
621326
Picard--Vessiot extensions for linear functional systems
Picard-Vessiot extensions for ordinary differential and difference equations are well known and are at the core of the associated Galois theories. In this paper, we construct fundamental matrices and Picard-Vessiot extensions for systems of linear partial functional equations having finite linear dimension. We then use those extensions to show that all the solutions of a factor of such a system can be completed to solutions of the original system.
40421445
CSIRO INEX experiments: XML Search using PADRE
This paper reports on the CSIRO group's participation in INEX. We indexed documents and document fragments using PADRE, the core of CSIRO's Panoptic Enterprise Search Engine. A query translator converts the INEX topics into queries containing selection and projection constraints for the results. Answers are extracted from ranked documents and document fragments based on the projection constraints in the query.
31560341
The role of a judge in a user based retrieval experiment (poster session)
A tuning device for tympani that displays the pitch of each instrument's tympanum. The pitch is determined by measuring the strain in an adjustable tensioning mechanism employed in all tympani to keep proper tension on the tympanum. The pitch or tone of the tympani is determined by the vibration frequency of the tympanum when the tympani is played and the frequency is determined by the tension in the tympanum. A transducer measures the strain in the tensioning mechanism to give an accurate indication of what the tympanum tension, and therefore the pitch, of the tympani would be when played. The transducer includes a resistance-type strain gage mounted on the tympanum tensioning mechanism. The length of the conductor in the strain gage and therefore its resistance, changes with stress changes in the tensioning mechanism used to tune the tympani. A switch means selects a desired one of the strain gages mounted on each of the one or more tympani for inclusion as one section of a four-section resistance bridge circuit configuration. A signal conditioning module provides excitation to the bridge circuit and also conditions the output of the bridge circuit. The output of the bridge circuit varies as the resistance of the strain gage varies. The conditioned output of the bridge circuit is displayed on a voltmeter whose scale has been calibrated to indicate the pitch of the tympani being monitored.
2486932
Searcher performance in question answering
There are many tasks that require information finding. Some can be largely automated, and others greatly benefit from successful interaction between system and searcher. We are interested in the task of answering questions where some synthesis of information is required-the answer would not generally be given from a single passage of a single document. We investigate whether variation in the way a list of documents is delivered affected searcher performance in the question answering task. We will show that there is a significant difference in performance using a list customized to the task type, compared with a standard web-engine list. This indicates that paying attention to the task and the searcher interaction may provide substantial improvement in task performance.
38786958
Using Document Relationships for Better Answers
In most retrieval systems the answer to a query is a ranked list of documents. There is little information about the ranking and no support for exploring the relationships that may exist between the documents. In this paper we consider the use of clustering answers to better support users satisfying their information needs. We show how clustering reflects the nature of some information needs, and how the clustering can be used to find more relevant documents than would be the case using simple lists. This work contributes to our approach of building answers to information needs, rather than simply providing lists.