Open Access
ARTICLE
Designing a Secure and Scalable Data Sharing Mechanism Using Decentralized Identifiers (DID)
1 Department of Management Information Systems, National Chung Hsing University, Taichung, 402, Taiwan
2 Information and Communication Security Research Center, Feng Chia University, Taichung, 407, Taiwan
3 Department of Information Engineering and Computer Science, Feng Chia University, Taichung, 407, Taiwan
* Corresponding Author: Chin-Chen Chang. Email:
(This article belongs to the Special Issue: Key Technologies and Applications of Blockchain Technology in Supply Chain Intelligence and Trust Establishment)
Computer Modeling in Engineering & Sciences 2024, 141(1), 809-822. https://doi.org/10.32604/cmes.2024.051612
Received 10 March 2024; Accepted 31 May 2024; Issue published 20 August 2024
Abstract
Centralized storage and identity identification methods pose many risks, including hacker attacks, data misuse, and single points of failure. Additionally, existing centralized identity management methods face interoperability issues and rely on a single identity provider, leaving users without control over their identities. Therefore, this paper proposes a mechanism for identity identification and data sharing based on decentralized identifiers. The scheme utilizes blockchain technology to store the identifiers and data hashed on the chain to ensure permanent identity recognition and data integrity. Data is stored on InterPlanetary File System (IPFS) to avoid the risk of single points of failure and to enhance data persistence and availability. At the same time, compliance with World Wide Web Consortium (W3C) standards for decentralized identifiers and verifiable credentials increases the mechanism’s scalability and interoperability.Keywords
Cite This Article
![cc](https://www.techscience.com/static/images/cc.jpg?t=20230215)
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.