Distributed Multi-User Secret Sharing
Mahdi Soleymani, Hessam Mahdavifar

TL;DR
This paper develops optimal distributed multi-user secret sharing schemes that maximize user capacity while ensuring perfect or weak secrecy, and analyze their communication complexity and storage efficiency.
Contribution
It introduces new protocols achieving optimal bounds on communication and storage, with constructions for perfect and weak secrecy in distributed secret sharing systems.
Findings
Maximum number of users for given storage nodes is characterized.
Protocols that achieve lower bounds on communication complexity with perfect secrecy.
Protocols that optimize both communication and storage overhead under certain conditions.
Abstract
We consider a distributed secret sharing system that consists of a dealer, storage nodes, and users. Each user is given access to a certain subset of storage nodes, where it can download the stored data. The dealer wants to securely convey a specific secret to user via storage nodes, for . More specifically, two secrecy conditions are considered in this multi-user context. The weak secrecy condition is that each user does not get any information about the individual secrets of other users, while the perfect secrecy condition implies that a user does not get any information about the collection of all other users' secrets. In this system, the dealer encodes secrets into several secret shares and loads them into the storage nodes. Given a certain number of storage nodes we find the maximum number of users that can be served in such a system and construct…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Cooperative Communication and Network Coding · Privacy-Preserving Technologies in Data
