Secret image sharing is an attractive research problem in information security filed. After more than ten years of development, secret image sharing has become a relatively independent area. Most current secret image ...
详细信息
Secret image sharing is an attractive research problem in information security filed. After more than ten years of development, secret image sharing has become a relatively independent area. Most current secret image sharing scheme used Lagrange interpolation of Shamir scheme as the core idea, but which way will greatly reduce the computational efficiency and system availability without a doubt because of a huge amount of data in images. According to the internal relationship between coding theory and secret sharing technology, the paper proposed a secret image scheme based on coding theory. In addition to have advantages which most secret image sharing schemes based on Lagrange interpolation own, the new method which has a more simple idea reduced computational complexity and easy to extend the field of video and audio, so has a more obvious practical value;The design and realization of the new secret image sharing scheme has indirectly proved the internal relationship between coding and secret sharing scheme. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of Harbin University of Science and Technology.
erasurecode has been used by more and more researchers to solve the problem of efficient, reliable, and fault-tolerant data storage. However, the existing libraries based on erase code can only run on the Linux platf...
详细信息
erasurecode has been used by more and more researchers to solve the problem of efficient, reliable, and fault-tolerant data storage. However, the existing libraries based on erase code can only run on the Linux platform, and some of them need GPU support. This paper implements a cross-platform data fault-tolerant storage library based on rs erasure code, Pyrs, which is running on CPU without GPU support and developed in Python. Pyrs uses Vandermonde matrix as the coding matrix and Numba and NumPy libraries to speed up and optimize the program. This paper compares Pyrs with Jerasure on the same Linux platform. The results show that the encoding and decoding speed of Pyrs is 8 times faster than that of Jerasure. The CPU usage rate of both is about 25% and the memory usage rate of Pyrs is about 5% higher than that of Jerasure. The same experiments are carried out on Pyrs on the Windows platform. Experimental results show that compared with running on the Linux platform, Pyrs running on the Windows platform has almost the same speed of encoding and decoding, and its CPU usage rate increases by about 15%, while its memory usage rate decreases by about 5%.
Secret image sharing is an attractive research problem in information security filed. After more than ten years of development, secret image sharing has become a relatively independent area. Most current secret image ...
详细信息
Secret image sharing is an attractive research problem in information security filed. After more than ten years of development, secret image sharing has become a relatively independent area. Most current secret image sharing scheme used Lagrange interpolation of Shamir scheme as the core idea, but which way will greatly reduce the computational efficiency and system availability without a doubt because of a huge amount of data in images. According to the internal relationship between coding theory and secret sharing technology, the paper proposed a secret image scheme based on coding theory. In addition to have advantages which most secret image sharing schemes based on Lagrange interpolation own, the new method which has a more simple idea reduced computational complexity and easy to extend the field of video and audio, so has a more obvious practical value; The design and realization of the new secret image sharing scheme has indirectly proved the internal relationship between coding and secret sharing scheme.
Reed-Solomon erasurecode is one of the most studied protection methods for video streaming over unreliable networks. As a block-based error correcting code, large block size and increased number of parity packets wil...
详细信息
ISBN:
(纸本)9781479961399
Reed-Solomon erasurecode is one of the most studied protection methods for video streaming over unreliable networks. As a block-based error correcting code, large block size and increased number of parity packets will enhance its protection performance. However, for video applications this enhancement is sacrificed by the error propagation and the increased bitrate. So, to tackle this paradox, we propose a rate-distortion optimized redundancy allocation scheme, which takes into consideration the distortion caused by losing each slice and the propagated error. Different from other approaches, the amount of introduced redundancy and the way it is introduced are automatically selected without human interventions based on the network condition and video characteristics. The redundancy allocation problem is formulated as a constraint optimization problem, which allows to have more flexibility in setting the block-wise redundancy. The proposed scheme is implemented in JM14.0 for H.264, and it achieves an average gain of 1dB over the state-of-the-art approach.
Blockchain is a distributed digital ledger with features such as tamper-proof and privacy protection, which can provide reliable security solutions for the Internet of Things, smart home, and other scenarios. However,...
详细信息
Blockchain is a distributed digital ledger with features such as tamper-proof and privacy protection, which can provide reliable security solutions for the Internet of Things, smart home, and other scenarios. However, most of the devices in these scenarios only have limited computing, storage, bandwidth, and other resources, which makes it difficult to bear the burden of the blockchain consensus process and subsequent storage of the blockchain ledger. Therefore, a lightweight blockchain needs to be designed to suit for resource-constrained device scenarios. In order to achieve lightweight blockchain, an improved PBFT blockchain consensus mechanism based on reward and punishment strategy is proposed in this paper. Moreover, to reduce the storage overhead on the premise of ensuring the recoverability of blockchain, a blockchain storage optimization scheme based on rs erasure code is proposed in this paper. Experimental results show that the strategies proposed in this paper can reduce the delay of the consensus, the communication resources required by the consensus, and the cost of blockchain storage.
暂无评论