基于椭圆曲线(t,n)门限共享解签密方案  

(t,n)Threshold Sharing Unsigncryption Scheme Based On the ECC

作　　者：黄国芳[1] 汪学明[1] 

机构地区：[1]贵州大学信息工程学院,贵州贵阳550003

出　　处：《贵州工业大学学报（自然科学版）》2007年第4期47-50,55,共5页Journal of Guizhou University of Technology(Natural Science Edition)

基　　金：贵州省自然科学基金资助项目(20052110);贵州省自然科学基金资助项目(20052107)

摘　　要：基于椭圆曲线提出一个带可信中心的(t,n)门限共享解签密方案。该方案综合了对称加密、Shamir门限方案和Junn方案的优点,除了计算量与通信量少外,还具有保密性、认证性、不可伪造性、不可否认性、抵抗接收组成员欺骗等特点,满足群体通信的要求,对存储容量和计算能力有限的硬件开发而言,该方案具有很大的实用价值和应用前景。在该方案中如果收发双方出现争论时,可信中心在没有发送方私钥的情况下,直接能够验证发送方的签密。最后分析了该方案的安全性。A （t, n）Threshold sharing unsigncryption scheme with CA based on the ECC is proposed, which combines the advantages of symmetric encryption algorithm, Shamir＇ s threshold and Junn＇ s scheme functions. It not only provides lower computation and communication, but also message confidentiality,authentication, unforgeability, non_ repudiation, resisitance of malicious verifiers cheating others and so on, thus it satisfies the request of group communication and has great practical value and application prospect for the restriction of storage and computation developed hardware. In the proposed scheme, the CA can verify sender＇s signcryption directly without the sender＇s private key when dispute occurs. Its security is also analyzed.

关 键 词：解签密 门限共享 椭圆曲线离散对数问题 可信中心 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]