The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Software birthmarks have been proposed as a method for enabling the detection of programs that may have been stolen by measuring the similarity between the two programs. A birthmark is created from each program by extracting its native characteristics. The birthmarks of the programs can then be compared. However, because the extracted birthmarks contain a large amount of information, a large amount...
The expanding possibilities of the modern communication demand certain means of security that promote confidentiality as well as the integrity of information. To bypass the attention of the potential attackers, the domain of steganography as a whole minimizes the chances of tracing out or detecting any kind of hidden information during transmission. In this paper, we propose a new steganographic technique...
In this paper, a steganographic method is presented for hiding data in images. This method uses the modified least significant bits (MLSB) and modulus function with pixel value differencing (MF&PVD) techniques. Using the proposed method the capacity of the hidden secret data and stego image quality are improved. First, a different value from two consecutive pixels using of the PVD method is obtained...
This paper analyzes the security of content-based watermarking authentication framework in the extraction of the feature watermark and the watermark embedding using information theory. Security analysis of feature watermark is composed of four parts, that is, the extracted feature is as watermark, the encrypted feature after extracted is as watermark, the encrypted feature before extracted is as watermark...
In this paper, we propose a new approach to represent general S-Box based on linear-transform and a given non-linear function that increases the complexity of algebraic expression and size of S-Box. In the case of size of 8, the proposed S-Box can archive the maximum number of terms (255 terms) and therefore it can be used to replace the classical S-Box component in the original AES. Furthermore,...
In the digital watermarking technology, often using Arnold transform scrambling watermark images, but Arnold transform is given only one form and it is an open form, so reducing their security. In this paper, a species that contains a lot of FAN transform set, and Arnold transform is only one of a special case. Since the type of transformation is infinite, it will increase the difficulty of cracking...
In a recent paper, the authors introduced a method for constructing new quadratic APN functions from known ones. Applying this method, they obtained the function x3 + trn(x9) which is APN over F2n for any positive integer n. The present paper is a continuation of this work. We give sufficient conditions on linear functions L1 and L2 from F2n to itself such that the function L1(x3) + L2(x9) is APN...
Biometric authentication has attracted attention because of its high security and convenience. However, biometric feature such as fingerprint can not be revoked like passwords. Thus once the biometric data of a user stored in the system has been compromised, it can not be used for authentication securely for his/her whole life long. To address this issue, an authentication scheme called cancelable...
Image searching and authentication have become strong requirements in the digital world. Image perceptual hashing has been proposed to meet them. In this paper, a rotation resilient image hashing algorithm is presented. In the algorithm, the position information of original image is extracted to adjust the rotation. Then the features of the image are extracted by contourlet transform. The key-dependence...
Multicast is a scalable solution for group communication. In order to offer security for multicast applications, a group key has to be changed whenever a member joins or leaves the group. This incurs 1-affect-n problem, which is a constraint on scalability. Decentralized approaches solve the scalability problem by dividing a group into subgroups that use independent group keys. These approaches, however,...
In view of the problems of small capacity to carry hidden information and weak robustness, this paper presents a new Chinese text digital watermarking technology based on cognitive features of human psychology, even by changing the edges number of the junction in Chinese characters, design a variety of characters with different breaking and linking stroks in the same semantic, and encoded these characters...
In 2008, Shi et al. proposed a new (t, n)-threshold secret sharing scheme for image encryption. This paper indicates that their scheme is insecure because it is possible to find the secret image from the public image. In addition, it is inflexible since the width must be equal to the height and the size of the secret images must be the same upon sharing multi-image. Moreover, their scheme is not efficient...
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This paper presents a general technique for strengthening cryptographic protocols in order to satisfy authorization policies despite participant compromise. The central idea is to automatically transform the original cryptographic...
In this paper, two hybrid LSB substitution image hiding methods are proposed. The first method couples two previous works, the optimal LSB substitution and the optimal pixel adjustment process (OPAP), to improve the quality of the stego-image. The second method is a variation of the first one. It replaces the optimal LSB substitution with the worst LSB substitution. Based on the collaboration technologies,...
Feedback polynomials with low degree multiples of low weight should be avoided in linear feedback shift registers when used in nonlinear combiners. We consider another class of weak feedback polynomials, namely the class when taps are located in small groups. This class was introduced in 2004 demonstrating that the resulting distinguishing attack can sometimes be better than the one using low weight...
Different images have different amplitude spectrums. However, in this paper, with the proposed phase-key algorithm, we can make a series of images have the same amplitude spectrum but different phase key in the frequency domain. It is useful for image encryption, data compression, image transformation, and reducing the distortion in communication. Our algorithm can be applied for not only the FT but...
In 1998, Blaze, Bleumer and Strauss proposed two kinds of cryptographic primitives called proxy re-encryption and proxy re-signature [4]. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. In proxy re-signature, a proxy can transform a signature computed under Alice's secret key into one that can be verified...
SSL is a cryptographic protocol that is widely used in secure applications based on web browser, such as e-payment. The protocol is based on the principle of PKI and uses digital certificates to realize secure communication. However, the use of certificate in SSL does not obey the strict hierarchy CAs, which causes some secure defects in SSL. Besides, session key of SSL is limited by the exportation...
Comparing different versions of large tree structured data is a CPU and memory intensive task. State of the art techniques require the complete XML trees and their internal representations to be loaded into memory before any comparison may start. Furthermore, comparing sanitized XML trees is not addressed by these techniques. We propose a comparison technique for sanitized XML documents which ultimately...
To solve the problem that the combination of encrypting parameters is too less in one-dimensional linear congruence mapping and the poor security in encryption, an audio scrambling algorithm based on variable dimension space (ASVDS) is presented. When implemented in audio position space, our algorithm changes the dimension of coordinates and uses arbitrary matrices to scramble audio, which has following...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.