论文部分内容阅读
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 be 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 can not be used in a system with many users like in a group environment system. A transmutation 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.