期刊文献+

基于双线性映射的公共可验证外包计算方案 被引量:1

Bilinear Map-based Public Verifiable Outsourced Computation Scheme
下载PDF
导出
摘要 已有可验证计算方案存在以下不足:一是只有计算委托方才可以对计算结果进行验证;二是即使计算委托方可以授权其他用户进行验证,但也需要将自身验证密钥交给授权用户.针对上述不足,提出一个支持公共验证的外包计算模型,给出其算法形式化定义及安全模型,并利用双线性映射提出了一个包含三方实体的公共可验证外包计算方案,给出了方案算法的具体描述、实体间的通信协议以及效率分析,方案验证无需私钥参与,实现了公共可验证性.在可证安全模型下证明该方案具有不可伪造性,其安全性可归约于lSBDH问题的困难性. There are two shortcomings for the existing verifiable computation schemes. One is that only the owner who outsourced the computation can verify the result, and the other is when the owner authorizes other users to verify the result, he has to send his secret key to all the authorized users. In order to overcome the problems, an outsourced computation model was proposed which supports the public verification. The description and security model were formalized and a publicly verifiable outsourced computation scheme, which is based on the bilinear map and contains three entities, was also presented. The algorithm implementation and the communication protocol were also described in details. The verification phase in the scheme does not need the owner' s secret key so it can be publicly verifiable. The scheme can be proved to satisfy unforgeability in the security model, and the security can be reduced to the hardness of the l-SBDH problem.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2016年第5期619-623,共5页 Journal of Northeastern University(Natural Science)
基金 国家自然科学基金资助项目(61300196) 中央高校基本科研业务费专项资金(N130317003) 国家科学技术重大专项资助项目(2013ZX03002006) 辽宁省科技计划项目(2013217004) 沈阳自然科学基金资助项目(F14-231-1-08)
关键词 双线性映射 公共可验证 外包计算 不可伪造性 可验证计算 bilinear map public verifiable outsourced computation unforgeability verifiable computation
  • 相关文献

参考文献15

  • 1Green M, Hohenberger S, Waters B. Outsourcing the decryption of ABE ciphertexts [ C ]//Procceding of the 20th USENIX Cnfercnce on Security. San Francisco,2011:34 - 34.
  • 2Chung K M, Kalai Y, Vadhan S. Improved delegation of computation using fully homomorphic encryption [ M ]. Berlin & Springer,2010:483 - 501.
  • 3Anderson D P, Cobb J, Korpela E, et al. SETI@ Home: an experiment in public-resource computing [ J ]. Communications of the ACM, 2002,45 ( 11 ) :56 - 61.
  • 4Gennaro R, Gentry C, Pamo B. Non-interactive verifiable computing: outsourcing computation to untrusted workers [ M ]. Berlin: Springer,2010:465 - 482.
  • 5Yao A. Protocols for secure computations [ C ]//Procceding of the 23rd Annual Symposium on Foundations of Computer Science. New York, 1982 : 160 - 164.
  • 6Gentry C. A fully homomorphic encryption scheme [ D ]. Stanford: Stanford University ,2009.
  • 7Barbosa M,Farshim P. Delegatable homomorphic eneryption with applications to secure outsourcing of computation[ M].Berlin: Springer, 2012 : 296 - 312.
  • 8Goldwasser S, Kalai Y T, Rothblum G N. Delegating computation :interactive proofs for muggles [ C ]//Procceding of the 40th Annual ACM Symposium on Theory of Computing. Victoria,2008 : 113 - 122.
  • 9Bitansky N, Canetti R, Chiesa A, et al. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again [ C]//Procceding of the 3rd Innovations in Theoretical Computer Science Conference. Cambridge, 2012 : 326 - 349.
  • 10Parno B, Raykova M, Vaikuntanathan V. How to delegate and verify in public:verifiable computation from attribute-based encryption [ M ]. Berlin: Springer,2012:422 - 439.

二级参考文献9

  • 1Mesenne Research Inc..The Great Internet Mersenne Prime Search,Project[EB/OL].[2011-12-20].http://www.mersenne.org/.
  • 2Gennaro R,Gentry C,Parno B.Non-interactive VerifiableComputing:Outsourcing Computation to Untrusted Workers[C]//Proc.of the 30th Annual Cryptology Conference.Santa Barbara,USA:[s.n.],2010.
  • 3Chung Kai-Min,Kalai Y T,Vadhan S P.Improved Delegation ofComputation Using Fully Homomorphic Encryption[C]//Proc.ofthe 30th Annual Cryptology Conference.Santa Barbara,USA:[s.n.],2010.
  • 4Helios A B.Web-based Open-audit Voting[C]//Proc.of the 17thUSENIX Security Symposium.[S.l.]:USENIX Association,2008:335-348.
  • 5Jin Fangyuan,Zhu Yanqin,Luo Xizhao.Verifiable FullyHomomorphic Encryption Scheme[C]//Proc.of the InternationalConference on Consumer Electronics,Communications andNetworks.Three Gorges,China:[s.n.],2012.
  • 6Damgard I,Faust S,Hazay C.Secure Two-party Computation withLow Communication[EB/OL].[2011-12-20].http://eprint.iacr.org/.
  • 7van Dijk M,Gentry C,Halevi S,et al.Fully HomomorphicEncryption over the Integers[C]//Proc.of EUROCRYPT’10.[S.l.]:Springer,2010.
  • 8Goldwasser S,Kalai Y T,Rothblum G N.Delegating Computation:Interactive Proofs for Muggles[C]//Proc.of the 40th Annual ACMSymposium on Theory of Computing.New York,USA:ACMPress,2008:113-122.
  • 9张彩云,罗永龙,石磊.关于安全判定点和区间包含关系的解决方法[J].计算机工程与应用,2010,46(17):107-109. 被引量:5

共引文献5

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部