检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001 [2]中国科学院计算技术研究所,北京100190
出 处:《计算机研究与发展》2011年第5期862-868,共7页Journal of Computer Research and Development
基 金:国家"九七三"重点基础研究发展计划基金项目(2007CB311101);国家"八六三"高技术研究发展计划基金项目(2009AA01Z431;2009AA01Z437);国家自然科学基金项目(60703021)
摘 要:基于Jarecki和Shmatikov的带承诺加密电路技术和Pedersen的可验证门限秘密共享方案,提出了一种新的适用于恶意环境的移动代码保护协议.新协议使用一组服务器来代理部分零知识证明过程并共享密钥.当诚实的服务器多于2?3时,新协议:1)能同时保护输入输出的安全,较现有协议有更高安全性;2)适用于无交互的移动代码环境;3)使得发起者无需和执行者交互就能验证移动代码的正确性,从而避免恶意发起者使用恶意代码来破坏执行者的安全性;4)使得发起者和执行者能公平地得到正确的输出.The lack of protections hinders the application of mobile code,and no sound solutions have been proposed for it so far.Garbled circuit is the only pure software protecting technique that is universal and has provable security,by now.The existing CCKM,ACCK,Tate-Xu and Zhong-Yang protocols based on garbled circuit cannot prevent the attacks from malicious participants and cannot fit to mobile code non-interactively.Based on the committed garbled circuit technology of Jarecki et al.and Pedersen's verifiable threshold secret sharing scheme,this paper presents a new secure mobile code protocol against the malicious participants.In the new protocol,a group of third-party servers are employed to "challenge" the provers,and to share secrets in every secret sharing scheme.When more than two-thirds of the servers are honest,the new protocol:1) protects the inputs and outputs of the mobile codes simultaneously and offers more protection than existing protocols;2) suits for mobile code application non-interactive;3) makes the executors be able to verify the garbled circuit non-interactively and thus protect themselves from malicious codes;and 4) guarantees that the generators and executors can get correct outputs full fairly.
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.26