期刊文献+

基于插值多项式的可验证随机数 被引量:1

Verifiable Random Number Based on Interpolating Polynomial
下载PDF
导出
摘要 信息安全协议中使用的随机数通常由协议参与者任意选取,其他参与方无法验证,从而影响协议的公平性。针对上述问题,提出一个基于插值多项式的可验证随机数生成方案。该方案无需可信任的第三方,计算中心只承担计算职责,不承担可信任第三方的验证职责,并且方案中任意参与者都能验证随机数的随机性,保证了协议的公平性。 Random number is always chosen by the participant in information security protocol,which can not be verified by other participants,so that the fairness of protocol is affected.Aiming at the problem,this paper proposes a scheme for generating verifiable random number.It does not need Trusted Third Party(TTP).The task of calculation center is only to perform calculation,not to play a role as TTP.The scheme allows every participant to verify the Randomness of the random number,which ensures the fairness of the protocol.
出处 《计算机工程》 CAS CSCD 北大核心 2010年第10期179-180,183,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60672049) 广西自然科学基金资助项目(桂科青099107) 桂林电子科技大学科研基金资助项目(UF08014Y)
关键词 随机数 可验证随机数 插值多项式 random number verifiable random number interpolating polynomial
  • 相关文献

参考文献13

  • 1刘忆宁,王邦菊.基于双线性困难问题的电子彩票方案[J].吉林大学学报(工学版),2008,38(5):1155-1159. 被引量:5
  • 2Micali S,Rabin M O,Vadhan S P.Verifiable Random Functions[C]// Proc.of the 40th Symposium on Foundations of Computer Science.[S.l.]:IEEE Computer Society Press,1999.
  • 3Goldreich O,Goldwasser S,Micali S.How to Construct Random Functions[J].Journal of the Association for Computing Machinery,1986,33(4):792-807.
  • 4Lysyanskaya A.Unique Signatures and Verifiable Random Functions from the DH-DDH Separation[C]//Proc.of CRYPTO'02.Berlin,Germany:Springer-Verlag,2002:597-612.
  • 5Dodis Y.Efficient Construction of Distributed Verifiable Random Functions[C]//Proc.Of PKC'03.Berlin,Germany:Springer-Verlag,2003:1-17.
  • 6Naor M,Pinkas B,Reingold O.Distributed Pseudo-random Functions and KDC[C]//Proc.Of EUROCRYPT'99.Berlin,Germany:Springer-Verlag,1999:327-346.
  • 7Dodis Y,Yampolskiy A.A Verifiable Random Function with Short Proofs and Keys[C]//Proc.Of PKC'05.Berlin,Germany:Springer-Verlag,2005:416-431.
  • 8Joux A,Nguyen K.Separating Decision Diffie-Hellman from Computational Diffie-Hellman in Cryptographic Groups[J].Journal of Cryptology,2003,16(4):239-247.
  • 9刘忆宁,陈素霞,吴亮.VRF函数的安全性证明[J].计算机工程与设计,2008,29(16):4172-4173. 被引量:1
  • 10Chang Chin-Chen,Lin Chu-Hsing,Chen Chien-Yuan.A Conference Key Distribution Scheme Using Interpolating Polynomials[C]//Proc.Of International Conference on Multimedia and Ubiquitous Engineering.Seoul,Korean:[s.N.],2007.

二级参考文献27

  • 1冯登国.可证明安全性理论与方法研究[J].软件学报,2005,16(10):1743-1756. 被引量:101
  • 2Rafaeli S, Hutchison D. A survey of key management for secure group communication [ J ]. ACM Computing Surveys, 2003, 35 (3) : 309 - 329.
  • 3Sun Y L, Ray Liu K J. Analysis and protection of dynamic membership information for group key distribution schemes [J]. IEEE Transactions on Information Forensics and Security, 2007, 2(2) : 213 -226.
  • 4Lu E H, W Y Hwang, Ham L J, et al. A conference key distribution system based on the Lagrange/nterpohting polynomial[ C]// Proceedings IEEE INFOCOM' 88, 7th Annual Joint Conference of IEEE Computer and Communication Society. 1988 : 1092 - 1094.
  • 5Chang Chin-Chen, Lin Chu-Hsing , Chen Chien-Yuan. A conference key distribution scheme using interpolating polynomials[C]// 2007 International Conference on Multimedia and Ubiquitous Engineering(MUE07).
  • 6Anzai J, Matsuzaki N, Matsumoto T. A quick group key distribution scheme with entity revocation[ C]// Advances in Cryptology-ASIACRYPT '99, Lecture Notes in Computer Science 1716, 1999 : 333 - 347.
  • 7Kumio H, Safavi-Naini R, Wang Huaxiong. A group key distribution scheme with eecentralized user Join[ C]//Security in Communication Networks: Third International Conference, SCN 2002, Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2003,2576: 146 - 163.
  • 8Damien Magoni, Pascal Lorenz. Application layer addressing, routing and naming framework for ovedays [ C]// IEEE Globecom 2005 : 932 - 937.
  • 9Micali Silvio, Rivest Ronald L. Micropayments revisited[C]//In CT-RSA'2002, LNCS 2271. Berlin: Springer, 2002.
  • 10Zhou Jian-ying, Tan Chun-fu. Playing lottery on the internet[C]// In ICICS'2001, LNCS 2229. Berlin: Springer, 2001.

共引文献5

同被引文献3

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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