Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Wuhan University Journal of Natural Sciences

Transmutation Scheme of Coin Flipping Protocol and Utilization

Xie XIE, Yumin, Ming Ming, Yang Yang, Shi, Feng, Muhammad, Kamran

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

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

Related papers

A search for quantum coin-flipping protocols using optimization techniques

Ashwin Nayak, Jamie Sikora, Levent Tunçel

arXiv:1403.0505•Mathematical Programming•May 14, 2015•16 citations

On the influence of single participant in coin flipping schemes

Benny Chor, Mihály Geréb-Graus

Springer eBooks•Jan 1, 1990•0 citations

A new protocol and lower bounds for quantum coin flipping

Andris Ambainis

Journal of Computer and System Sciences•Oct 17, 2003•64 citations

An Unbiased Global Coin Flipping Protocol on Synchronous Distributed Systems

Kunikazu Yoda, 寿男 岡部, 正憲 金澤

数理解析研究所講究録•May 1, 1996•0 citations

Quantum Cryptography in Spin Networks

邓洪亮, 方细明

在这篇论文,我们基于旋转网络建议长途的量密码学的一个新计划, qubits 在量点的电子旋转存储了。由有条件的法拉第,旋转,单个光子极化测量,和量状态转,为在二个长途的聚会之间的量密码学的最大纠缠贝尔状态被创造。同时,在任意的距离上的有效的量状态转移被联合力量的一种合适的选择在旋转链获得,用旋转记忆,技术改善了。我们也对能也在旋转网络被实现并且发现克隆的这个旋转网络与一致,最佳的忠实为基于纠纷的密码学由一个偷听者完成了的基于克隆的攻击分析计划的安全。

Chinese Physics Letters•Jan 1, 2007•0 citations

Transmutation scheme of coin flipping protocol and utilization

Xie Yumin, Ming Yang, Shi Feng +1 more

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.

Wuhan University Journal of Natural Sciences•Nov 1, 2006•0 citations
硬币由电话协议(CFP ) 扭动在一个系统被利用远离对方分开在在二个人之间的随机交换一个二进制序列。然而, CFP 不能与在一个组环境系统相似的许多用户一起在一个系统被使用。CFP namedT-CFP 的一个变化在这篇论文被建议。T-CFP 的前提是“ s 用户信任系统中心和中心”的系统 s 作弊同时是无意义的。CFPand T-CFP 之间的重要差别是 CFP 支持仅仅二个用户当 T-CFP 能支持许多用户交换特殊信息时。T-CFP 的安全和效率与详细例子 onT-CFP 利用被讨论在这篇论文被表明。
在这篇论文,我们基于旋转网络建议长途的量密码学的一个新计划, qubits 在量点的电子旋转存储了。由有条件的法拉第,旋转,单个光子极化测量,和量状态转,为在二个长途的聚会之间的量密码学的最大纠缠贝尔状态被创造。同时,在任意的距离上的有效的量状态转移被联合力量的一种合适的选择在旋转链获得,用旋转记忆,技术改善了。我们也对能也在旋转网络被实现并且发现克隆的这个旋转网络与一致,最佳的忠实为基于纠纷的密码学由一个偷听者完成了的基于克隆的攻击分析计划的安全。
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.