The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
XCLAIM: Trustless, Interoperable, Cryptocurrency-Backed Assets
Open accessAbstract
Building trustless cross-blockchain trading protocols is challenging. Centralized exchanges thus remain the preferred route to execute transfers across blockchains. However, these services require trust and therefore undermine the very nature of the blockchains on which they operate. To overcome this, several decentralized exchanges have recently emerged which offer support for atomic cross-chain swaps (ACCS). ACCS enable the trustless exchange of cryptocurrencies across blockchains, and are the only known mechanism to do so. However, ACCS suffer significant limitations; they are slow, inefficient and costly, meaning that they are rarely used in practice. We present XCLAIM: the first generic framework for achieving trustless and efficient cross-chain exchanges using cryptocurrency-backed assets (CbAs). XCLAIM offers protocols for issuing, transferring, swapping and redeeming CbAs securely in a non-interactive manner on existing blockchains. We instantiate XCLAIM between Bitcoin and Ethereum and evaluate our implementation; it costs less than USD 0.50 to issue an arbitrary amount of Bitcoin-backed tokens on Ethereum. We show XCLAIM is not only faster, but also significantly cheaper than atomic cross-chain swaps. Finally, XCLAIM is compatible with the majority of existing blockchains without modification, and enables several novel cryptocurrency applications, such as cross-chain payment channels and efficient multi-party swaps.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 1×
“As such, adversaries may perform arbitrary actions to maximize their economic value, such as delay or censor transactions, read unconfirmed transactions in the network or in mining pool memory, and perform Sybil attacks [53].”
BackgroundA Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998 · cited 1×
“Each block header in chainRelay contains the root of the Merkle tree [87] containing all transactions (or their identifiers) for”
BackgroundA Survey of Attacks on Ethereum Smart Contracts (SoK)
Atzei, N., Bartoletti, M., & Cimoli, T. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-54455-6_8 · Cited by 1,553 · cited 1×
“the very nature of the cryptocurrencies on which they operate, making them vulnerable to attacks [32], [35], [89], [95].”
BackgroundBulletproofs: Short Proofs for Confidential Transactions and More
Bunz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., & Maxwell, G. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00020 · Cited by 1,154 · cited 1×
“The former can in theory be achieved by using non-interactive zero-knowledge proof (ZKP) systems such as SNARKs [39], STARKs [36] or Bulletproofs [45] for hash pre-image verifi-cation (assuming the corresponding arithmetic circuits can be efficiently constructed).”
BackgroundThe Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
Vukolić, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-39028-4_9 · Cited by 1,051 · cited 1×
“For permissioned (Proof-of-Authority) systems, the verification is analogous, or simpler, if the consensus participants are pre-defined [108].”
BackgroundBitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090263 · Cited by 493
Cited by
SoK: Decentralized Finance (DeFi)
Werner, S., Perez, D., Gudgeon, L., Klages-Mundt, A., Harz, D., & Knottenbelt, W. (2022) · Proceedings of the 4th ACM Conference on Advances in Financial Technologies · doi:10.1145/3558535.3559780 · Cited by 404
Self-citationKhan, S., Amin, M. B., Azar, A. T., & Aslam, S. (2021) · IEEE Access · doi:10.1109/access.2021.3106384 · Cited by 89
Metadata
- Authors
- Zamyatin, A., Harz, D., Lind, J., Panayiotou, P., Gervais, A., & Knottenbelt, W.
- Venue
- 2019 IEEE Symposium on Security and Privacy (SP)
- Publisher
- IEEE
- Published
- 2019-05
- Pages
- 193-210
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2974125212
- Cited by
- 231
- References
- 6
- FWCI
- 18.44
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: XCLAIM: Trustless, Interoperable, Cryptocurrency-Backed Assets. https://app.cochat.ai/papers/10.1109/sp.2019.00085
- The paper
- Zamyatin, A., Harz, D., Lind, J., Panayiotou, P., Gervais, A., & Knottenbelt, W. (2019). XCLAIM: Trustless, Interoperable, Cryptocurrency-Backed Assets. 2019 IEEE Symposium on Security and Privacy (SP). https://doi.org/10.1109/sp.2019.00085
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.