EUVIMEDEUVIMED entdecken
Studienprotokoll

A Publicly Verifiable Optimistic Fair Exchange Protocol Using Decentralized CP-ABE

Liang Zhang, Haibin Kan, Feiyang Qiu, Feng Hao

The Computer Journal · 14.04.2024 · 67 (3) · 1017-1029

DOI: 10.1093/comjnl/bxad039 ↗

Kurz gefasst

Studienprotokoll in der Zeitschrift The Computer Journal, online erschienen am 23.04.2023. Verfasst von Liang Zhang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 47 Literaturangaben. Gefördert von: National Key Research and Development Program of China, Foundation of Hainan University, Key Laboratory of Internet Information Retrieval of Hainan Province Research Found.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Fair exchange is a challenging problem for two mutually distrusting players. It is widely known that fair exchange is impossible without a trusted third party (TTP). However, relying on a single TTP can cause a single-point failure. An intuitive idea is to adopt multiple TTPs to distribute trust. This paper constructs a two-party optimistic fair exchange (OFE) protocol using decentralized ciphertext-policy attribute-based encryption (CP-ABE), achieving decentralized TTPs. This is achievable because decentralized CP-ABE ciphertext supports a nested access control policy. A nested access control policy fits perfectly in a fair exchange protocol which contains multiple roles (i.e. players and TTPs). Further, we apply non-interactive zero knowledge proofs to prove the well-formedness of ciphertexts, so as to enforce players to follow the protocol specification honestly. Consequently, we construct an OFE protocol in which each player’s operations are publicly verifiable without revealing secret information. Also, we obtain decentralized TTPs with optimism (i.e. the TTPs are involved only when arbitration is required), autonomy (i.e. the TTPs do not need to interact with each other), statelessness (i.e. the TTPs do not need to store data for the exchange protocol) and verifiability (i.e. the TTPs are publicly verifiable). Compared with previous work, our protocol assumes only a public communication channel and each party’s operations are publicly verifiable. Besides, it achieves a favorable $O(n)$ verification complexity in the normal case, where $n$ is the number of TTPs. Finally, we present a proof-of-concept implementation to demonstrate the feasibility.

Förderung

  • National Key Research and Development Program of China
  • Foundation of Hainan University
  • Key Laboratory of Internet Information Retrieval of Hainan Province Research Found
  • National Natural Science Foundation of China
  • Innovation Action Plan of Shanghai Science and Technology
  • Key Research and Development Program of Guangdong Province
  • Royal Society
  • Engineering and Physical Sciences Research Council

Zitieren

APA

Zhang, L., Kan, H., Qiu, F., & Hao, F. (2024). A Publicly Verifiable Optimistic Fair Exchange Protocol Using Decentralized CP-ABE. The Computer Journal, 67(3), 1017-1029. https://doi.org/10.1093/comjnl/bxad039

Vancouver

Zhang L, Kan H, Qiu F, Hao F. A Publicly Verifiable Optimistic Fair Exchange Protocol Using Decentralized CP-ABE. The Computer Journal. 2024;67(3):1017-1029. doi:10.1093/comjnl/bxad039

BibTeX
@article{Zhang2024,
  author = {Zhang, Liang and Kan, Haibin and Qiu, Feiyang and Hao, Feng},
  title = {A Publicly Verifiable Optimistic Fair Exchange Protocol Using Decentralized CP-ABE},
  journal = {The Computer Journal},
  year = {2024},
  volume = {67},
  number = {3},
  pages = {1017--1029},
  doi = {10.1093/comjnl/bxad039}
}
Kostenlos starten →