摘要
在通用可组合框架下研究安全多方计算的公平性问题。在UC框架下,提出公平安全多方计算的安全模型。在模型中形式化定义了公平安全多方加法计算理想函数FSMPAF和公平安全多方乘法计算理想函数FSMPMF。然后,基于双线性对技术和承诺方案理想函数COMF,在COMF-混合模型下分别设计公平加法协议FSMPAπ和公平乘法协议FSMPMπ安全实现理想函数FSMPAF和FSMPMF。最后,性能分析表明所提协议的有效性,能更好地满足应用需求。
The fair problem of secure multiparty computation protocol was investigated in the universally composable framework. A fair secure multiparty computation model with ideal functionalities was firstly formulated such as a fair secure multiparty addition computation and a fair secure multiparty multiplicative computation. Next a fair addition computation protocol and a fair multiplicative computation protocol based on the bilinear paring and the ideal functionality of a commit- ment scheme was proposed. The proposed protocols can securely realize their ideal functionalities in the hybrid model re- spectively. Finally, analysis show that these schemes are effective, and it can be more applicable in special situation.
出处
《通信学报》
EI
CSCD
北大核心
2014年第2期54-62,共9页
Journal on Communications
基金
长江学者和创新团队发展计划基金资助项目(IRT1078)
国家自然基金委员会-广东联合基金重点基金资助项目(U1135002)
国家科技部重大专项基金资助项目(2011ZX03005-002)
国家自然科学基金资助项目(61170280
61272398
61262073
61363068)
中国博士后基金资助项目(2013M530705)
贵州省自然科学基金资助项目(20132112)
贵州大学博士基金资助项目(2012024)~~
关键词
UC框架
安全多方计算
公平性
双线性对
BDH假设
UC framework
secure multiparty computation
fairness
bilinear pairing
bilinear Diffie-Hellman assumption
