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.
In this paper, the wiretap channel with side information studied in [2] is revisited for the case in which the side information is available only at the encoder and in a strictly causal manner. We derive a lower bound on the secrecy capacity of the channel based on a coding scheme which consists of block Markov encoding and key generation using the strictly causal state information available at the...
Quantum key reconciliation is an essential process of quantum key distribution (QKD). It aims to correct the transmission errors after the distribution of quantum objects over a quantum channel, where two legitimate parties use a classical public authenticated channel to disclose correlated bits for agreeing on their common key. This work proposes an alternative promising method employing LDPC-codes...
One of the promising usages of Physically Unclonable Functions (PUFs) is to generate cryptographic keys from PUFs for secure storage of key material. This usage has attractive properties such as physical unclonability and enhanced resistance against hardware attacks. In order to extract a reliable cryptographic key from a noisy PUF response a fuzzy extractor is used to convert non-uniform random PUF...
Since the Quantum Key Distribution (QKD)technique makes it possible to construct an absolute secure cryptographic system by combing the One-time pad, QKD has drawn many attention these years. The insufficient implementation speed of the post-processing system of QKD is one of the greatest obstacle to wide application of QKD. The sifting module of QKD post-processing system needs to deal with the heaviest...
Error correcting codes are useful tools not only for increasing channel reliability in telecommunications systems, but also for the asymmetric encryption cryptographic schemes. Their operation consists basically in encoding messages into codewords for transmission; once received, these messages are decoded and the original message is recovered after the removal of all bit errors introduced either...
In this modern world of Internet and with the development of digital communication and multimedia application, image security has become an important concern in storage and communication. A cryptography technique provides good strength for securing and protecting images essentially in the fields as medical, law enforcement and military. Reversible watermarking provides authentication, in which original...
Design for test is an integral part of any VLSI chip. However, for secure systems extra precautions have to be taken to prevent that the test circuitry could reveal secret information. This paper addresses secure test for Physical Unclonable Function based systems. In particular it provides the testability analysis and a secure Built-In Self-Test (BIST) solution for Fuzzy Extractor (FE) which is the...
Recently, Tso proposed an efficient (k, n) secret image sharing scheme (SISS) based on Blakley's secret sharing, to share a secret image into n shadow images. One can decode a secret image with any k or more than k shadow images, but cannot obtain any information about the secret from less than k shadow images. With the help of quantization, Tso's (k, n)-SISS can reduce the storage space. However,...
The fuzzy vault scheme aims to secure user's critical data (secret encryption key) with the fingerprint data in a way that only the legitimate user is able to access the key by providing his fingerprint. The existing fuzzy vaults constructions are mainly based on techniques which require a pre-alignment phase of template biometric sample and the query one. This remains a challenging task and keeps...
In this work, we propose two McEliece variants: one from Moderate Density Parity-Check (MDPC) codes and another from quasi-cyclic MDPC codes. MDPC codes are LDPC codes of higher density (and worse error-correction capability) than what is usually adopted for telecommunication applications. However, in cryptography we are not necessarily interested in correcting many errors, but only a number which...
Biometric authentication is yet to find widespread acceptance in applications requiring authentication between a remote client and server (e.g., electronic commerce). This is partly because the biometric authentication process can be circumvented through attacks on the communication interfaces or on the stored biometric templates. In this paper, we propose a biometrics-based protocol for secure authentication...
We propose a physical-layer approach to detect the trustworthiness (integrity) of network coded packet and exploit the detection outcome in decoding the message in the presence of pollution (Byzantine) attack. The trustworthiness of data x is defined as the likelihood of x being true. It is determined based on the physical-layer information that is available for free to the destination (detector)...
It is known that Message Authentication Codes are extremely sensitive to any change of the message they are appended to. Even one or more bits of the changed message invert about 50% of bits of Message Authentication Codes, making in such a way the message useless. The hard condition for the successful verification of Message Authentication Codes is that all bits of the received Message Authentication...
We consider a wiretap channel and use previously transmitted messages to generate a secret key which increases the secrecy capacity. This can be bootstrapped to increase the secrecy capacity to the Shannon capacity without using any feedback or extra channel while retaining the strong secrecy of the wiretap channel.
Halftone image watermarking has been explored and developed rapidly over the past decade. However, there are still issues to be studied. This paper presents a data hiding method called Data Hiding by Dual Color Conjugate Error Diffusion (DHDCCED) to hide a binary secret pattern into two error diffused color halftone images, such that when the two color halftone images are overlaid, the secret pattern...
A region incrementing visual secret sharing (RIVSS) scheme can incrementally reveal secrets with different secrecy levels. Recently, Wang proposed a 2-level incrementing visual cryptography using random grids, which can incrementally reveal the secrets on an image without pixel expansion. However, Wang's scheme can only deal with 2-level RIVSS. In this paper, a novel region incrementing visual secret...
In this paper we propose a general biometric cryptosystem framework inspired by the code-offset sketch. Specifically, the properties of digital modulation and turbo codes with soft-decoding are exploited to design a template protection system able to guarantee high performance in terms of both verification rates and security, also when dealing with biometrics characterized by a high intra-class variability...
A novel method to improve the performance of Low Density Parity Check (LDPC) Codes using Soft Input Decryption is presented in this paper. A channel coding technique that provides performance near to Shannon's limit is LDPC code. To achieve optimum decoding, Sum-product decoding is used for LDPC Codes. The Soft Input Decryption method is based on the combination of cryptography and channel coding...
We take a physical layer perspective in detecting the falsely injected vector (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 discards only the faulty information and...
This paper describes an experimental system integration of Digital Rights Management (DRM) architecture and fingerprinting which is composed of an incomplete cryptography scheme using invariant offset huffman code length feature and the user identification mechanism to control the quality of the digital contents. We adopt the AC-coefficent huffman code length feature of the DCT coefficient in the...
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.