An Optimistic Protocol for Distributed Fair Exchange
Yang Zhao, Zhiguang Qin
Abstract
Yang Zhao, Zhiguang Qin
Abstract
This paper presents an optimistic protocol based on the scheme of public verifiable secret share for distributed fair exchange. A distributed third party is designed to guarantee the fairness of exchange. Comparing to traditional trusted third party, this distributed third party is not fixed but dynamically selected by the players of exchange. This solution can effectively remove the risk of single point of failure and defend compromising attacks. The results of protocol analysis show that the protocol guarantees strong fairness and effectiveness of up to one-half malicious participants in distributed third party.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents an optimistic protocol based on the scheme of public verifiable secret share for distributed fair exchange. A distributed third party is designed to guarantee the fairness of exchange. Comparing to traditional trusted third party, this distributed third party is not fixed but dynamically selected by the players of exchange. This solution can effectively remove the risk of single point of failure and defend compromising attacks. The results of protocol analysis show that the protocol guarantees strong fairness and effectiveness of up to one-half malicious participants in distributed third party.
Key concepts: Protocol (science), Computer science, Trusted third party, Verifiable secret sharing, Computer security, Third party, Scheme (mathematics), Single point of failure