“不+名”的现有解释问题及其启示

通过考察"不+名"的现有解释,发现了汉语研究的某些问题,如模仿印欧语词类研究模式给汉语词分类与归类而徒增混乱,趋从"语言学原理"研究汉语而脱离汉语实际,受共时论误导,造成无根之说等,都是汉语研究的基本问题。要解决这些问题,就需要更新语言观,完善方法论,坚持论从史出、论从材料来的原则,立足汉语实际做研究。这不仅是结束步趋人后之历史的必要条件,也是开创汉语研究新局面的必由之路。

Verifiable threshold signature schemes against conspiracy attack

In this study, the author has designed new verifiable (t, n) threshold untraceable signature schemes. The proposed schemes have the following properties: ( 1 ) Verification: The shadows of the secret distributed by the trusted center can be verified by all of the participants; (2) Security: Even if the number of the dishonest member is over the value of the threshold, they cannot get the system secret parameters , such as the group secret key, and forge other member's individual signature; (3) Efficient verification: The verifier can verify the group signature easily and the verification time of the group signature is equivalent to that of an individual signature; (4) Untraceability: The signers of the group signature cannot be traced.

Preventing“Bad”Content Dispersal in Named Data Networking

Named Data Networking(NDN)improves the data delivery efficiency by caching contents in routers. To prevent corrupted and faked contents be spread in the network,NDN routers should verify the digital signature of each published content. Since the verification scheme in NDN applies the asymmetric encryption algorithm to sign contents,the content verification overhead is too high to satisfy wire-speed packet forwarding. In this paper, we propose two schemes to improve the verification performance of NDN routers to prevent content poisoning. The first content verification scheme, called "user-assisted",leads to the best performance, but can be bypassed if the clients and the content producer collude. A second scheme, named ``RouterCooperation ‘', prevents the aforementioned collusion attack by making edge routers verify the contents independently without the assistance of users and the core routers no longer verify the contents. The Router-Cooperation verification scheme reduces the computing complexity of cryptographic operation by replacing the asymmetric encryption algorithm with symmetric encryption algorithm.The simulation results demonstrate that this Router-Cooperation scheme can speed up18.85 times of the original content verification scheme with merely extra 80 Bytes transmission overhead.

Thymoquinone and Poloxin are slow-irreversible inhibitors to human Polo-like kinase 1 Polo-box domain

Objective： To provide a kinetic model（s） and reveal the mechanism of thymoquinone and Poloxin blocking an emerging anti-cancer target, human Polo-like kinase 1 （hPlkl） Polo-box domain （PBD）. Methods： The binding kinetics was determined by using a fluorescence polarization based assay. The putative mechanism was examined with a competition test. Results： Thymoquinone follows a one-step binding with an association rate constant （k1） of 6.635× 10^3 L.mol^-1 min^-1.Poloxin fit a two-step binding with a dissociation constant （Ki） of 118 μmol/L for the intermediate complex and its isomerization rate （k4） of 0.131 5 minJ to form an irreversible adduct. No significant dissociation was observed for either ligand up to 13 h. The inhibitors responded insignificantly to the presence of Michael donors as hPIkl-PBD competitors. Conclusion： Thymoquinone and Poloxin are slow-tight ligands to the hPlkl-PBD with kinetic models distinct from each other. Michael addition as the mechanism is excluded.

THRESHOLD PROXY RE-SIGNATURE

The focus of this paper is to design an efficient and secure solution addressing the semi trusted issue in proxy re-signature schemes, i.e., the proxy knows the re-signature key from user A to user B, so he is able to translate any signatures made by user A to user B, which damages the essential requirement （＂non-repudiation＂ property） of proxy re-signature schemes. In this paper, the authors first define the security model for threshold proxy re-signature scheme, and then propose two threshold proxy re-signature schemes based on Ateniese-Hohenberger＇s and Shao-Cao-Wang-Liang＇s approach.

Provably Secure and Efficient Proxy Signature with Untrustworthy Proxy Signer

Proxy signature has drawn great concerns. However, there still remains a challenge to construct a provably secure and efficient proxy signature scheme. In this paper, we propose an efficient proxy signature scheme based on factoring, and prove that it is secure in the random oracle. Furthermore, we present a new type of proxy signature, called Proxy Signature with Untrustworthy Proxy Signer, and construct a concrete scheme.

An Arbitrated Quantum Signature Scheme without Entanglement

Several quantum signature schemes are recently proposed to realize secure signatures of quantum or classical messages. Arbitrated quantum signature as one nontriviai scheme has attracted great interests because o~ its usefulness and efficiency. Unfortunately, previous schemes cannot against Trojan horse attack and DoS attack and lack of the unforgeability and the non-repudiation. In this paper, we propose an improved arbitrated quantum signature to address these secure issues with the honesty arbitrator. Our scheme takes use of qubit states not entanglements. More importantly, the qubit scheme can achieve the unforgeability and the non-repudiation. Our scheme is also secure for other known quantum attacks.