DLattice: A Permission-Less Blockchain Based on DPoS-BA-DAG Consensus for Data Tokenization
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
In today's digital information age, the conflict between the public's growing awareness of their own data protection and the data owners' inability to obtain data ownership has become increasingly prominent. The emergence of blockchain provides a new direction for data protection and data tokenization. Nonetheless, existing cryptocurrencies such as Bitcoin using Proof-of-Work are particularly energy intensive. On the other hand, classical protocols such as Byzantine agreement do not work efficiently in an open environment. Therefore, in this paper, we propose a permission-less blockchain with a novel double-DAG (directed acyclic graph) architecture called DLattice, where each account has its own Account-DAG and all accounts make up a greater Node-DAG structure. DLattice parallelizes the growth of each account's Account-DAG, each of which is not influenced by other accounts' irrelevant transactions. DLattice uses a new DPoS-BA-DAG(PANDA) protocol to reach consensus among users only when the forks are observed. Based on proposed DLattice, we introduce a process of data tokenization, including data assembling, data anchoring, and data authorization. We implement DLattice and evaluate its performance on 25 ECS virtual machines, simulating up to 500 nodes. The experimental results show that DLattice reaches a consensus in 10 seconds, achieves desired throughput, and incurs almost no penalty for scaling to more users.
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
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023 · cited 1×
“Byzantine Agreement (BA) protocols have been used to replicate a service across a small group of servers [22] [23], therefore they are suitable for permissioned Blockchain.”
MethodDouceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 1×
“An entity could create hundreds of nodes on a single machine [32].”
BackgroundAlgorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Y., Hemo, R., Micali, S., Vlachos, G., & Zeldovich, N. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132757 · Cited by 1,499
Blockchain distributed ledger technologies for biomedical and health care applications
Kuo, T.-T., Kim, H.-E., & Ohno-Machado, L. (2017) · Journal of the American Medical Informatics Association · doi:10.1093/jamia/ocx068 · Cited by 1,350
Wang, S., Zhang, Y., & Zhang, Y. (2018) · IEEE Access · doi:10.1109/access.2018.2851611 · Cited by 627
Cited by
Scaling Blockchains: A Comprehensive Survey
Hafid, A., Hafid, A. S., & Samih, M. (2020) · IEEE Access · doi:10.1109/access.2020.3007251 · Cited by 328
A survey of Layer-two blockchain protocols
Gangwal, A., Gangavalli, H. R., & Thirupathi, A. (2023) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2022.103539 · Cited by 180
Skh Saad, S. M., & Raja Mohd Radzi, R. Z. (2020) · International Journal of Innovative Computing · doi:10.11113/ijic.v10n2.272 · Cited by 119
“The most common examples include, Bitshares, Steem, EOS and Lisk [11].”
BackgroundBlockchain-based resource allocation model in fog computing
Wang, H., Wang, L., Zhou, Z., Tao, X., Pau, G., & Arena, F. (2019) · Applied Sciences · doi:10.3390/app9245538 · Cited by 58
Nguyen, D. C., Ding, M., Pathirana, P. N., Seneviratne, A., & Zomaya, A. Y. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3120998 · Cited by 5
“Indeed, in current consensus algorithms, e.g., DPoS [36], each miner must contact at least more than half of the total nodes in the miner group, which consequently increases latency and alleviates the scalability of the blockchain system.”
Background
Metadata
- Authors
- Zhou, T., Li, X., & Zhao, H.
- Venue
- IEEE Access
- Published
- 2019
- Volume
- 7
- Pages
- 39273-39287
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2924269424
- Cited by
- 63
- References
- 5
- FWCI
- 10.00
- Type
- journal article
- Language
- en
- Open access
- gold
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
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.