On Distributed Multi-User Secret Sharing with Multiple Secrets per User
Abstract: We consider a distributed multi-user secret sharing (DMUSS) setting in which there is a dealer, $n$ storage nodes, and $m$ secrets. Each user demands a $t$-subset of $m$ secrets. Earlier work in this setting dealt with the case of $t=1$; in this work, we consider general $t$. The user downloads shares from the storage nodes based on the designed access structure and reconstructs its secrets. We identify a necessary condition on the access structures to ensure weak secrecy. We also make a connection between access structures for this problem and $t$-disjunct matrices. We apply various $t$-disjunct matrix constructions in this setting and compare their performance in terms of the number of storage nodes and communication complexity. We also derive bounds on the optimal communication complexity of a distributed secret sharing protocol. Finally, we characterize the capacity region of the DMUSS problem when the access structure is specified.
- A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11, p. 612–613, 1979.
- G. R. Blakley, “Safeguarding cryptographic keys,” 1979 International Workshop on Managing Requirements Knowledge (MARK), pp. 313–318, 1899.
- R. Cramer, I. Damgård, and U. Maurer, “General secure multi-party computation from any linear secret-sharing scheme,” Advances in Cryptology—EUROCRYPT 2000, pp. 316–334, 2000.
- S. Takahashi and K. Iwamura, “Secret sharing scheme suitable for cloud computing,” 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA), pp. 530–537, 2013.
- Y. Liu and Q. Zhao, “E-voting scheme using secret sharing and k-anonymity,” World Wide Web, vol. 22, pp. 1657–1667, 2019.
- R. K. Raman and L. R. Varshney, “Distributed storage meets secret sharing on the blockchain,” 2018 information theory and applications workshop (ITA), pp. 1–6, 2018.
- A. Baccarini, M. Blanton, and C. Yuan, “Multi-party replicated secret sharing over a ring with applications to privacy-preserving machine learning,” Cryptology ePrint Archive, 2020.
- M. Soleymani and H. Mahdavifar, “Distributed multi-user secret sharing,” IEEE Transactions on Information Theory, vol. PP, 01 2018.
- E. Sperner, “Ein satz über untermengen einer endlichen menge,” Mathematische Zeitschrift, no. 1, pp. 544–548, 1928.
- A. Khalesi, M. Mirmohseni, and M. A. Maddah-Ali, “The capacity region of distributed multi-user secret sharing,” IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 3, pp. 1057–1071, 2021.
- W. Kautz and R. Singleton, “Nonrandom binary superimposed codes,” IEEE Trans. Inf. Theor., vol. 10, no. 4, p. 363–377, sep 2006.
- E. Porat and A. Rothschild, “Explicit nonadaptive combinatorial group testing schemes,” IEEE Trans. Inf. Theor., vol. 57, no. 12, p. 7982–7989, dec 2011.
- H. A. Inan, P. Kairouz, and A. Özgür, “Sparse combinatorial group testing,” IEEE Transactions on Information Theory, vol. 66, no. 5, pp. 2729–2742, 2020.
- G. G. T. Balint, “Construction in non-adaptive group testing steiner systems and latin squares,” Ph.D. thesis, Illinois Institute of Technology, 2014.
- D. Lubell, “A short proof of sperner’s lemma,” Journal of Combinatorial Theory, Series A, vol. 1, p. 299, 1966.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
