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

中国科学通报：英文版

A time sequence protocol to achieve the effect of fair exchange without trusted third party

He, Du, Jian JIAN, Wang, Ya-nan, Liu

Published Jan 1, 2014• 1 citation
OpenAlex

Abstract

一个公平交换协议允许二个聚会以一个公平方法交换项目，以便也两个聚会获得其它条款或两个都不聚会。在这份报纸，我们为没有信任第三方(TTP ) ，交换参加者保证建议一个时间顺序协议。然后，每个参加者能代表它的对手签署代理签名。由于代理签名限制，计划完成数字签名的公平交换的需要的效果。我们的计划基于一时间没有 TTP 的使用，顺序而非计算，和罐头被认识到，因此不同于存在公平交换计划。与并发的签名相比，建议计划不需要释放一个重点当他们相当交换信息时，弄醒签名。起始的聚会的唯一的优点是它有权利决定交换保证是否在一指明的时间前是有效的。因为代理签名的性质，然而，起始的聚会最终不从这个优点导出利益。在指明的时间以后，没有另外的优点有益于起始的聚会。

Related papers

A time sequence protocol to achieve the effect of fair exchange without trusted third party

He Du, Jian Wang, Yanan Liu

Chinese Science Bulletin•Jan 14, 2014•5 citations

신뢰성 분산에 기반한 강건한 Certified E - mail 프로토콜

서철, 양종필, 이경현

Certified E-mail 프로토콜은 공정한 교환(fair exchange)을 보장하기 위하여 신뢰된 제 3자 (Trusted Third Party, TTP)를 사용한다. 그러므로, Certified E-mail을 사용하는 유저들은 원격지의 TTP를 완전히 신뢰(fully-trust)해야 한다. 만약 TTP가 훼손되거나 유저와 공모하여 악위적인 행동을 한다면 Certified E-mail 프로토콜의 공정성(fairness)은 붕괴된다. 본 논문에서는 Threshold secret sharing을 사용하여 TTP의 신뢰성을 분산시킨 강건한 Certified E-mail 프로토콜을 제안한다. 분산된 TTP(Distributed TTP, DTTP)를 사용하므로써 유저와 공모하는 악위적인(malicious) TTP에 대한 공격을 막을 수 있으며 어느 한 DTTP가 훼손되더라도 전체 프로토콜에 영향을 주지 못한다.

•Apr 1, 2003•0 citations

Efficient and practical fair exchange protocols with off-line TTP

Feng Bao, Robert Huijie Deng, Wenbo Mao

We present protocols for fair exchange of electronic data (digital signatures, payment and confidential data) between two parties A and B. Novel properties of the proposed protocols include: 1) offline trusted third party (TTP), i.e., TTP does not take part in the exchange unless one of the parties behaves improperly; 2) only three message exchanges are required in the normal situation; 3) true fair exchange, i.e., either A and B obtain each other's data or no party receives anything useful; no loss can be incurred to a party no matter how maliciously the other party behaves during the exchange. This last property is in contrast to previously proposed protocols with offline TTP ([1] and [21]), where a misbehaving party may get another party's data while refusing to send his document to the other party, and the TTP can provide affidavits attesting to what happened during the exchange. To our knowledge, the protocols presented here are the first exchange protocols which use offline TTP and at the same time guarantee true fair exchange of digital messages. We introduce a novel cryptographic primitive, called the Certificate of Encrypted Message Being a Signature (CEMBS), as the basic building block of the fair exchange protocols. It is used to prove that an encrypted message is a certain party's signature on a public file, without revealing the signature. We also give two examples to show in detail how the certificate can be constructed.

IEEE Symposium on Security and Privacy (S&P)•Nov 27, 2002•295 citations

A multiparty fair-exchange protocol

Zhengquan Li

Based on the secret sharing technique,this paper proposes a multi-party fair exchange protocol.The protocol uses an online trusted third party(TTP) in order to help the participants to realize fair exchange.The advantage of a protocol implemented with an online TTP is that the TTP is semi-trusted.Fairness of the proposed protocol is proved in this paper.

Journal of Yangzhou University•Jan 1, 2008•0 citations

An Identity-Based Scheme of Fair Exchange of Digital Signatures

Yu Yu, Yong, Yang Yang +2 more

数字签名的公平交换是为签署数字合同，电子支付和另外的电子商务行动的一个重要工具。数字签名的公平交换的一个基于标志的计划在这篇论文被建议。协议依靠信任第三方，但是是“乐观”的因为第三方仅仅在一个播放器试图作弊或简单地垮掉的情况中被需要，。建议计划有短签名，低计算和确认费用的性质。它能相当并且高效地认识到数字签名的交换。我们的计划的特色是它是基于身份的，它不需要证书并且有一个简单关键管理。到我们的最好的知识，这是数字签名的公平交换的第一个基于身份的计划。

Wuhan University Journal of Natural Sciences•Jan 1, 2006•0 citations

Optimally Efficient Multi-party Fair Exchange and Fair Secure Multi-party Computation

