基于安全多方计算的匿名认证方案  

Anonymous authentication scheme based on secure multiparty computation

作　　者：周文钦 张也弛[1,2] 石润华[1,2] 

机构地区：[1]安徽大学计算智能与信号处理教育部重点实验室,合肥230039 [2]安徽大学计算机科学与技术学院,合肥230039

出　　处：《计算机工程与应用》2014年第24期81-85,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61173187;No.61173188);安徽省自然科学基金(No.11040606M141);安徽大学博士科研启动经费项目(No.33190187);安徽大学"信息安全"新专业项目(No.17110099)

摘　　要：把匿名认证抽象为一个具体的安全多方计算问题,转而寻求对该具体问题的求解。基于线性方程组的求解理论,构建了一个匿名认证模型。继而设计了一个两方安全计算矩阵与向量乘积协议,并基于该协议提出了一个完整的匿名认证方案。该方案安全、高效,存储开销小,特别适宜于资源受限的设备或网络。This paper takes anonymous authentication as a special secure multi-party computation problem and turns to the solution of this problem. This paper constructs an anonymous authentication model based on the basic theory of solving linear equations. A secure two-party multiplication protocol of matrix and vector is presented, and further the whole anonymous authentication scheme is proposed based on this multiplication protocol. The proposed scheme is secure and efficient, and it is very adaptable for resource-constrained devices or networks since its storage cost is low.

关 键 词：密码编码学 安全多方计算 匿名认证 线性方程组 

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