Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuyang Xiong

dblp:369/5464 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › secret sharing › access structure
general access structures
0.912025
On the Design of Distributed Multi-User Secret Image Sharing for General Access Structures · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic protocols and secure computation
secret sharing
0.912025
On the Design of Distributed Multi-User Secret Image Sharing for General Access Structures · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic protocols and secure computation › secret sharing
visual cryptography
0.912025
On the Design of Distributed Multi-User Secret Image Sharing for General Access Structures · IEEE Trans. Dependable Secur. Comput. 2025
Storage systems
distributed storage
0.312025
On the Design of Distributed Multi-User Secret Image Sharing for General Access Structures · IEEE Trans. Dependable Secur. Comput. 2025

Methods — techniques the papers use, named apart from their topics

vandermonde matrix · 1.7matrix decomposition · 1.7
YearPublicationVenuePosition
2025 On the Design of Distributed Multi-User Secret Image Sharing for General Access Structures
abstract
In this article, a secret image sharing (SIS) scheme for general access structures (GAS) is designed for distributed multi-user scenario. In the proposed distributed multi-user SIS (DM-SIS), multiple secret images are encoded into shadows which are then distributed to the corresponding storage nodes of a network. By collecting the shadows from nodes, each user is capable of decrypting the corresponding secret image. Fundamentally, we utilize an invertible target matrix, which is initially obtained from the GAS and a base matrix with Vandermonte coordinates, to construct shadows. To deal with the case of non-invertible target matrix, three matrix-adjusting procedures are further introduced. Theoretical analysis, numerical examples, and experiments are provided to verify the feasibility of the proposed technique. When compared to previous methods, the proposed approach can implement GAS sharing strategy in distributed multi-user environment. Meantime, significant improvements on storage overhead and sharing capacity are also achieved.
Yuyang Xiong, Bing Chen 0004, Ching-Nung Yang, Wei Qi Yan 0001, Qing-Yu Peng
IEEE Trans. Dependable Secur. Comput.2