期刊文献+

Transmutation Scheme of Coin Flipping Protocol and Utilization

Transmutation Scheme of Coin Flipping Protocol and Utilization
下载PDF
导出
摘要 Coin flipping by telephone protocol(CFP) is utilized in a system to exchange a binary sequence at random between two person apart far from each other. However, CFP cannot he used in a system with many users like in a group environment system. A transmutation of CFP named T-CFP is proposed in this paper. The precondition of T-CFP is the system's user trusts the system center and center's cheating is meaningless at the same time. The significant difference between CFP and T-CFP is that CFP supports only two users while T-CFP can support many users to exchange special information. The security and efficiency of T-CFP are discussed with a detailed example on T-CFP utilization is demonstrated in this paper. Coin flipping by telephone protocol(CFP) is utilized in a system to exchange a binary sequence at random between two person apart far from each other. However, CFP cannot he used in a system with many users like in a group environment system. A transmutation of CFP named T-CFP is proposed in this paper. The precondition of T-CFP is the system's user trusts the system center and center's cheating is meaningless at the same time. The significant difference between CFP and T-CFP is that CFP supports only two users while T-CFP can support many users to exchange special information. The security and efficiency of T-CFP are discussed with a detailed example on T-CFP utilization is demonstrated in this paper.
出处 《Wuhan University Journal of Natural Sciences》 CAS 2006年第6期1911-1914,共4页 武汉大学学报(自然科学英文版)
基金 Supported by the National Natural Science Foun-dation of China(60473072)
关键词 coin flipping protocol transmutation-coin flipping protocol one way function Blum coin flipping protocol transmutation-coin flipping protocol one way function Blum
  • 相关文献

参考文献10

  • 1Impaglizaao R,Levin L S,Luby M.Pseudo-Random Gener- ationfrom One-Way Functions[].Proceedings oftheth Annual ACM Symposium on Theory of Computing.1989
  • 2Alan TS,David A M.Key Establishment in Large Dynamic Groups Using One-Way Function Trees[].IEEE Transac- tions on Software Engineering.2003
  • 3Rivest R,Shamir A.PayWord and MicroMint : Two Si mple Micropayment Schemes[].CryptoBytes.1996
  • 4Mao Wenbo.Modern Cryptography:Theory and Practice[]..2004
  • 5Blum M.Coin flipping by telephone:a protocol for solving impossi-ble problems[].Proc ofth IEEE Computers Conference.1983
  • 6DeMillo,R.,Merritt,M.Protocols for data security[].Computer.1983
  • 7Moore,J H.Protocol Failures in Cryptosysms[].Proceedings of Tricomm.1988
  • 8Yumin,Xie,Feng,Shi,Kamran,M.Implement MPE Scheme with Strict Prime Number[].WSEAS Transaction on Computers.2006
  • 9W. Differ,and M.E. Hellman.New Directions in Crypotgraphy[].IEEE Transactions on Information Theory.1976
  • 10Lane,A H,Jorg,R.Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-way Function in Complexity Theory[].Journal of Computer and system Sciences.1999

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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