期刊文献+

可验证的茫然传输协议

Verifiable oblivious transfer protocol
下载PDF
导出
摘要 茫然传输协议是一种重要而极其有用的密码学基本协议,目前在密码学的众多领域中得到应用,特别在安全多方计算协议的构造中.然而,在目前的茫然传输协议中,由于它的秘密性要求,使得协议本身存在两个缺陷:①接收者无法知道他所得到的信息是不是发送者拥有的信息之一;②发送者无法知道接收者接收到的信息是否属于自己指定的信息中.为了克服这两个缺陷,文章首次提出了可验证的茫然传输协议的概念,并且利用知识证明协议∑-协议构造了可验证的茫然传输协议. Oblivious transfer protocol, which is an important and useful cryptographic protocol, has been widely applied in cryptographic field, especially in construction of secure multi-party computation protocol. However, all of present oblivious transfer protocols have two drawbacks for requirement of their secrets: (1) the receiver does not know whether message received is one of the messages held by the sender; (2) the sender does not know whether message received by the receiver is one of the messages designated by himself. In order to conquer these drawbacks, we firstly introduce the notion of verifiable oblivious transfer protocol, and firstly construct it by using proof protocol of knowledge, i.e. , ∑-protocol, as main tool.
出处 《广州大学学报(自然科学版)》 CAS 2010年第2期20-24,共5页 Journal of Guangzhou University:Natural Science Edition
基金 国家自然科学基金项目(10726012)资助
关键词 密码学 茫然传输协议 安全多方计算 ∑-协议 cryptography oblivious transfer protocol secure multi-party computation ∑-protocol
  • 相关文献

参考文献2

二级参考文献19

  • 1[1]J V D Graaf,R Peralta.A simple and secure way to show the validity of your public key.In:Advances in CRYPTO'87.Berlin:Springer-Verlag,1987.128-134
  • 2[2]A D Santis,G G Crescenzo,G Persiano.Secret sharing and perfect zero-knowledge.In:Advances in Cryptology--CRYPTO'94.Berlin:Springer-Verlag,1994.73-84
  • 3[3]B Schneier.Applied Cryptography second edition:Protocols,Algorithms,and Source Code in C.New York:John Wiley & Son,Inc,1996
  • 4[4]T P Pedersen.Non-interactive and information-theoretic secure verifiable secret sharing.In:Advances in Cryptology--CRYPTO'91.Berlin:Springer-Verlag,1992.129-140
  • 5[5]Camenisch,M Michels.Proving in zero-knowledge that a number is the product of two safe primes.BRICS,Report Series,(1998)RS-98-29,1998
  • 6[6]I Damgard.On Σ-Protocols,CPT,Report,2004
  • 7[7]D Chaum,J H Evertse,J van,et al.An improved protocol for demonstrating possession of discrete logarithms and some generalizations.In:Advances in EUROCRYPT'87.Berlin:Springer-Verlag,1988.127-141
  • 8[8]S Brands.Electronic cash systems based on the representation problem in groups of prime order.In:Advances in Cryptology-CRYPTO'93,Berlin:Springer,1993.1-15
  • 9[9]H Lipmaa.On Diophantine complexity and statistical zero-knowledge arguments.In:Advances in Asiacrypt'03.Berlin:Springer,2003.398-415
  • 10[10]Michael O Rabin,Jeffrey O Shallit.Randomized algorithms in number theory.Communications in Pure and Apllied Mathematics,1986,39:239-256

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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