中文摘要：

硬币由电话协议(CFP ) 扭动在一个系统被利用远离对方分开在在二个人之间的随机交换一个二进制序列。然而， CFP 不能与在一个组环境系统相似的许多用户一起在一个系统被使用。CFP namedT-CFP 的一个变化在这篇论文被建议。T-CFP 的前提是“ s 用户信任系统中心和中心”的系统 s 作弊同时是无意义的。CFPand T-CFP 之间的重要差别是 CFP 支持仅仅二个用户当 T-CFP 能支持许多用户交换特殊信息时。T-CFP 的安全和效率与详细例子 onT-CFP 利用被讨论在这篇论文被表明。

英文摘要：

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.