3篇
您的检索式：作者名="Zhenbin Yan"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Detection and fine-mapping of SC7 resistance genes via linkage and association analysis in soybean显示文摘Soybean mosaic virus(SMV) disease is one of the most serious and broadly distributed soybean(Glycine max(L.) Merr.) diseases. Here, we combine the advantages of association and linkage analysis to identify and fine-map the soybean genes associated with resistance to SMV strain SC7.A set of 191 soybean accessions from different geographic origins and 184 recombinant inbred lines(RILs) derived from Kefeng No.1(resistant) Nannong 1138-2(susceptible) were used in this study. The SC7 resistance genes were previously mapped to a 2.65 Mb region on chromosome 2 and a 380 kb region on chromosome 13. Among 19 single nucleotide polymorphisms(SNPs) detected via association analysis in the study, the SNP BARC-021625-04157 was located in the2.65 Mb region, and the SNP BARC-041671-08065 was located near the 380 kb region; three genes harboring the SNPs were probably related to SC7 resistance. The resistance gene associated with BARC-021625-04157 was then finemapped to a region of approximately 158 kb on chromosome2 using 184 RILs. Among the 15 genes within this region, one NBS-LRR type gene, one HSP40 gene and one serine carboxypeptidase-type gene might be candidate SC7 resistance genes. These results will be useful for map-based cloning and marker-assisted selection in soybean breeding programs. | Honglang Yan Hui Wang Hao Cheng Zhenbin Hu Shanshan Chu Guozheng Zhang Deyue Yu | 2015 | Journal of Integrative Plant Biology2015，57，8： | 10 |
| 2 | Concurrent non-malleable zero-knowledge and simultaneous resettable non-malleable zero-knowledge in constant rounds显示文摘Concurrent non-malleable zero-knowledge(CNMZK)considers the concurrent execution of zero-knowledge protocols in a setting even when adversaries can simultaneously corrupt multiple provers and verifiers.As far as we know,the round complexity of all the constructions of CNMZK arguments for NP is at least ω(log n).In this paper,we provide the first construction of a constant-round concurrent non-malleable zero-knowledge argument for every language in NP.Our protocol relies on the existence of families of collision-resistant hash functions,one-way permutations and indistinguishability obfuscators.As an additional contribution,we study the composition of two central notions in zero knowledge,the simultaneously resettable zero-knowledge and non-malleable zero-knowledge,which seemingly have stronger proved security guarantees.We give the first construction of a constant-round simultaneously-resettable non-malleable zero-knowledge.To the best of our knowledge,this is the first study to combine the two security concepts described above together in the zero-knowledge protocols. | Zhenbin Yan Yi Deng Yiru Sun | 2018 | Cybersecurity2018，1，1： | 0 |
| 3 | A novel approach to public-coin concurrent zero-knowledge and applications on resettable security显示文摘Canetti, Lin and Paneth in TCC 2013 showed a O(log^(1+ε)n) rounds public-coin concurrent zeroknowledge argument system(CZK) based on the existence of collision resistant hash functions, which is currently known as round optimal public-coin CZK from standard assumptions. In this paper, we further address this problem and present an alternative construction of public-coin CZK argument system with succinct slot. The key technique involves a new variant of Barak's non-black-box simulate approach. In particular, the original protocol uses n commitments in each slot, while our construction uses one commitment in each slot. Through our simulation techniques, the simulator recovers any previous state needed for the probabilistically checkable proof(PCP) from the current committed state, which, in our view, may be of independent interest. Furthermore, the public-coin CZK argument system can be transformed into a resettable security protocol based on the one way functions assumption. Therefore, we present a new construction of the simultaneous resettable zero-knowledge argument system. | Zhenbin YAN Yi DENG | 2019 | Science China(Information Sciences)2019，62，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员