检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江大学计算机科学与工程学系,浙江杭州310027
出 处:《浙江大学学报(工学版)》2004年第7期848-850,887,共4页Journal of Zhejiang University:Engineering Science
摘 要:通过优化不经意传输(OT)协议,提出一种基于非交互保密函数计算的移动代理保护新方案.根据OT协议的计算开销主要集中在密集的取幂运算,将OT协议由二选一扩展为多选一,把OT调用由多个二选一合并成单个多选一,在此基础上定义新的并发OT协议,使取幂运算次数减少为常数次.将该并发OT协议与加密电路构造组合,得到一个非交互保密函数计算协议.所有主机贡献出加密电路当中代表自己函数的部分,各个子电路进行级联,从而构造出最终的加密电路.与同类方案相比,新方案具有计算开销低、安全性更强、系统更容易实现等特点.A mobile agent protection scheme based on the non-interactive secure function evaluation was presented using an optimized oblivious transfer (OT) protocol. Most overheads of an OT protocol are modular exponentiations, which are computationally intensive tasks. The expansion from l-out-of-2 OT protocol to 1-out-of-N OT protocol and the combination of N l-out-of-2 OT protocol to one l-out-of-N OT protocol defined a new simultaneous 1-out-of-N OT protocol, where the number of modular exponentiation was consequently reduced to a small constant. The simultaneous OT protocol and the encrypted circuit construction were combined to obtain a non-interactive secure function evaluation protocol. Source host proceeded as Alice, and multiple hosts proceeded as Bob. Each host contributed the part of encrypted circuit that represented its function, thus the resulting encrypted circuit became a cascade of sub-circuits. It is proved that the scheme has lower overhead and more security, and is easier to implement than other similar systems.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28