The Capacity Region of Distributed Multi-User Secret Sharing Under Perfect Secrecy
Authors: 
Jiahong Wu, Nan Liu, Wei KangAuthors Info & Claims
Jiahong Wu, Nan Liu, Wei KangAuthors Info & ClaimsPages 9954 - 9969
Abstract
We study the problem of distributed multi-user secret sharing (DMUSS), involving a main node, N storage nodes, and K users. Every user has access to the contents of a certain subset of storage nodes and wants to decode an independent secret message. With knowledge of K secret messages, the main node strategically places encoded shares in the storage nodes, ensuring two crucial conditions: (i) each user can recover its own secret message from the storage nodes that it has access to; (ii) each user is unable to acquire any information regarding the collection of <inline-formula> <tex-math notation="LaTeX">$K-1$ </tex-math></inline-formula> secret messages for all the other users. The rate of each user is defined as the size of its secret message normalized by the size of a storage node. We characterize the capacity region of the DMUSS problem, which is the closure of the set of all achievable rate tuples that satisfy the correctness and perfect secrecy conditions. The converse proof relies on a bound from the traditional single-secret sharing regime. In the achievability proof, we firstly design the linear decoding functions, based on the fact that each secret message needs to be recovered from a single set of storage nodes. It turns out that the perfect secrecy condition holds if K matrices, whose entries are extracted from the decoding functions, are full rank. We prove that the decoding functions can be constructed explicitly if the rate tuple satisfies the converse and the field size is not less than K. At last, the encoding functions are obtained by solving the system of linear decoding functions, where some shares are equal to the randomness and the other shares are linear combinations of the secret messages and the randomness.
References
[1]
A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11, pp. 612–613, Nov. 1979.
[2]
G. R. Blakley, “Safeguarding cryptographic keys,” in Proc. Manag. Requirements Knowl., Int. Workshop, 1979, pp. 313–318.
[3]
M. Ben-Or and A. Wigderson, “Completeness theorems for noncryptographic fault-tolerant distributed computation,” in Proc. 20th Annu. ACM Symp. Theory Comput. (STOC), 1988, pp. 1–10.
[4]
D. Chaum, C. Crépeau, and I. Damgard, “Multiparty unconditionally secure protocols,” in Proc. 20th Annu. ACM Symp. Theory Comput. (STOC), 1988, pp. 11–19.
[5]
R. Cramer, I. Damgård, and U. Maurer, “General secure multi-party computation from any linear secret-sharing scheme,” in Proc. Int. Conf. Theory Appl. Cryptograph. Techn., 2000, pp. 316–334.
[6]
Q. Yu, N. Raviv, J. So, and A. S. Avestimehr, “Lagrange coded computing: Optimal design for resiliency, security and privacy,” in Proc. Int. Conf. Artif. Intell. Statist., 2018, pp. 1215–1225.
[7]
H. Akbari-Nodehi and M. A. Maddah-Ali, “Secure coded multi-party computation for massive matrix operations,” IEEE Trans. Inf. Theory, vol. 67, no. 4, pp. 2379–2398, Apr. 2021.
[8]
Y. Desmedt and Y. Frankel, “Threshold cryptosystems,” in Proc. Annu. Int. Cryptol. Conf., 1989, pp. 307–315.
[9]
Y. Desmedt and Y. Frankel, “Shared generation of authenticators and signatures (extended abstract),” in Proc. Annu. Int. Cryptol. Conf., 1991, pp. 457–469.
[10]
V. Shoup, “Practical threshold signatures,” in Proc. Int. Conf. Theory Appl. Cryptograph. Techn., 2000, pp. 207–220.
[11]
W.-T. Chang and R. Tandon, “On the capacity of secure distributed matrix multiplication,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Dec. 2018, pp. 1–6.
[12]
R. G. L. D’Oliveira, S. El Rouayheb, and D. Karpuk, “GASP codes for secure distributed matrix multiplication,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2019, pp. 1107–1111.
[13]
M. Aliasgari, O. Simeone, and J. Kliewer, “Private and secure distributed matrix multiplication with flexible communication load,” IEEE Trans. Inf. Forensics Security, vol. 15, pp. 2722–2734, 2020.
[14]
J. A. Garay, R. Gennaro, C. Jutla, and T. Rabin, “Secure distributed storage and retrieval,” Theor. Comput. Sci., vol. 243, nos. 1–2, pp. 363–389, Jul. 2000.
[15]
G. Ateniese, K. Fu, M. Green, and S. Hohenberger, “Improved proxy re-encryption schemes with applications to secure distributed storage,” ACM Trans. Inf. Syst. Secur., vol. 9, no. 1, pp. 1–30, Feb. 2006.
[16]
Z. Li and H. Sun, “On extremal rates of secure storage over graphs,” IEEE Trans. Inf. Forensics Security, vol. 18, pp. 4721–4731, 2023.
[17]
R. A. Chou, “Quantifying the cost of privately storing data in distributed storage systems,” IEEE Trans. Inf. Theory, vol. 68, no. 11, pp. 7485–7499, Nov. 2022.
[18]
H. Yang, W. Shin, and J. Lee, “Private information retrieval for secure distributed storage systems,” IEEE Trans. Inf. Forensics Security, vol. 13, no. 12, pp. 2953–2964, Dec. 2018.
[19]
V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” IACR Cryptol. ePrint Arch., vol. 2006, p. 309, Jan. 2006.
[20]
B. Waters, “Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization,” IACR Cryptol. ePrint Arch., vol. 2008, p. 290, Jan. 2011.
[21]
C. Blundo, A. De Santis, and U. Vaccaro, “Efficient sharing of many secrets,” in Proc. Symp. Theor. Aspects Comput. Sci., 1993, pp. 692–703.
[22]
C. Blundo, A. De Santis, G. Di Crescenzo, A. G. Gaggia, and U. Vaccaro, “Multi-secret sharing schemes,” in Proc. Annu. Int. Cryptol. Conf., 1994, pp. 150–163.
[23]
A. De Santis and B. Masucci, “Multiple ramp schemes,” IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1720–1728, Jul. 1999.
[24]
H. K. P. Anilkumar, A. Rajesh, V. Narayanan, M. M. Prabhakaran, and V. M. Prabhakaran, “Randomness requirements for three-secret sharing,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), vol. 2, Jun. 2023, pp. 252–257.
[25]
W. Huang, M. Langberg, J. Kliewer, and J. Bruck, “Communication efficient secret sharing,” IEEE Trans. Inf. Theory, vol. 62, no. 12, pp. 7195–7206, Dec. 2016.
[26]
R. Bitar and S. E. Rouayheb, “Staircase codes for secret sharing with optimal communication and read overheads,” IEEE Trans. Inf. Theory, vol. 64, no. 2, pp. 933–943, Feb. 2018.
[27]
J. Ding, C. Lin, H. Wang, and C. Xing, “Communication efficient secret sharing with small share size,” IEEE Trans. Inf. Theory, vol. 68, no. 1, pp. 659–669, Jan. 2022.
[28]
M. Soleymani and H. Mahdavifar, “Distributed multi-user secret sharing,” IEEE Trans. Inf. Theory, vol. 67, no. 1, pp. 164–178, Jan. 2021.
[29]
R. De Prisco, A. De Santis, and F. Palmieri, “Improved protocols for distributed secret sharing,” IEEE Trans. Dependable Secure Comput., vol. 20, no. 5, pp. 3558–3571, Sep./Oct. 2023. 10.1109/TDSC.2022.3213790.
[30]
R. De Prisco, A. De Santis, and F. Palmieri, “Bounds and protocols for graph-based distributed secret sharing,” IEEE Trans. Dependable Secure Comput., vol. 21, no. 1, pp. 434–448, Jan./Feb. 2024. 10.1109/TDSC.2023.3261239.
[31]
A. Khalesi, M. Mirmohseni, and M. A. Maddah-Ali, “The capacity region of distributed multi-user secret sharing,” IEEE J. Sel. Areas Inf. Theory, vol. 2, no. 3, pp. 1057–1071, Sep. 2021.
[32]
A. De Santis and B. Masucci, “New results on distributed secret sharing protocols,” in Data and Applications Security and Privacy XXXVII: 37th Annual IFIP WG 11.3 Conference, DBSec 2023, Sophia Antipolis, France, July 19–21, 2023, Proceedings. Berlin, Germany: Springer-Verlag, 2023, pp. 51–68.
[33]
L. Lu and J. P. Lu, “Novel verifiably distributed multi-user secret sharing schemes,” Cryptol. ePrint Arch., 2021.
[34]
R. Chigullapally, H. Athi, V. Lalitha, and N. Karamchandani, “On distributed multi-user secret sharing with multiple secrets per user,” in Proc. Nat. Conf. Commun. (NCC), Feb. 2024, pp. 1–6.
[35]
R. M. Gray, “Toeplitz and circulant matrices: A review,” Found. Trends Commun. Inf. Theory, vol. 2, no. 3, pp. 155–239, 2005.
[36]
C. Padro, “Lecture notes in secret sharing,” IACR Cryptol. ePrint Arch., vol. 2012, p. 674, Jan. 2012.
[37]
N. Cai and M. Hayashi, “Secure network code for adaptive and active attacks with no-randomness in intermediate nodes,” IEEE Trans. Inf. Theory, vol. 66, no. 3, pp. 1428–1448, Mar. 2020.
[38]
R. W. Yeung, Information Theory and Network Coding. New York, NY, USA: Springer-Verlag, 2008.
[39]
D. R. Stinson, “An explication of secret sharing schemes,” Des., Codes Cryptogr., vol. 2, no. 4, pp. 357–390, Dec. 1992.
[40]
W.-A. Jackson and K. M. Martin, “Perfect secret sharing schemes on five participants,” Des., Codes Cryptogr., vol. 9, no. 3, pp. 267–286, 1996.
[41]
O. Farràs, T. Kaced, S. Martín, and C. Padro, “Improving the linear programming technique in the search for lower bounds in secret sharing,” IEEE Trans. Inf. Theory, vol. 66, no. 11, pp. 7088–7100, Nov. 2020.
[42]
P. J. Cameron, Combinatorics: Topics, Techniques, Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1994.
[43]
R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, Network Coding Theory. MA, USA: Now, 2006.
[44]
G. Strang, Linear Algebra and Its Applications. Belmont, CA, USA: Thomson, Brooks/Cole, 2006.
[45]
J. B. Fraleigh, A First Course in Abstract Algebra, 7th ed., Reading, MA, USA: Addison-Wesley, 2002.
[46]
J. L. Carter and M. N. Wegman, “Universal classes of hash functions,” J. Comput. Syst. Sci., vol. 18, no. 2, pp. 143–154, Apr. 1979.
[47]
C. H. Bennett, G. Brassard, C. Crepeau, and U. M. Maurer, “Generalized privacy amplification,” in Proc. IEEE Int. Symp. Inf. Theory, Sep. 1994, p. 350.
[48]
R. Matsumoto and M. Hayashi, “Universal secure multiplex network coding with dependent and non-uniform messages,” IEEE Trans. Inf. Theory, vol. 63, no. 6, pp. 3773–3782, Jun. 2017.
[49]
H. Krawczyk, “LFSR-based hashing and authentication,” in Proc. Annu. Int. Cryptol. Conf., 1994, pp. 129–139.
[50]
M. Hayashi, “Exponential decreasing rate of leaked information in universal random privacy amplification,” IEEE Trans. Inf. Theory, vol. 57, no. 6, pp. 3989–4001, Jun. 2011.
[51]
Á. Vázquez-Castro and M. Hayashi, “Physical layer security for RF satellite channels in the finite-length regime,” IEEE Trans. Inf. Forensics Secur., vol. 14, no. 4, pp. 981–993, Apr. 2019.
[52]
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms. Cambridge, MA, USA: MIT Press, 2009.
[53]
R. Koetter and M. Medard, “An algebraic approach to network coding,” in Proc. IEEE Int. Symp. Inf. Theory, Jun. 2001, p. 104.
Index Terms
- The Capacity Region of Distributed Multi-User Secret Sharing Under Perfect Secrecy
Index terms have been assigned to the content through auto-classification.
Recommendations
Distributed Multi-User Secret Sharing
We consider a distributed secret sharing system that consists of a dealer, n storage nodes, and m 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 ...
Ideal Perfect Multilevel Threshold Secret Sharing Scheme
IAS '09: Proceedings of the 2009 Fifth International Conference on Information Assurance and Security - Volume 02Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification, each shareholder keeps both $x$-coordinate ...
Distributed Multi-User Secret Sharing
2018 IEEE International Symposium on Information Theory (ISIT)A distributed secret sharing system is considered that consists of a dealer, <tex>$n$</tex> storage nodes, and <tex>$m$</tex> users. Each user is given access to a certain subset of storage nodes where it can download the data. The dealer wants to ...
Comments
Information & Contributors
Information
Published In
1556-6021 © 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 01 January 2024
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Feb 2025