During the floral transition the shoot apical meristem changes its identity from a vegetative to an inflorescence state. This change in identity can be promoted by external signals, such as inductive photoperiod condi...During the floral transition the shoot apical meristem changes its identity from a vegetative to an inflorescence state. This change in identity can be promoted by external signals, such as inductive photoperiod conditions or vernalization, and is accompanied by changes in expression of key developmental genes. The change in meristem identity is usually not reversible, even if the inductive signal occurs only transiently. This implies that at least some of the key genes must possess an intrinsic memory of the newly acquired expression state that ensures irreversibility of the process. In this review, we discuss different molecular scenarios that may underlie a molecular memory of gene expression.展开更多
Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for ...Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for short) with NIZK proofs is proposed which can prove and sign the multiple values rather than individual bits based on DLIN assumption. DLAGS does not need to interact between the verifier and issuer,which can decrease the communication times and storage cost compared with the existing interactive group signature schemes. We prove and sign the blocks of messages instead of limiting the proved message to only one bit(0 or 1) in the conventional non-interactive zero-knowledge proof system,and we also prove that our scheme satisfy the property of anonymity,unlinkability and traceability. Finally,our scheme is compared with the other scheme(Benoitt's scheme) which is also based on the NIZK proofs system and the DLIN assumption,and the results show that our scheme requires fewer members of groups and computational times.展开更多
文摘During the floral transition the shoot apical meristem changes its identity from a vegetative to an inflorescence state. This change in identity can be promoted by external signals, such as inductive photoperiod conditions or vernalization, and is accompanied by changes in expression of key developmental genes. The change in meristem identity is usually not reversible, even if the inductive signal occurs only transiently. This implies that at least some of the key genes must possess an intrinsic memory of the newly acquired expression state that ensures irreversibility of the process. In this review, we discuss different molecular scenarios that may underlie a molecular memory of gene expression.
基金supported by the National High-Tech Research and Development Plan of China under Grant Nos.863-317-01- 04-99, 2009AA01Z122 (863)the Natural Science Foundation of Shenyang City of China under Grant No. F10-205-1-12
文摘Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for short) with NIZK proofs is proposed which can prove and sign the multiple values rather than individual bits based on DLIN assumption. DLAGS does not need to interact between the verifier and issuer,which can decrease the communication times and storage cost compared with the existing interactive group signature schemes. We prove and sign the blocks of messages instead of limiting the proved message to only one bit(0 or 1) in the conventional non-interactive zero-knowledge proof system,and we also prove that our scheme satisfy the property of anonymity,unlinkability and traceability. Finally,our scheme is compared with the other scheme(Benoitt's scheme) which is also based on the NIZK proofs system and the DLIN assumption,and the results show that our scheme requires fewer members of groups and computational times.
