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.
This paper presents an improvement of interpolation-based (k,n)-threshold secret image sharing (SIS) scheme, where a secret data payload is optimized using Lagrange Interpolation operated in GF(28). A secret data can be not only images but also any type of files, such as documents and executable files, which is hidden using Least Significant Bit (LSB) steganography into n innocent-looking images called...
Yet Another Steganography Scheme (YASS), a promising steganographic scheme for JPEG images which can resist blind steganlysis via embedding data in randomized locations. However, the randomization is not sufficient enough, as some positions are possible to hold host blocks and some are definitely not. Meanwhile, the artifacts introduced by quantization index modulation (QIM) embedding led to the weakness...
This paper describes the systematic design methods of an embedded co-processor for a post quantum secure McEliece cryptosystem. A hardware/software co-design has been targeted for the realization of McEliece in practice on low-cost embedded platforms. Design optimizations take place when choosing system parameters, algorithm transformations, architecture choices, and arithmetic primitives. The final...
We take a physical-layer approach in detecting the falsely injected packet (pollution attack) and removing it from the polluted packet to restore the true coded packet in wireless network coding system. The proposed scheme builds on the maximum likelihood detection principle which is optimal in the sense of minimizing the probability of detection error. It “recycles” the polluted packet by discarding...
The paper deals with the problem of probabilistic error analysis of an encrypted transmission used within safety-related control system for applications with increasing safety integrity level (SIL). The requirements to cryptographic block code in safety-related communications for railway application are describe. The main part is oriented to description of mathematical apparatus for the error probability...
“Soft is better than hard” — this sentence explains the meaning of one of the most important innovations in coding theory during the 90's: the usage of soft output in Soft Input Soft Output decoding and the appearance of Turbo Codes. The same principle may be applied to the verification mechanisms of cryptographic check values: instead of standard or hard verification, soft verification can be used...
This article is with the background of speech coding and data encryption, design a project of speech secure communication based on the TMS320VC5509A DSP. In system, the algorithm of MELP is adopted to encode voice data, AES algorithm is used to encrypt the speech signal data, and Differ-Hellman agreement is adopted as the key consultation. Because the adoption DSP realization and software module design,...
The quantum key reconciliation is an essential step of QKD protocol. Its main objective is to correct the transmission error after the distribution of quantum objects over a quantum channel, where two legitimate parties use a classical interactive communication for agreeing on their common key. This paper presents an alternative quantum key reconciliation method based on the Slepian-Wolf coding scheme...
A novel method to combine encryption and channel coding in such a way as to get increased security without any additional complexity is presented in this paper. A secure communication system usually consists of an encryption block followed by the channel coder. The encryption block here is a Shrinking generator which is a Linear Feedback Shift Register (LFSR) based stream cipher system. The channel...
Compression of encrypted data draws much attention in recent years due to the security concerns in a service oriented environment such as cloud computing. We propose a scalable lossy compression scheme for images having their pixel value encrypted with a standard stream cipher. The encrypted data are simply compressed by transmitting a uniformly sub sampled portion of the encrypted data and some bit-planes...
Cryptography may mitigate the privacy problem in biometric recognition systems. However, cryptography technologies lack error-tolerance and biometric samples cannot be reproduced exactly, rising the robustness problem. The biometric template protection system needs a good feature extraction algorithm to be a good classifier. But, an even effective feature extractor can give a very low-quality biometric...
The paper proposes a new approach for evaluating the security levels of digital watermarking schemes, which is more in line with the formulation proposed in cryptography. We first exhibit the class of equivalent decoding keys. These are the keys allowing a reliable decoding of contents watermarked with the secret key. Then, we evaluate the probability that the adversary picks an equivalent key. The...
The subject of this paper is combining of Soft Input Soft Output (SISO) channel decoding and cryptographic mechanisms with some of well known procedures used in communication systems, such as interleaving, puncturing and bit stuffing. The algorithm is proposed, which enables improvement of used channel decoding by interleaving of bits known to the transmitter and the receiver, resulting in additional...
This paper describes the basic idea of a novel Digital Rights Management(DRM) method which is composed of an incomplete cryptography using invariant huffman code length feature and the user identification mechanism to control the quality of the digital contents. We adopt the huffman code length feature of the DCT coefficient in the JPEG codec to the implement incomplete cryptography. The encoding...
The paper observes transmission of a message protected by its symmetric cryptographic check values, as Message Authentication Code, over a noisy channel. A forward error correcting channel code is assumed, for reduction of the error rate, but without a repeat mechanism to correct the remaining errors (ARQ). The uncorrected errors cause the rejection of messages with a wrong MAC. A method will be presented,...
We classify the complexity classes of several important decoding problems for quantum stabilizer codes. First, regardless of the channel model, quantum bounded distance decoding is shown to be NP-hard, like what Berlekamp, McEliece and Tilborg did for classical binary linear codes in 1978. Then under the depolarizing channel, the decoding problems for finding a most likely error and for minimizing...
In this paper we unveil basic properties of a (k, n)-threshold scheme secure against an extended impersonation attack by an opponent. We consider a scenario in which an opponent tries to impersonate one of the participants under knowledge of other shares. We first establish lower bounds on not only the sizes of the n shares and the uniform random number needed for generation of the shares but also...
Steganography is a science dealing with the hiding of the secured information in a harmless signal. The information may be embedded in an image, audio or video file. For image steganography, binary, gray scale or color images may be used as cover-images for hiding the secret data. In this paper a novel information hiding method has been proposed in spatial domain, to improve Imperceptibility, Security...
This paper studies the behaviour of a crypto-system in a situation where an encoder PX′R′|U′ is used to encrypt a source U which may be different from the source U′ considered to design the encoder. The original crypto-system is designed to achieve perfect secrecy under PU′. The resulting system also achieves perfect secrecy regardless of the source distribution. Finally the mismatch in the system...
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.