关于实多项式型公钥密码体制的探讨

用公钥密码的基本要求来徇实多项式型公钥密码体制，设计了一个破译算法彻底地攻破了这一体制，更进一步地指出了所谓实多项式公钥密码在计算机上实现仍然是有理多项式密码。     

一种基于双线性对的公开可验证多秘密共享方案

针对部分多秘密共享方案的安全性依赖于单一系数的问题,基于双线性对和Shamir门限体制,设计了一种可公开验证的多秘密共享方案。在该方案中,参与者的私钥计算和秘密分发过程分离,参与者私钥由参与者自己选择且只需保存一个私钥,就可以实现共享任意多个秘密。在秘密分发阶段和秘密恢复阶段具有可公开验证性,任何人都可以验证秘密份额的正确性,有效防止了不诚实参与者和分发者的欺诈行为。秘密分发者与参与者在公开信道中传输信息而不需要维护一个秘密信道,降低了系统开销。多秘密的共享分布在多个系数当中,单个系数或秘密的泄漏不会造成其他秘密的泄露,同时椭圆曲线离散对数和双线性Diffie-Hellman问题的求解困难性,确保了方案的安全性。最后对方案的正确性和拓展性等给出了数学证明和理论分析。     

Complex Threshold Key Management for Ad Hoc Network

A complex threshold key management framework has been proposed, which can address the challenges posed by the unique nature of Ad hoe network. Depending on the cooperation of the controller and participation nodes, this scheme should be efficient in the operation environmental alteration and tolerant faults of node, which take the advantages of the benefits of both key management approaches and alleviate their limitations. For the cooperation of the controller and participation nodes, a (t,n) threshold Elliptic curve sign-eneryption scheme with the specified receiver a/so has been proposed. Using this threshold signencryption scheme, the key management distributes the trust between a controller and a set of participation nodes.     

可防止欺骗的可视密码分享方案

提出了一种可以检测出一个欺骗者的(k，n)门限的可视密码的定义和构造方法，并证明了其安全性．当存在一个欺骗者出示了假的分享时将导致秘密恢复失败，这种构造方法可以检测出谁是欺骗者，其特点如一般的可视密码分享方案．参与者手中只要保存一份分享图像，不需要额外的信息，并且检测欺骗者的过程只需要k次胶片叠加，体现了可视密码使用方便性的原则．     

Applying evolutionary algorithm to public key cryptosystems

A best algorithm generated scheme is proposed in the paper by making use of the thought of evolutionary algorithm, which can generate dynamically the best algorithm of generating primes in RSA cryptography under different conditions. Taking into account the factors of time, space and security integrated, this scheme possessed strong practicability. The paper also proposed a model of multi-degree parallel evolutionary algorithm to evaluate synthetically the efficiency and security of the public key cryptography. The model contributes to designing public key cryptography system too. Foundation item: Supported by the Hi-Tech Research and Development Foundation item: Supported by the Hi-Tech Research and Development Biography; Tu Hang (1975-), male, Ph. D candidate, research directions: Biography; Tu Hang (1975-), male, Ph. D candidate, research directions:     

综合数字防伪方案

为了满足防伪条码生产及验证过程的安全性,提出采用数字进行产品防伪的综合方案。针对数字防伪的特征提出采用对称加密算法及哈希函数来产生防伪号码来保证其不可伪造性,并加入公钥加密算法保证对称算法密钥的安全;为防止网络上的木马程序攻击,提出在验证服务器和Web服务器间进行并口通信来保护验证服务器上敏感数据的安全,从而达到验证过程的安全性要求。最后,对方案可能遭到的攻击进行分析,结果表明方案是安全的。     

BSC（2^m,2^n）密码的递归表示与双对称性证明

在已有研究成果的基础上,进一步研究了双对称密码ＢＳＣ（２＾ｍ,２＾ｎ）算法设计,给出了ＢＳＣ（２＾ｍ,２＾ｎ）算法的递归表示,并严格证明了ＢＳＣ（２＾ｍ,２＾ｎ）密码是双对称的。     

以信道编码为载体的信息隐藏技术研究

介绍了在信息处理技术、通信技术和网络技术的飞速发展,使信息传输和交流简单易行的同时,也对信息安全提出了更高的要求.分析了信息加密技术和信息隐藏技术的特点,提出了有噪信道信息隐藏技术,这是对信息安全的新的尝试,为隐秘通信提供了一种更加高效安全的方法,必将在未来的信息安全体系中发挥重要作用.     

半透明窃听方式下B92协议的安全性研究

在量子密码中应用量子测量信道的概念及信息论理论，计算了量子保密通信的B92协议在半透明截取攻击方式下敌手和合法接收方能获得的信息量、信号传输中的位错误率，为合法者的安全通信和对敌手的检测提供了理论依据和标准．     

Proxy Multisignature Scheme with （t, m） Threshold Shared Verification

A proxy multisignature scheme with （t, m） threshold shared verification is first proposed based on elliptic curve. In proposed scheme, a proxy signer can sign a message on behalf of n original signers for specific group of verifiers and only any t or more verifiers together in the specific group of verifiers are able to verify the validity of the proxy multisignature on behalf of the group of specific verifiers, but t-1 or fewer verifiers can not. Since the proposed scheme is constructed based on elliptic curve, it requires smaller bandwidth and achieves more secrecy of data transmission; it is more etffcient for signature and verification etc.