Flash memory is a non-volatile computer storage device which consists of blocks of cells. While increasing the voltage level of a single cell is fast and simple, reducing the level of a cell requires the erasing of th...
详细信息
ISBN:
(纸本)9781424456383
Flash memory is a non-volatile computer storage device which consists of blocks of cells. While increasing the voltage level of a single cell is fast and simple, reducing the level of a cell requires the erasing of the entire block containing the cell. Since block erasures are costly, traditional flash coding schemes have been developed to maximize the number of writes before a block erasure is needed. A novel coding scheme based on error-correcting codes allows the cell levels to increase as evenly as possibly and as a result, increases the number of writes before a block erasure. The scheme is also capable of combating noise in flash memories in order to enhance data reliability.
Allocation methods for Cartesian product files on multiple disks by using linear error-correcting codes are proposed. This allocation methods can be applied to queries in which the characteristic of each attribute is ...
详细信息
ISBN:
(纸本)0780321294
Allocation methods for Cartesian product files on multiple disks by using linear error-correcting codes are proposed. This allocation methods can be applied to queries in which the characteristic of each attribute is not uniform. The structure of Reed-Solomon codes over GF(pm), which give the strictly optimal allocation when all possible partial match queries are equiprobable, and the mapping by the basis for GF(pm) over the subfields is used. As a result, it is shown that a file is constructed by records which has the attributes in which the domain is partitioned by different number. The properties of this method are described.
The condition based approach identifies sets of input vectors, called conditions, for which it is possible-to design a protocol solving a distributed problem despite, process crashes. This paper investigates three rel...
详细信息
ISBN:
(数字)9783540361084
ISBN:
(纸本)3540000739
The condition based approach identifies sets of input vectors, called conditions, for which it is possible-to design a protocol solving a distributed problem despite, process crashes. This paper investigates three related agreement problems, namely consensus interactive consistency, and k-set aggrement in the context of the condition-based approach. In consensus, processes have to agree on one of the proposed values;in interactive consistency, they have to agree on the vector of proposed values;in k-set agreement, each process decides on one of the proposed values, and at most k different values can be decided on. For both consensus and interactive consistency, a direct correlation between these problems and errorcorrectingcodes is established. In particular, crash failures in distributed agreement problems correspond to erasure failures in errorcorrectingcodes, and Byzantine and value domain faults correspond to corruption errors. It is also shown that less restrictive codes can be-used to solve k-set agreement, but without a necessity proof, which is still an open problem.
In the era of deep learning, a user often leverages a third-party machine learning tool to train a deep neural network (DNN) classifier and then deploys the classifier as an end-user software product (e.g., a mobile a...
详细信息
ISBN:
(纸本)9781450382878
In the era of deep learning, a user often leverages a third-party machine learning tool to train a deep neural network (DNN) classifier and then deploys the classifier as an end-user software product (e.g., a mobile app) or a cloud service. In an information embedding attack, an attacker is the provider of a malicious third-party machine learning tool. The attacker embeds a message into the DNN classifier during training and recovers the message via querying the API of the black-box classifier after the user deploys it. Information embedding attacks have attracted growing attention because of various applications such as watermarking DNN classifiers and compromising user privacy. State-of-the-art information embedding attacks have two key limitations: 1) they cannot verify the correctness of the recovered message, and 2) they are not robust against post-processing (e.g., compression) of the classifier. In this work, we aim to design information embedding attacks that are verifiable and robust against popular post-processing methods. Specifically, we leverage Cyclic Redundancy Check to verify the correctness of the recovered message. Moreover, to be robust against post-processing, we leverage Turbo codes, a type of error-correcting codes, to encode the message before embedding it to the DNN classifier. In order to save queries to the deployed classifier, we propose to recover the message via adaptively querying the classifier. Our adaptive recovery strategy leverages the property of Turbo codes that supports errorcorrecting with a partial code. We evaluate our information embedding attacks using simulated messages and apply them to three applications (i.e., training data inference, property inference, DNN architecture inference), where messages have semantic interpretations. We consider 8 popular methods to post-process the classifier. Our results show that our attacks can accurately and verifiably recover the messages in all considered scenarios, while state-of-the
error-correcting codes based on quasigroups are defined elsewhere. These codes are a combination of cryptographic algorithms and errorcorrectingcodes. In a paper of ours we succeed to improve the speed of the decodi...
详细信息
ISBN:
(纸本)9781479914180
error-correcting codes based on quasigroups are defined elsewhere. These codes are a combination of cryptographic algorithms and errorcorrectingcodes. In a paper of ours we succeed to improve the speed of the decoding process by defining new algorithm for coding and decoding, named "cut-decoding algorithm". Here, a new modification of the cut-decoding algorithm is considered in order to obtain further improvements of the code performances. We present several experimental results obtained with different decoding algorithms for these codes.
Two signature systems based on smart cards and fingerprint features are proposed. In one signature system, the cryptographic key is stored in the smart card and is only accessible when the signer's extracted fingerpr...
详细信息
Two signature systems based on smart cards and fingerprint features are proposed. In one signature system, the cryptographic key is stored in the smart card and is only accessible when the signer's extracted fingerprint features match his stored template. To resist being tampered on public channel, the user's message and the signed message are encrypted by the signer's public key and the user's public key, respectively. In the other signature system, the keys are generated by combining the signer's fingerprint features, check bits, and a rememberable key, and there are no matching process and keys stored on the smart card. Additionally, there is generally more than one public key in this system, that is, there exist some pseudo public keys except a real one.
A fundamental problem in coding theory is to find the values of A(n, d), i.e., the A(n, d) is the size of the maximum binary code set of length n and minimum Hamming distance d. And A(n, d) can also be viewed as the s...
详细信息
A fundamental problem in coding theory is to find the values of A(n, d), i.e., the A(n, d) is the size of the maximum binary code set of length n and minimum Hamming distance d. And A(n, d) can also be viewed as the size of maximum independent set of d - 1th-power of the n-dimensional hypercube Q(n). In order to further understand and study this problem, we study the distribution of the maximum clique and the structure of the point of Q(d) n for d <= 5. (C) 2021 Elsevier B.V. All rights reserved.
Frequency-modulated differential chaos shift keying (FM-DCSK) is an attractive scheme which combines chaotic modulation with the spread-spectrum property. It is simple to implement and robust in multipath fading chann...
详细信息
Frequency-modulated differential chaos shift keying (FM-DCSK) is an attractive scheme which combines chaotic modulation with the spread-spectrum property. It is simple to implement and robust in multipath fading channels. A single-input multiple-output (SIMO) FM-DCSK architecture has recently been developed to increase data rate and achieve diversity gain. In this paper, several main channel coding schemes, i.e., error-correcting coding schemes, are introduced into the SIMO FM-DCSK communication system, with different code rates and different frame lengths, over multipath fading channels. It is found that, in contrast to low density parity check codes and convolutional codes, product accumulate (PA) codes can provide outstanding bit error rate performance improvement to the existing SIMO FM-DCSK system. In this paper, moreover, the optimum code rate for the PA-coded SIMO FM-DCSK system is investigated through simulations at a medium frame length. Because of its merits in several aspects, such as prominent advantages in better performance, simple encoding and decoding structures, and a flexibly adjustable code rate, this paper demonstrates that PA code is a strong candidate as the error-correcting scheme for the SIMO FM-DCSK system in transmitting medium and long frame lengths over multipath fading channels.
A novel two-phase robust content-based image authentication scheme is introduced. The proposed scheme is constructed based on a combination of hard and soft authentication using two existing generic approximate messag...
详细信息
A novel two-phase robust content-based image authentication scheme is introduced. The proposed scheme is constructed based on a combination of hard and soft authentication using two existing generic approximate message authentication codes (AMACs). The AMACs combine error-correcting codes with cryptographic primitives such as message authentication codes and symmetric encryption algorithms. The message authentication codes are used for hard authentication, whereas the error-correcting codes introduce a certain degree of robustness in authentication. This is achieved by correcting minor unintentional modifications as a result of common image processing operations such as quantization, compression, and noise addition. The two-phase image authentication scheme verifies the authenticity of an image in two phases. The low frequency elements of the image in a transform domain are subjected to the first phase while some higher frequency elements are left to the second phase if the first phase succeeds. The proposed scheme tolerates common content-preserving modifications in an image but can discriminate intentional modifications affecting the image content. Mathematical bounds for the accuracy and the security level of the proposed approach are estimated and the performance is compared with some other well-known schemes in the literature. The results demonstrate that the proposed scheme shows high discriminating capability and can detect different types of meaningful forgery attacks on images while preserving the robustness. It also outperforms the benchmark image authentication schemes in terms of tradeoff between robustness and fragility.
This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost/performance trade-offs in a torus parallel machine. This paper contains so...
详细信息
This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost/performance trade-offs in a torus parallel machine. This paper contains some solutions to perfect distance-t and perfect/quasi-perfect j-adjacency placement in a k-ary n-cube and a torus using Lee distance error-correcting codes. It also presents generalized resource placement (j-adjacency with distance-t placement) methods based on the concept of covering radius of Lee distance codes.
暂无评论