<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05159956</id>
  <dt>j</dt>
  <an>05159956</an>
  <augroup>
    <au>Xie, Yumin</au>
    <au>Ming, Yang</au>
    <au>Shi, Feng</au>
    <au>Muhammad, Kamran</au>
  </augroup>
  <ti>Transmutation scheme of coin flipping protocol and utilization.</ti>
  <so>Wuhan Univ. J. Nat. Sci. 11, No. 6, 1911-1914 (2006).</so>
  <py>2006</py>
  <pu>Wuhan University Journals Press, Wuhan; Springer, Heidelberg</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>coin flipping protocol</ut>
    <ut>transmutation-coin flipping protocol</ut>
    <ut>one way function</ut>
    <ut>Blum</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/BF02831905</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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.</ab>
    <rv></rv>
  </abgroup>
</item>