基于卷积的安全双方计算问题  

A Secure Two-party Computation Problem Based on the Convolution

作　　者：唐瑜穗 许道云[2] 

机构地区：[1]贵州大学理学院,贵州贵阳550025 [2]贵州大学计算机科学与技术学院.贵州贵阳550025

出　　处：《贵州大学学报（自然科学版）》2016年第1期52-57,共6页Journal of Guizhou University:Natural Sciences

基　　金：国家自然科学基金项目资助(61262006)

摘　　要：经典的安全双方问题一直专注于零信息泄露的模式,虽然这是理想的安全双方模型,但在实际的安全双方计算中需要付出昂贵的代价且效率不高。本文在传统安全双方的问题上构建卷积安全双方问题,并基于此问题建立不公开信息和需要部分信息公开的安全双方计算模型,提供一种兼顾安全和效率的方法。The classic security two-party computation problem has focused on the mode of zero information leak- age, Although it is the ideal model for the security computation, it is costly and inefficient in the actual calcula- tions. The convolution security two-party computation problem was proposed from the traditional model. A secure of no-information-disclosed calculation model and a secure issue of some information disclosure were established based on the convolution two-party computation problem, which provided a method for balance between safety and efficiency in the security two-party computation problem.

关 键 词：安全双方问题 卷积安全双方问题 信息公开 

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