105147
Digital Watermarking Robust Against JPEG Compression
Digital watermarking has been considered as an important technique to protect the copyright of digital content. For a digital watermarking method to be effective, it is essential that a watermark embedded in a still or moving image resists against various attacks ranging from compression, filtering to cropping. As JPEG is a dominant still image compression standard for Internet applications, digital watermarking methods that are robust against the JPEG compression are especially useful. Most digital watermarking methods proposed so far work by modulating pixels/coefficients without considering the quality level of JPEG, which renders watermarks readily removable. In this paper, we propose a new method that actively uses the JPEG quality level as a parameter in embedding a watermark into an image. A useful feature of the new method is that the watermark can be extracted even when the image is compressed using JPEG.
6962958
Characterising user data protection of software components
Proposes a scheme to characterise non-functional security properties that are embedded within the functionality of software components. The security properties may be attached to various aspects of a component, such as resource allocation, user data protection, communication, and so on. In this paper, we are particularly interested in characterising the user data protection of software components. It is often reported that software components usually suffer from security and reliability problems. It is now widely recognised that the characterisation of the security properties of software components is an important issue to boost the confidence and trust in component technology. To address this issue, the characterisation of the security properties of components is the first challenging step. The work proposed in this paper is partially based on the functional requirements defined in the Common Criteria for Information Technology Security Evaluation endorsed by NIST. The applicability of the proposed scheme is demonstrated with a simple example.
36265866
A Security Acceleration Using XML Signcryption Scheme in Mobile Grid Web Services
Today's grid architecture encompasses a far greater breadth of applications than the traditional grid, which focused on distributed applications processing large amounts of data. Newer grid applications are more data-centric and more focused on distributed services. As these trends, mobile internet and the grid, are likely to find each other the resource constraints that wireless devices pose today affect the level of interoperability between them. The goal of this paper is to investigate how well the most limited wireless devices can make the use of grid security services. This paper describes a novel security approach on fast mobile grid services based on current mobile web services platform environment using XML signcryption mechanism.
7417533
Cryptographically resilient functions
This correspondence studies resilient functions which have applications in fault-tolerant distributed computing, quantum cryptographic key distribution, and random sequence generation for stream ciphers. We present a number of new methods for synthesizing resilient functions. An interesting aspect of these methods is that they are applicable both to linear and nonlinear resilient functions. Our second major contribution is to show that every linear resilient function can be transformed into a large number of nonlinear resilient functions with the same parameters. As a result, we obtain resilient functions that are highly nonlinear and have a high algebraic degree.
9346791
On the Security of RSA with Primes Sharing Least-Significant Bits
Abstract.We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits. We show that low public-exponent LSBS-RSA is inherently resistant to Partial Key Exposure (PKE) attacks in which least-significant bits of the secret exponent are revealed to the attacker, and in particular that the Boneh-Durfee-Frankel PKE attack [5] on low public-exponent RSA is less effective for LSBS-RSA systems than for standard RSA. On the other hand, we show that large public-exponent LSBS-RSA is more vulnerable to such attacks than standard RSA. An application to server-aided RSA signature generation is proposed.
17666125
Plateaued Functions
The focus of this paper is on nonlinear characteristics of cryptographic Boolean functions First we introduce the notion of plateaued functions that have many cryptographically desirable properties Second we establish a sequence of strengthened inequalities on some of the most important nonlinearity criteria including nonlinearity propagation and correlation immunity and prove that critical cases of the inequalities co incide with characterizations of plateaued functions We then proceed to prove that plateaued functions include as a proper subset all partially bent functions that were introduced earlier by Carlet This settles an open question that arises from previously known results on partially bent functions In addition we construct plateaued but not partially bent functions that have many properties useful in cryptography
6457216
A CMOS Direct-Digital BPSK Modulator Using an Active Balun and Common-Gate Switches
A 0.18 mum CMOS binary phase shift keying (BPSK) modulator circuit is proposed and demonstrated that can achieve high data rates and strong carrier suppression while having low DC power consumption and a very compact layout. The modulator accepts a single-ended microwave signal (2.4 GHz) and converts it to a balanced signal using an active balun. Complementary common-gate switches are then used to select one of the two balun outputs in correspondence with the digital data to produce BPSK modulation. Excellent performance is obtained with measured phase and amplitude errors of less than 1deg and 0.1 dB, respectively, and data rates up to 200 Mbps with a carrier frequency of 2.4 GHz. The insertion loss for the modulator is approximately 3 dB. Additionally, the active balun provides input matching and obtains an input reflection coefficient of -13 dB. The circuit layout area is 310 mumtimes260 mum and the power consumption is 7.2 mW.
646545
Designing and Evaluating an XPath Dialect for Linguistic Queries
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural choices for linguistic data and queries. However, several important expressive features required for linguistic queries are missing or hard to express in XPath. In this paper, we motivate and illustrate these features with a variety of linguistic queries. Then we propose extensions to XPath to support linguistic queries, and design an efficient query engine based on a novel labeling scheme. Experiments demonstrate that our language is not only sufficiently expressive for linguistic trees but also efficient for practical usage.
46651638
Packed integer wavelet transform constructed by lifting scheme
A new method for speeding up the integer wavelet transforms constructed by the lifting scheme is proposed. The proposed method packs multiple pixels (wavelet coefficients) in a single word; therefore, it can make use of the 32-bit or 64-bit computational capability of modern computers to accomplish multiple addition/subtraction operations in one instruction cycle. As a result, our method can save the decomposition/reconstruction time by up to 37% on 32-bit machines and require much less working memory in comparison with the original wavelet transform algorithms.
6106156
Unsupervised Image Segmentation with Fuzzy Connectedness
In this paper, we report a method to do unsupervised image segmentations based on fuzzy connectedness with scale space theory. A new measure for doing segmented regions' mergence is also proposed. The method can be used in many applications like content based image retrieval and medical image analysis, etc.
11180883
An approach to multimodal biomedical image registration utilizing particle swarm optimization
Biomedical image registration, or geometric alignment of two-dimensional and/or three-dimensional (3D) image data, is becoming increasingly important in diagnosis, treatment planning, functional studies, computer-guided therapies, and in biomedical research. Registration based on intensity values usually requires optimization of some similarity metric between the images. Local optimization techniques frequently fail because functions of these metrics with respect to transformation parameters are generally nonconvex and irregular and, therefore, global methods are often required. In this paper, a new evolutionary approach, particle swarm optimization, is adapted for single-slice 3D-to-3D biomedical image registration. A new hybrid particle swarm technique is proposed that incorporates initial user guidance. Multimodal registrations with initial orientations far from the ground truth were performed on three volumes from different modalities. Results of optimizing the normalized mutual information similarity metric were compared with various evolutionary strategies. The hybrid particle swarm technique produced more accurate registrations than the evolutionary strategies in many cases, with comparable convergence. These results demonstrate that particle swarm approaches, along with evolutionary techniques and local methods, are useful in image registration, and emphasize the need for hybrid approaches for difficult registration problems.