Relationship Sharing-based Trustworthy Verifiable Multi-Party Verification in Decentralized Identity

Decentralized Identity (DID) management is pivotal for data security and privacy-preserving in the digital era, yet existing systems face critical challenges, including single point of failure, privacy leakage, and high computational overhead. To address these limitations, this paper proposes a multi-party verifiable trust validation mechanism based on Verifiable Relation Sharing (VRS). The mechanism skillfully integrates Multi-Verifier Zero-Knowledge proofs (MVZK) with Verifiable Secret Sharing (VSS) to securely share secret attribute vectors among multiple verifiers. This enables the generation of Zero-Knowledge Proof (ZKP) of relationships without revealing the actual data. This mechanism ensures that each verifier obtains partial information, thereby effectively defending against single-point attacks, and reducing computational and communication costs through distributed verification. Experimental results confirm the practicality within DID ecosystems, offering a scalable and privacy-preserving solution for multi-party verification and a foundational framework for secure DID verification in blockchain.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/bigdatasecurity66063.2025.00031
Primary Topic
Access Control and Trust
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Relationship Sharing-based Trustworthy Verifiable Multi-Party Verification in Decentralized Identity

Keke Gai, Jing Yu, Kai Ding, Yuqing Zhang
Access Control and Trust
article

Relationship Sharing-based Trustworthy Verifiable Multi-Party Verification in Decentralized Identity

Keke Gai, Jing Yu, Kai Ding, Yuqing Zhang
article en

Abstract

Decentralized Identity (DID) management is pivotal for data security and privacy-preserving in the digital era, yet existing systems face critical challenges, including single point of failure, privacy leakage, and high computational overhead. To address these limitations, this paper proposes a multi-party verifiable trust validation mechanism based on Verifiable Relation Sharing (VRS). The mechanism skillfully integrates Multi-Verifier Zero-Knowledge proofs (MVZK) with Verifiable Secret Sharing (VSS) to securely share secret attribute vectors among multiple verifiers. This enables the generation of Zero-Knowledge Proof (ZKP) of relationships without revealing the actual data. This mechanism ensures that each verifier obtains partial information, thereby effectively defending against single-point attacks, and reducing computational and communication costs through distributed verification. Experimental results confirm the practicality within DID ecosystems, offering a scalable and privacy-preserving solution for multi-party verification and a foundational framework for secure DID verification in blockchain.

Beijing Institute of Technology (CN), Minzu University of China (CN)
Reduced inequalities
Openalex Percentile: Top 85%
Access Control and Trust
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.