Handan Kılınç Alper, Alptekın Küpçü

Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. In particular, we consider MFE scenarios where at the end of the protocol, either every participant receives every other participant’s item, or no participant receives anything. We analyze the case where a trusted third party (TTP) is optimistically available, although we emphasize that the trust put on the TTP is only regarding the fairness , and our protocols preserve the privacy of the exchanged items against the TTP. In the fair SMPC case, we prove that a malicious TTP can only harm fairness, but not security . We construct an asymptotically optimal multi-party fair exchange protocol that requires a constant number of rounds (in comparison to linear) and O(n 2 ) messages (in comparison to cubic), where n is the number of participating parties. In our protocol, we enable the parties to efficiently exchange any item that can be efficiently put into a verifiable encryption (e.g., signatures on a contract). We show how to apply this protocol on top of any SMPC protocol to achieve fairness with very little overhead (independent of the circuit size). We then generalize our protocol to efficiently handle any exchange topology (participants exchange items with arbitrary other participants). Our protocol guarantees fairness in its strongest sense: even if all n-1 other participants are malicious and colluding with each other, the fairness is still guaranteed.

ACM Transactions on Privacy and Security•Nov 23, 2021•13 citations
一个公平交换协议允许二个聚会以一个公平方法交换项目，以便也两个聚会获得其它条款或两个都不聚会。在这份报纸，我们为没有信任第三方(TTP ) ，交换参加者保证建议一个时间顺序协议。然后，每个参加者能代表它的对手签署代理签名。由于代理签名限制，计划完成数字签名的公平交换的需要的效果。我们的计划基于一时间没有 TTP 的使用，顺序而非计算，和罐头被认识到，因此不同于存在公平交换计划。与并发的签名相比，建议计划不需要释放一个重点当他们相当交换信息时，弄醒签名。起始的聚会的唯一的优点是它有权利决定交换保证是否在一指明的时间前是有效的。因为代理签名的性质，然而，起始的聚会最终不从这个优点导出利益。在指明的时间以后，没有另外的优点有益于起始的聚会。
Certified E-mail 프로토콜은 공정한 교환(fair exchange)을 보장하기 위하여 신뢰된 제 3자 (Trusted Third Party, TTP)를 사용한다. 그러므로, Certified E-mail을 사용하는 유저들은 원격지의 TTP를 완전히 신뢰(fully-trust)해야 한다. 만약 TTP가 훼손되거나 유저와 공모하여 악위적인 행동을 한다면 Certified E-mail 프로토콜의 공정성(fairness)은 붕괴된다. 본 논문에서는 Threshold secret sharing을 사용하여 TTP의 신뢰성을 분산시킨 강건한 Certified E-mail 프로토콜을 제안한다. 분산된 TTP(Distributed TTP, DTTP)를 사용하므로써 유저와 공모하는 악위적인(malicious) TTP에 대한 공격을 막을 수 있으며 어느 한 DTTP가 훼손되더라도 전체 프로토콜에 영향을 주지 못한다.
We present protocols for fair exchange of electronic data (digital signatures, payment and confidential data) between two parties A and B. Novel properties of the proposed protocols include: 1) offline trusted third party (TTP), i.e., TTP does not take part in the exchange unless one of the parties behaves improperly; 2) only three message exchanges are required in the normal situation; 3) true fair exchange, i.e., either A and B obtain each other's data or no party receives anything useful; no loss can be incurred to a party no matter how maliciously the other party behaves during the exchange. This last property is in contrast to previously proposed protocols with offline TTP ([1] and [21]), where a misbehaving party may get another party's data while refusing to send his document to the other party, and the TTP can provide affidavits attesting to what happened during the exchange. To our knowledge, the protocols presented here are the first exchange protocols which use offline TTP and at the same time guarantee true fair exchange of digital messages. We introduce a novel cryptographic primitive, called the Certificate of Encrypted Message Being a Signature (CEMBS), as the basic building block of the fair exchange protocols. It is used to prove that an encrypted message is a certain party's signature on a public file, without revealing the signature. We also give two examples to show in detail how the certificate can be constructed.
数字签名的公平交换是为签署数字合同，电子支付和另外的电子商务行动的一个重要工具。数字签名的公平交换的一个基于标志的计划在这篇论文被建议。协议依靠信任第三方，但是是“乐观”的因为第三方仅仅在一个播放器试图作弊或简单地垮掉的情况中被需要，。建议计划有短签名，低计算和确认费用的性质。它能相当并且高效地认识到数字签名的交换。我们的计划的特色是它是基于身份的，它不需要证书并且有一个简单关键管理。到我们的最好的知识，这是数字签名的公平交换的第一个基于身份的计划。
Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. In particular, we consider MFE scenarios where at the end of the protocol, either every participant receives every other participant’s item, or no participant receives anything. We analyze the case where a trusted third party (TTP) is optimistically available, although we emphasize that the trust put on the TTP is only regarding the fairness , and our protocols preserve the privacy of the exchanged items against the TTP. In the fair SMPC case, we prove that a malicious TTP can only harm fairness, but not security . We construct an asymptotically optimal multi-party fair exchange protocol that requires a constant number of rounds (in comparison to linear) and O(n 2 ) messages (in comparison to cubic), where n is the number of participating parties. In our protocol, we enable the parties to efficiently exchange any item that can be efficiently put into a verifiable encryption (e.g., signatures on a contract). We show how to apply this protocol on top of any SMPC protocol to achieve fairness with very little overhead (independent of the circuit size). We then generalize our protocol to efficiently handle any exchange topology (participants exchange items with arbitrary other participants). Our protocol guarantees fairness in its strongest sense: even if all n-1 other participants are malicious and colluding with each other, the fairness is still guaranteed.