Search

Fusarium wilt is a severe and worldwide disease in potato cultivation. In this study, Fusarium foetens was first identified as the pathogen of potato wilt. Bacillus subtilis SF1 has the potential for controlling potato wilt induced by F. foetens, resulting in a mycelium growth inhibition of 52.50 ± 2.59% in vitro and a significant decrease in incidence rate by 45.56% in vivo. This research highlighted the antifungal activity of surfactin from B. subtilis SF1 and attempted to reveal the unknown antifungal mechanisms. Surfactin inhibited F. foetens mycelium growth beyond the concentration of 20 µg/µL. Surfactin-treated mycelium appeared to have morphological malformation. Surfactin enhanced reduced glutathione production and caused the increase in values of the extracellular fluids in OD260 and OD280. Surfactin induced differential protein expression and changed the genes' transcription levels. Surfactin binds to fungal DNA via groove-binding mode, with a binding constant of Kb 2.97 x 104 M-1. Moreover, B. subtilis SF1 harbored genes encoding plant-promoting determinants, making potato seedlings grow vigorously. The results will help provide a comprehensive understanding of the mechanisms of surfactin against filamentous fungi and the application of surfactin-producing microbial in the biocontrol of plant pathogenic fungi. [ABSTRACT FROM AUTHOR]

The internet-of-things (also known as IoT) connects a large number of information-sensing devices to the Internet to collect all kinds of information needed in real time. The reliability of the source of a large number of accessed information tests the processing speed of signatures. Batch signature allows a signer to sign a group of messages at one time, and signatures’ verification can be completed individually and independently. Therefore, batch signature is suitable for data integration authentication in IoT. An outstanding advantage of batch signature is that a signer is able to sign as many messages as possible at one time without worrying about the size of signed messages. To reduce complexity yielded by multiple message signing, a binary tree is usually leveraged in the construction of batch signature. However, this structure requires a batch residue, making the size of a batch signature (for a group of messages) even longer than the sum of single signatures. In this paper, we make use of the intersection method from lattice to propose a novel generic method for batch signature. We further combine our method with hash-and-sign paradigm and Fiat–Shamir transformation to propose new batch signature schemes. In our constructions, a batch signature does not need a batch residue, so that the size of the signature is relatively smaller. Our schemes are securely proved to be existential unforgeability against adaptive chosen message attacks under the small integer solution problem, which shows great potential resisting quantum computer attacks. [ABSTRACT FROM AUTHOR]