Stereolithographic(STL)files have been extensively used in rapid prototyping industries as well as many other fields as watermarking algorithms to secure intellectual property and protect three-dimensional models from...Stereolithographic(STL)files have been extensively used in rapid prototyping industries as well as many other fields as watermarking algorithms to secure intellectual property and protect three-dimensional models from theft.However,to the best of our knowledge,few studies have looked at how watermarking can resist attacks that involve vertex-reordering.Here,we present a lossless and robust watermarking scheme for STL files to protect against vertexreordering attacks.Specifically,we designed a novel error-correcting code(ECC)that can correct the error of any one-bit in a bitstream by inserting several check digits.In addition,ECC is designed to make use of redundant information according to the characteristics of STL files,which introduces further robustness for defense against attacks.No modifications are made to the geometric information of the three-dimensional model,which respects the requirements of a highprecision model.The experimental results show that the proposed watermarking scheme can survive numerous kinds of attack,including rotation,scaling and translation(RST),facet reordering,and vertex-reordering attacks.展开更多
This paper proved the statement that a good linear block encoder is in fact a good local-random sequence generator. Furthermore, this statement discovers the deep relationship between the error-correcting coding theor...This paper proved the statement that a good linear block encoder is in fact a good local-random sequence generator. Furthermore, this statement discovers the deep relationship between the error-correcting coding theory and the modern cryptography.展开更多
Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to im...Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to implement a quantum （k, 2k-1） threshold scheme. It also takes advantage of classical enhancement of the [2k-1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.展开更多
This paper demonstrates how channel coding can improve the robustness of spatial image watermarks against signal distortion caused by lossy data compression such as the JPEG scheme by taking advantage of the propertie...This paper demonstrates how channel coding can improve the robustness of spatial image watermarks against signal distortion caused by lossy data compression such as the JPEG scheme by taking advantage of the properties of Gray code. Two error-correction coding (ECC) schemes are used here: One scheme, referred to as the vertical ECC (VECC), is to encode information bits in a pixel by error-correction coding where the Gray code is used to improve the performance. The other scheme, referred to as the horizontal ECC (HECC), is to encode information bits in an image plane. In watermarking, HECC generates a codeword representing watermark bits, and each bit of the codeword is encoded by VECC. Simple single-error-correcting block codes are used in VECC and HECC. Several experiments of these schemes were conducted on test images. The result demonstrates that the error-correcting performance of HECC just depends on that of VECC, and accordingly, HECC enhances the capability of VECC. Consequently, HECC with appropriate codes can achieve stronger robustness to JPEG—caused distortions than non-channel-coding watermarking schemes.展开更多
In this paper, error-correction coding (ECC) in Gray codes is considered and its performance in the protecting of spatial image watermarks against lossy data compression is demonstrated. For this purpose, the differen...In this paper, error-correction coding (ECC) in Gray codes is considered and its performance in the protecting of spatial image watermarks against lossy data compression is demonstrated. For this purpose, the differences between bit patterns of two Gray codewords are analyzed in detail. On the basis of the properties, a method for encoding watermark bits in the Gray codewords that represent signal levels by a single-error-correcting (SEC) code is developed, which is referred to as the Gray-ECC method in this paper. The two codewords of the SEC code corresponding to respective watermark bits are determined so as to minimize the expected amount of distortion caused by the watermark embedding. The stochastic analyses show that an error-correcting capacity of the Gray-ECC method is superior to that of the ECC in natural binary codes for changes in signal codewords. Experiments of the Gray-ECC method were conducted on 8-bit monochrome images to evaluate both the features of watermarked images and the performance of robustness for image distortion resulting from the JPEG DCT-baseline coding scheme. The results demonstrate that, compared with a conventional averaging-based method, the Gray-ECC method yields watermarked images with less amount of signal distortion and also makes the watermark comparably robust for lossy data compression.展开更多
The performance analysis and simulation of coding schemes based on the modeling Ka band fixed satellite channel have been presented. The results indicate that concatenated codes with large inner interleaving depth ha...The performance analysis and simulation of coding schemes based on the modeling Ka band fixed satellite channel have been presented. The results indicate that concatenated codes with large inner interleaving depth have good performance and high spectrum efficiency. The studies also show that simple block interleaving is very effective in combating the slow frequency nonselective fading of Ka band.展开更多
Exploiting the encoding process of the stabilizer quantum code [[n, k, d]], a deterministic quantum communication scheme, in which n - 1 photons are distributed forward and backward in two-way channel, is proposed to ...Exploiting the encoding process of the stabilizer quantum code [[n, k, d]], a deterministic quantum communication scheme, in which n - 1 photons are distributed forward and backward in two-way channel, is proposed to transmit the secret messages with unconditional security. The present scheme can be implemented to distribute the secret quantum （or classical） messages with great capacity in imperfect quantum channel since the utilized code encodes k-qubit messages for each scheme run.展开更多
In order to eliminate float-point operations for fast wavelet transform, an integer D9/7 biorthogonal reversible wavelet transform was accomplished by lifting scheme. The lifting scheme based wavelet transform can be ...In order to eliminate float-point operations for fast wavelet transform, an integer D9/7 biorthogonal reversible wavelet transform was accomplished by lifting scheme. The lifting scheme based wavelet transform can be finished by addition and shift simply. It improved the quality of reconstructive image and greatly reduced the computational complexity due to integer operation. It is suitable for real-time image coding on hardware such as DSP. The simulation results show that the lifting scheme based SPIHT is prior to traditional wavelet based SPHIT in quality and complexity.展开更多
A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify h...A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.展开更多
In this paper, we propose a novel space efficient secret sharing scheme on the basis of minimal linear codes, which satisfies the definition of a computationally efficient secret sharing scheme. In the scheme, we part...In this paper, we propose a novel space efficient secret sharing scheme on the basis of minimal linear codes, which satisfies the definition of a computationally efficient secret sharing scheme. In the scheme, we partition the underlying minimal linear code into disjoint classes, establishing a one-to-one correspondence between the minimal authorized subsets of participants and the representative codewords of all different classes. Each participant, with only one short share transmitted through a public channel, can share a large secret. Therefore, the proposed scheme can distribute a large secret in practical applications such as secure information dispersal in sensor networks and secure multiparty computation.展开更多
In this paper, the cyclic code of the classic circuit is transformed and transplanted; then, the quantum encoding scheme based on cyclic code and quantum error-correction circuit is constructed. The proposed circuit c...In this paper, the cyclic code of the classic circuit is transformed and transplanted; then, the quantum encoding scheme based on cyclic code and quantum error-correction circuit is constructed. The proposed circuit can correct one-bit error, and the use of redundant bits to encode more than one-bit quantum information breaks the previous limitations of many bits encoding a quantum bit. Compared with the existing coding circuits （Shor code, Steane code and five stable subcode）, it shows obvious superiority in the quantum coding efficiency and transmission efficiency.展开更多
Block matching has been used for motion estimation and motion compensation in the Au- dio and Video Standard (AVS) for years. While having an acceptable performance in describing mo- tion between frames, it requires q...Block matching has been used for motion estimation and motion compensation in the Au- dio and Video Standard (AVS) for years. While having an acceptable performance in describing mo- tion between frames, it requires quite a few bits to represent the motion vectors. In certain circum- stances, the use of global motion estimation and compensation would perform equally well or even better than the block matching in terms of motion accuracy, while it results in the coding of global motion model parameters. In this letter, we modify an AVS coder by adding (1) six global motion model parameters to the frame header, and (2) mode selection among INTRA, SKIP, INTER-16×16, INTER-16×8, INTER-8×16, INTER-8×8, and Global Motion Compensation (GMC) modes by La- grange optimal rate-distortion criteria. Simulation results demonstrate that over 0.1dB improvement in PSNR is obtained compared to the AVS coder for an average coded P-frame with the same bit- rate.展开更多
Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct...Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct the secret sharing schemes. Since the code of a symmetric （V, k, λ）-design is a linear code, this study is about the secret sharing schemes based on C of Fp-code C of asymmetric （v, k, λ）-design.展开更多
Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every lin...Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.展开更多
In order to improve the spectrum efficiency of the high-order polar coded modulation systems, the polar code is used as the component code of the bit-interleave coded modulation(BICM) system, a novel bit mapping schem...In order to improve the spectrum efficiency of the high-order polar coded modulation systems, the polar code is used as the component code of the bit-interleave coded modulation(BICM) system, a novel bit mapping scheme is proposed considering of the channel polarization and successive cancellation(SC) decoding principle of polar codes as well as the unequal protection of equivalent channels by modulator. In this scheme, the frozen bits on the unreliable split channel are allocated to the equivalent channel with the low protection of the modulator, while the equivalent channels with the high protection are used to transmit the information bits. Thus, the error-correcting performance of polar codes is improved. Compared with some bit mapping schemes, the proposed bit mapping scheme only needs to divide and choose the parameters of the split channels reliability measurement, the complexity does not increase obviously, and simulation results show that the proposed scheme has the better performance under the quadrature amplitude modulation(QAM) modulation based on the Gray mapping.展开更多
The authors regret Acknowledgements Firstly,the authors wish to acknowledge the academic support from Ruhr University Bochum during the first author's(Xiao Yan)research stay from 2018.11 to 2020.10,including the s...The authors regret Acknowledgements Firstly,the authors wish to acknowledge the academic support from Ruhr University Bochum during the first author's(Xiao Yan)research stay from 2018.11 to 2020.10,including the soft code implement and debug support from Vladislav Gudzulic and academic advising from Günther Meschke.展开更多
In order to detect web shells that hackers inject into web servers by exploiting system vulnerabilities or web page open sources, a novel web shell detection system based on the scoring scheme is proposed, named Evil-...In order to detect web shells that hackers inject into web servers by exploiting system vulnerabilities or web page open sources, a novel web shell detection system based on the scoring scheme is proposed, named Evil-hunter. First, a large set of malicious function samples normally used in web shells are collected from various sources on the Internet and security forums. Secondly, according to the danger level and the frequency of using these malicious functions in the web shells as well as in legal web applications, an assigning score strategy for each malicious sample is devised. Then, the appropriate score threshold value for each sample is obtained from the results of a statistical analysis. Finally, based on the threshold value, a simple algorithm is presented to identify files that contain web shells in web applications. The experimental results show that compared with other approaches, Evil-hunter can identify web shells more efficiently and accurately.展开更多
It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its des...It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal property through algorithms. We also give a better upper bound of the designed distance of a classical narrow-sense BCH code which contains its Euclidean dual. Besides these, we also give one algorithm to compute the dimension of these codes. The complexity of all algorithms is analyzed. Then the results can be applied to construct a series of quantum BCH codes via the famous CSS constructions.展开更多
基金This work was supported in part by the National Science Foundation of China(No.61772539,6187212,61972405),STITSX(No.201705D131025),1331KITSX,and CiCi3D.
文摘Stereolithographic(STL)files have been extensively used in rapid prototyping industries as well as many other fields as watermarking algorithms to secure intellectual property and protect three-dimensional models from theft.However,to the best of our knowledge,few studies have looked at how watermarking can resist attacks that involve vertex-reordering.Here,we present a lossless and robust watermarking scheme for STL files to protect against vertexreordering attacks.Specifically,we designed a novel error-correcting code(ECC)that can correct the error of any one-bit in a bitstream by inserting several check digits.In addition,ECC is designed to make use of redundant information according to the characteristics of STL files,which introduces further robustness for defense against attacks.No modifications are made to the geometric information of the three-dimensional model,which respects the requirements of a highprecision model.The experimental results show that the proposed watermarking scheme can survive numerous kinds of attack,including rotation,scaling and translation(RST),facet reordering,and vertex-reordering attacks.
基金Supported by Trans-century Training Program Foundation for the Talents by the State Education Commission
文摘This paper proved the statement that a good linear block encoder is in fact a good local-random sequence generator. Furthermore, this statement discovers the deep relationship between the error-correcting coding theory and the modern cryptography.
基金Project supported by the National Natural Science Foundation of China (Grant No. 61072071)
文摘Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to implement a quantum （k, 2k-1） threshold scheme. It also takes advantage of classical enhancement of the [2k-1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.
文摘This paper demonstrates how channel coding can improve the robustness of spatial image watermarks against signal distortion caused by lossy data compression such as the JPEG scheme by taking advantage of the properties of Gray code. Two error-correction coding (ECC) schemes are used here: One scheme, referred to as the vertical ECC (VECC), is to encode information bits in a pixel by error-correction coding where the Gray code is used to improve the performance. The other scheme, referred to as the horizontal ECC (HECC), is to encode information bits in an image plane. In watermarking, HECC generates a codeword representing watermark bits, and each bit of the codeword is encoded by VECC. Simple single-error-correcting block codes are used in VECC and HECC. Several experiments of these schemes were conducted on test images. The result demonstrates that the error-correcting performance of HECC just depends on that of VECC, and accordingly, HECC enhances the capability of VECC. Consequently, HECC with appropriate codes can achieve stronger robustness to JPEG—caused distortions than non-channel-coding watermarking schemes.
文摘In this paper, error-correction coding (ECC) in Gray codes is considered and its performance in the protecting of spatial image watermarks against lossy data compression is demonstrated. For this purpose, the differences between bit patterns of two Gray codewords are analyzed in detail. On the basis of the properties, a method for encoding watermark bits in the Gray codewords that represent signal levels by a single-error-correcting (SEC) code is developed, which is referred to as the Gray-ECC method in this paper. The two codewords of the SEC code corresponding to respective watermark bits are determined so as to minimize the expected amount of distortion caused by the watermark embedding. The stochastic analyses show that an error-correcting capacity of the Gray-ECC method is superior to that of the ECC in natural binary codes for changes in signal codewords. Experiments of the Gray-ECC method were conducted on 8-bit monochrome images to evaluate both the features of watermarked images and the performance of robustness for image distortion resulting from the JPEG DCT-baseline coding scheme. The results demonstrate that, compared with a conventional averaging-based method, the Gray-ECC method yields watermarked images with less amount of signal distortion and also makes the watermark comparably robust for lossy data compression.
文摘The performance analysis and simulation of coding schemes based on the modeling Ka band fixed satellite channel have been presented. The results indicate that concatenated codes with large inner interleaving depth have good performance and high spectrum efficiency. The studies also show that simple block interleaving is very effective in combating the slow frequency nonselective fading of Ka band.
基金The project supported by National Natural Science Foundation of China under Grant Nos.60472018 and 60573127partly supported by the Postdoctoral Science Foundation of Central South University
文摘Exploiting the encoding process of the stabilizer quantum code [[n, k, d]], a deterministic quantum communication scheme, in which n - 1 photons are distributed forward and backward in two-way channel, is proposed to transmit the secret messages with unconditional security. The present scheme can be implemented to distribute the secret quantum （or classical） messages with great capacity in imperfect quantum channel since the utilized code encodes k-qubit messages for each scheme run.
基金The Ministerial Level Advanced Research Foundation
文摘In order to eliminate float-point operations for fast wavelet transform, an integer D9/7 biorthogonal reversible wavelet transform was accomplished by lifting scheme. The lifting scheme based wavelet transform can be finished by addition and shift simply. It improved the quality of reconstructive image and greatly reduced the computational complexity due to integer operation. It is suitable for real-time image coding on hardware such as DSP. The simulation results show that the lifting scheme based SPIHT is prior to traditional wavelet based SPHIT in quality and complexity.
文摘A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.
基金Supported by the National Natural Science Foundation of China (11271237)
文摘In this paper, we propose a novel space efficient secret sharing scheme on the basis of minimal linear codes, which satisfies the definition of a computationally efficient secret sharing scheme. In the scheme, we partition the underlying minimal linear code into disjoint classes, establishing a one-to-one correspondence between the minimal authorized subsets of participants and the representative codewords of all different classes. Each participant, with only one short share transmitted through a public channel, can share a large secret. Therefore, the proposed scheme can distribute a large secret in practical applications such as secure information dispersal in sensor networks and secure multiparty computation.
基金Supported by the National Natural Science Foundation of China (61271122)the Natural Science Foundation of Anhui Province(1208085MF102)
文摘In this paper, the cyclic code of the classic circuit is transformed and transplanted; then, the quantum encoding scheme based on cyclic code and quantum error-correction circuit is constructed. The proposed circuit can correct one-bit error, and the use of redundant bits to encode more than one-bit quantum information breaks the previous limitations of many bits encoding a quantum bit. Compared with the existing coding circuits （Shor code, Steane code and five stable subcode）, it shows obvious superiority in the quantum coding efficiency and transmission efficiency.
基金Supported by the National Natural Science Foundation of China (60673092)Natural science Foundation of Ji-angsu Province (No.BK2003029)the Key Laboratory Project of Information Science & Engineering of Railway of the Ministry of Railways, China (No.TDXX0501).
文摘Block matching has been used for motion estimation and motion compensation in the Au- dio and Video Standard (AVS) for years. While having an acceptable performance in describing mo- tion between frames, it requires quite a few bits to represent the motion vectors. In certain circum- stances, the use of global motion estimation and compensation would perform equally well or even better than the block matching in terms of motion accuracy, while it results in the coding of global motion model parameters. In this letter, we modify an AVS coder by adding (1) six global motion model parameters to the frame header, and (2) mode selection among INTRA, SKIP, INTER-16×16, INTER-16×8, INTER-8×16, INTER-8×8, and Global Motion Compensation (GMC) modes by La- grange optimal rate-distortion criteria. Simulation results demonstrate that over 0.1dB improvement in PSNR is obtained compared to the AVS coder for an average coded P-frame with the same bit- rate.
文摘Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct the secret sharing schemes. Since the code of a symmetric （V, k, λ）-design is a linear code, this study is about the secret sharing schemes based on C of Fp-code C of asymmetric （v, k, λ）-design.
文摘Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.
基金supported by the National High Technology and Development Program of China (No.61971079)the Postgraduate Science Research Innovation project of Chongqing Municipal Education Commission (No.CYS20266)。
文摘In order to improve the spectrum efficiency of the high-order polar coded modulation systems, the polar code is used as the component code of the bit-interleave coded modulation(BICM) system, a novel bit mapping scheme is proposed considering of the channel polarization and successive cancellation(SC) decoding principle of polar codes as well as the unequal protection of equivalent channels by modulator. In this scheme, the frozen bits on the unreliable split channel are allocated to the equivalent channel with the low protection of the modulator, while the equivalent channels with the high protection are used to transmit the information bits. Thus, the error-correcting performance of polar codes is improved. Compared with some bit mapping schemes, the proposed bit mapping scheme only needs to divide and choose the parameters of the split channels reliability measurement, the complexity does not increase obviously, and simulation results show that the proposed scheme has the better performance under the quadrature amplitude modulation(QAM) modulation based on the Gray mapping.
文摘The authors regret Acknowledgements Firstly,the authors wish to acknowledge the academic support from Ruhr University Bochum during the first author's(Xiao Yan)research stay from 2018.11 to 2020.10,including the soft code implement and debug support from Vladislav Gudzulic and academic advising from Günther Meschke.
基金The Science and Technology Support Program of Jiangsu Province(No.BE2011173)the Future Network Proactive Program of Jiangsu Province(No.BY2013095-5-03)the Program for Special Talent in Six Fields of Jiangsu Province(No.2011-DZ024)
文摘In order to detect web shells that hackers inject into web servers by exploiting system vulnerabilities or web page open sources, a novel web shell detection system based on the scoring scheme is proposed, named Evil-hunter. First, a large set of malicious function samples normally used in web shells are collected from various sources on the Internet and security forums. Secondly, according to the danger level and the frequency of using these malicious functions in the web shells as well as in legal web applications, an assigning score strategy for each malicious sample is devised. Then, the appropriate score threshold value for each sample is obtained from the results of a statistical analysis. Finally, based on the threshold value, a simple algorithm is presented to identify files that contain web shells in web applications. The experimental results show that compared with other approaches, Evil-hunter can identify web shells more efficiently and accurately.
基金Supported by the National Natural Science Foundation of China (No.60403004)the Outstanding Youth Foundation of China (No.0612000500)
文摘It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal property through algorithms. We also give a better upper bound of the designed distance of a classical narrow-sense BCH code which contains its Euclidean dual. Besides these, we also give one algorithm to compute the dimension of these codes. The complexity of all algorithms is analyzed. Then the results can be applied to construct a series of quantum BCH codes via the famous CSS constructions.
