No abstract

This paper proposes a novel scheme of scalable coding for encrypted images. In the encryption phase, the original pixel values are masked by a modulo-256 addition with pseudorandom numbers that are derived from a secret key. After decomposing the encrypted data into a downsampled subimage and several data sets with a multiple-resolution construction, an encoder quantizes the subimage and the Hadamard coefficients of each data set to reduce the data amount. Then, the data of quantized subimage and coefficients are regarded as a set of bitstreams. At the receiver side, while a subimage is decrypted to provide the rough information of the original content, the quantized coefficients can be used to reconstruct the detailed content with an iteratively updating procedure. Because of the hierarchical coding mechanism, the principal original content with higher resolution can be reconstructed when more bitstreams are received.

Pot and field experiments were conducted to study the effects of mulching with straw of cadmium (Cd) tolerant plants (Ranunculus sieboldii, Mazus japonicus, Clinopodium confine and Plantago asiatica) on growth and Cd accumulation of Galinsoga parviflora in Cd-contaminated soil. In the pot experiment, mulching with M. japonicus straw increased the root biomass, stem biomass, leaf biomass, shoot biomass, plant height and activities of antioxidant enzymes (superoxide dismutase, peroxidase and catalase) of G. parviflora compared with the control, whereas mulching with straws of R. sieboldii, C. confine and P. asiatica decreased these parameters. Straws of the four Cd-tolerant plants increased the Cd content in roots of G. parviflora compared with the control. However, only straws of M. japonicus and P. asiatica increased the Cd content in shoots of G. parviflora, reduced the soil pH, and increased the soil exchangeable Cd concentration. Straw of M. japonicus increased the amount of Cd extraction in stems, leaves and shoots of G. parviflora by 21.11%, 29.43% and 24.22%, respectively, compared with the control, whereas straws of the other three Cd-tolerant plants decreased these parameters. In the field experiment, the M. japonicus straw also increased shoot biomass, Cd content in shoots, and amount of Cd extraction in shoots of G. parviflora compared with the control. Therefore, straw of M. japonicus can be used to improve the Cd extraction ability of G. parviflora from Cd-contaminated soil.

No abstract

No abstract

The problem of securely outsourcing computation has received widespread attention due to the development of cloud computing and mobile devices. In this paper, we first propose a secure verifiable outsourcing algorithm of single modular exponentiation based on the one-malicious model of two untrusted servers. The outsourcer could detect any failure with probability 1 if one of the servers misbehaves. We also present the other verifiable outsourcing algorithm for multiple modular exponentiations based on the same model. Compared with the state-of-the-art algorithms, the proposed algorithms improve both checkability and efficiency for the outsourcer. Finally, we utilize the proposed algorithms as two subroutines to achieve outsource-secure polynomial evaluation and ciphertext-policy attributed-based encryption (CP-ABE) scheme with verifiable outsourced encryption and decryption.

Quantum digital signatures can be used to authenticate classical messages in an information-theoretically secure way. Previously, a novel quantum digital signature for classical messages has been proposed and gave an experimental demonstration of distributing quantum digital signatures from one sender to two receivers. Some improvement versions were subsequently presented, which made it more feasible with present technology. These proposals for quantum digital signatures are basic building blocks which only deal with the problem of sending single bit messages while no-forging and non-repudiation are guaranteed. For a multi-bit message, it is only mentioned that the basic building blocks must be iterated, but the iteration of the basic building block still does not suffice to define the entire protocol. In this paper, we show that it is necessary to define the entire protocol because some attacks will arise if these building blocks are used in a naive way of iteration. Therefore, we give a way of defining an entire protocol to deal with the problem of sending multi-bit messages based on the basic building blocks and analyse its security.

No abstract