Cited by 63Blockchain Technology Applications and SecurityCryptography and Data SecurityCloud Data Security Solutions

Meta-key: a secure data-sharing protocol under blockchain-based decentralized storage architecture

Open access
Li, Dagang, Du, Rong, Fu, Yue, Au, Man Ho·2019·IEEE Networking Letters

Abstract

In this letter we propose Meta-key, a data-sharing mechanism that enables users share their encrypted data under a blockchain-based decentralized storage architecture. All the data-encryption keys are encrypted by the owner's public key and put onto the blockchain for safe and secure storage and easy key-management. Encrypted data are stored in dedicated storage nodes and proxy re-encryption mechanism is used to ensure secure data-sharing in the untrusted environment. Security analysis of our model shows that the proxy re-encryption adopted in our system is naturally free from collusion-attack due to the specific architecture of Meta-key.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/lnet.2019.2891998

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • D2D communication improves overall system throughput, mitigates communication delays, and reduces energy consumption and traffic load.

    “D2D takes advantage of the proximity of device communication for efficient utilization of available resources, enabling to improve the overall system throughput, mitigate communication delays and reduce energy consumption and traffic load [133].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Li, D., Du, R., Fu, Y., & Au, M. H.
Affiliations
  • Hong Kong University of Science and Technology (HK)
  • Peking University (CN)
  • Hong Kong Polytechnic University (HK)
Venue
IEEE Networking Letters
Published
2019-03
Volume
1
Issue
1
Pages
30-33
ISSN
2576-3156 (ISSN-L)
OpenAlex
W2765967890
Cited by
63
References
3
Citations by year
2026: 6 · 2025: 4 · 2024: 12 · 2023: 10 · 2022: 8 · 2021: 6 · 2020: 10 · 2019: 6 · 2018: 1
FWCI
9.29
Type
journal article
Language
en
Open access
Locations
  • IEEE Networking Letters (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Shenzhen Key Lab Project (ZDSYS201703031405137)
  • Shenzhen Municipal Development and Reform Commission
Topics
  • Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
Keywords
secure data sharing, encrypted data, key management, public-key encryption, proxy re-encryption, collusion resistance

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