期刊文献+

一种新的无条件安全不经意多项式估值协议

A new unconditionally-secure oblivious polynomial evaluation protocol
下载PDF
导出
摘要 不经意多项式估值协议是一种双方计算协议,已有的无条件安全不经意多项式估值协议只是进行了安全分析,而不是严格的证明。本文通过巧妙设计提出两种新的高效不经意多项式估值协议,分别适用于多项式为奇度数和偶度数情况。协议没有依赖任何密码学意义上的困难问题假设,是一种无条件安全的不经意多项式估值协议,协议设计简洁,计算简单,效率高,并对方案安全性进行了证明。同时,协议也不需要任何形式的第三方参与,因而更具有实用性。 Oblivious polynomial evaluation is a protocol involving two parties.The problem of existing unconditionally-secure oblivious polynomial evaluation protocol is that they do not clearly prove their security.In this paper,two efficient oblivious polynomial evaluation protocols are proposed which can be applied odd degree and even degree polynomial respectively.The protocol does not rely on any cryptographic assumptions and is an unconditionally-secure oblivious polynomial evaluation protocol with simple and efficient.More importantly,the security of our protocol can be showed clearly.Further,our protocol does not include any third party and is more practical.
出处 《电子设计工程》 2013年第14期124-126,共3页 Electronic Design Engineering
基金 国家自然科学基金(61101215) 中央高校基本科研业务费(CHD2011JC084) 航空科学基金(20100818020) 陕西省自然科学基础研究计划(2011JQ8014)
关键词 多方安全计算 不经意传输 不经意多项式估值 安全协议 multi-party computation oblivious transfer oblivious polynomial evaluation secure protocol
  • 相关文献

参考文献10

  • 1Gilboa N. Two party RSA key generation [C]//in CRYPTO 1999, Springer-verlag, 1999:116-129.
  • 2CHANG Yan-cheng,LU Chi-jen. Oblivious polynomial evaluation and oblivious neural learning [C]//ASIACRYPT 2001, Springer-verlag, 2001:369-384.
  • 3Hazay C, Lindell Y. Efficient oblivious polynomial evaluation with simulation-based security. International association for Cryptologic research, e-print IACR archive [EB/OL] http:// eprint.iacr.org/2009/459.pdf.
  • 4Huafei Zhu,Feng Bao. Augmented Oblivious Polynomial Evaluation Protocol and Its Applications[J]. Lecture Notes in Computer Science, Vol, 3679:222-230.
  • 5Pailher P. Public-key cryptosystems based on composite degree residuosity classes [C]//EUROCRYPT1991,1991: 223-238.
  • 6Hanaoka G,Imai H,Quade J M,et aL Information Theoretically Secure Oblivious Polynomial Evaluation: Model, Bounds, and Constructions [J]. Information Security and Privacy. Lecture Notes in Computer Science, 2004:62-73.
  • 7Tonicelli R,Anderson C A,Nascimento,R Dowsley,et al. Information-Theoretically Secure Obhvious Polynomial Evaluation in the Commodity-Based Model. International association for Cryptologic research, e-print IACR archive [EB/OL] http://eprint.iacr.org/2009/270.pdf.
  • 8Otsuka A,Nascimento A C A, Imai H. Unconditionally Secure Polynomial Evaluation And Its Application To Electronic Voting[J]. IEIC Technical Report, 104(200) : 157- 164.
  • 9Vanishree H,George K. A Novel Unconditionally Secure Oblivious Polynomial Evaluation Protocol [C]//Proceedings of the 2009 International Workshop on Information Security and Application (IWISA 2009), Finland, Academy Publisher, 2009:450-452.
  • 10WANG Qing-long,XU Li. Cryptanalysis on a Novel Unconditionally Secure Oblivious Polynomial Evaluation Protocol. e-print IACR archive [EB/OL] http://eprint.iacr.org/ 2012/478.pdf.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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