Meta-key: a secure data-sharing protocol under blockchain-based decentralized storage architecture
Open accessAbstract
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.
Integrity signals
Registry
Cites
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.
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].”
From Blockchain for 5G and beyond networks: A state of the art survey (2020) · cites this paper as [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
Improved proxy re-encryption schemes with applications to secure distributed storage
Ateniese, G., Fu, K., Green, M., & Hohenberger, S. (2006) · ACM Transactions on Information and System Security · doi:10.1145/1127345.1127346 · Cited by 1,475 · see citing works
Towards a secure and interoperable DRM architecture
Taban, G., Cárdenas, Á. A., & Gligor, V. D. (2006) · doi:10.1145/1179509.1179524 · Cited by 89 · see citing works
A Type-and-Identity-Based Proxy Re-encryption Scheme and Its Application in Healthcare
Ibraimi, L., Tang, Q., Hartel, P., & Jonker, W. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85259-9_12 · Cited by 44 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Blockchain for 5G and beyond networks: A state of the art survey
Nguyen, D. C., Pathirana, P. N., Ding, M., & Seneviratne, A. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102693 · Cited by 412 · see citing works
- 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
- green
- arxiv.org
- Licence
- 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