期刊文献+

无条件安全不经意二次多项式估值协议

Unconditionally Secure Oblivious Quadratic Polynomial Evaluation Protocol
下载PDF
导出
摘要 作为一种安全双方计算协议,不经意多项式估值可以作为其它很多安全协议实现的基础。针对二次多项式,本文通过引入随机函数的方式,提出了一种无条件安全的不经意估值协议,方案不依赖任何密码学意义上的困难问题假设,协议实现简单,交互次数少,并对接收方和发送方的安全性进行了证明。另外,本文方案不需要任何形式的第三方参与,具有一定的实用性。 As a secure two party computation protocol, oblivious polynomial evaluation can be usea as fundamental protocol by many other secure protocols. By using a random function, this paper presents an unconditionally secure oblivious quadratic polynomial evaluation protocol which does not depend on any intractable problem assumption. The protocol is of simple implementation and lower computation overhead. The security of both the receiver and the sender in the protocol has been proved. In addition, the protocol does not involve any third party and is applicable in practice.
出处 《安徽电子信息职业技术学院学报》 2013年第5期22-25,共4页 Journal of Anhui Vocational College of Electronics & Information Technology
关键词 不经意多项式估值 无条件安全 多方安全计算 OPE unconditional security multi-party computation
  • 相关文献

参考文献18

  • 1W. Du and Z. Zhan, A practical approach to solve Secure Multi-party Computation problems [C], in Proceedings of Workshop on New Security Paradigms, ACM Press, 2002: pp. 127-135.
  • 2M. Naor and B. Pinkas, Oblivious Transfer and Polynomial Evaluation [C], in Proc. of the 31st STOC, Atlanta, GA, 1999: 245-254.
  • 3A. C. Yao, How to generate and exchange secrets [J], Foundations of Computer Science, IEEE, 1986: 162-167.
  • 4O. Gold.reich, S. Mieali and A. Wigderson, How to play any mental game or completeness theorem for protocols with honest majority[C], Theory of Computing, ACM, 1987: 218-229.
  • 5M. Naor and B. Pinkas, Oblivious transfer and polynomial evaluation[C], Theory of Computing, ACM, 1999: 245-254.
  • 6M. Bellare, and S. Mieali, Non-interactive oblivious transfer and applications [J], Lecture Notes in Computer Science, 1990, Vol.435, 547-557.
  • 7O. Goldreieh, S. Micali and A. Wigderson, How to play any mental game or completeness theorem for protocols with honest majority[C], Theory of Computing, ACM,1987: 218-229.
  • 8J. Kilian, Founding cryptography on oblivious transfer[C], Theory of Computing, ACM, 1988: 20-31.
  • 9D. Bleiehenbacher and P. Nguyen, Noisy polynomial interpolation and noisy Chinese remaindering[C], EUROCRYPT 2000, Springer-verlag, 2000: 53-69.
  • 10D. Bleichenbacher and P. Nguyen, Noisy polynomial interpolation and noisy chinese remaindering[C], EUROCRYPT 2000, Springer-verlag, 2000:53-69.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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