2000 character limit reached
Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage
Published 15 Mar 2024 in cs.IT, cs.CR, and math.IT | (2403.10676v1)
Abstract: Consider the problem of storing data in a distributed manner over $T$ servers. Specifically, the data needs to (i) be recoverable from any $\tau$ servers, and (ii) remain private from any $z$ colluding servers, where privacy is quantified in terms of mutual information between the data and all the information available at any $z$ colluding servers. For this model, our main results are (i) the fundamental trade-off between storage size and the level of desired privacy, and (ii) the optimal amount of local randomness necessary at the encoder. As a byproduct, our results provide an optimal lower bound on the individual share size of ramp secret sharing schemes under a more general leakage symmetry condition than the ones previously considered in the literature.
- R. A. Chou and J. Kliewer, “Secure distributed storage: Rate-privacy trade-off and XOR-based coding scheme,” in IEEE International Symposium on Information Theory (ISIT), 2020, pp. 605–610.
- J. A. Garay, R. Gennaro, C. Jutla, and T. Rabin, “Secure distributed storage and retrieval,” Theoretical Computer Science, vol. 243, no. 1-2, pp. 363–389, 2000.
- A. S. Rawat, O. O. Koyluoglu, and S. Vishwanath, “Centralized repair of multiple node failures with applications to communication efficient secret sharing,” IEEE Transactions on Information Theory, vol. 64, no. 12, pp. 7529–7550, 2018.
- R. Bitar and S. El Rouayheb, “Staircase codes for secret sharing with optimal communication and read overheads,” IEEE Transactions on Information Theory, vol. 64, no. 2, pp. 933–943, 2018.
- W. Huang, M. Langberg, J. Kliewer, and J. Bruck, “Communication efficient secret sharing,” IEEE Transactions on Information Theory, vol. 62, no. 12, pp. 7195–7206, 2016.
- A. Shamir, “How to share a secret,” Communications of the ACM, vol. 22, no. 11, pp. 612–613, 1979.
- G. R. Blakley, “Safeguarding cryptographic keys,” in Proceedings of the National Computer Conference, vol. 48, 1979, pp. 313–317.
- A. Beimel, “Secret-sharing schemes: A survey,” in International Conference on Coding and Cryptology. Springer, 2011, pp. 11–46.
- E. Karnin, J. Greene, and M. Hellman, “On secret sharing systems,” IEEE Transactions on Information Theory, vol. 29, no. 1, pp. 35–41, 1983.
- M. Yoshida, T. Fujiwara, and M. P. Fossorier, “Optimal uniform secret sharing,” IEEE Transactions on Information Theory, vol. 65, no. 1, pp. 436–443, 2018.
- O. Farràs, T. Hansen, T. Kaced, and C. Padró, “Optimal non-perfect uniform secret sharing schemes,” in Annual Cryptology Conference CRYPTO. Springer, 2014, pp. 217–234.
- H. Yamamoto, “Secret sharing system using (k,l,n)𝑘𝑙𝑛(k,l,n)( italic_k , italic_l , italic_n ) threshold scheme,” Electronics and Communications in Japan (Part I: Communications), vol. 69, no. 9, pp. 46–54, 1986.
- G. R. Blakley and C. Meadows, “Security of ramp schemes,” in Workshop on the Theory and Application of Cryptographic Techniques. Springer, 1984, pp. 242–268.
- K. Yoneyama, N. Kunihiro, B. Santoso, and K. Ohta, “Non-linear function ramp scheme,” in Proc. Int. Symp. Inf. Theory Appl.(ISITA), 2004, pp. 788–793.
- M. Yoshida and T. Fujiwara, “Secure construction for nonlinear function threshold ramp secret sharing,” in Proc. of IEEE Int. Symp. Inf. Theory, 2007, pp. 1041–1045.
- K. Kurosawa, K. Okada, K. Sakano, W. Ogata, and S. Tsujii, “Nonperfect secret sharing schemes and matroids,” in Advances in Cryptology—EUROCRYPT’93: Workshop on the Theory and Application of Cryptographic Techniques Lofthus, Norway, May 23–27, 1993 Proceedings 12. Springer, 1994, pp. 126–141.
- R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, “On the size of shares for secret sharing schemes,” Journal of Cryptology, vol. 6, no. 3, pp. 157–167, 1993.
- C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, “On the information rate of secret sharing schemes,” in Advances in Cryptology—CRYPTO’92. Springer, 1992, pp. 148–167.
- M. Van Dijk, “On the information rate of perfect secret sharing schemes,” Designs, codes and cryptography, vol. 6, no. 2, pp. 143–169, 1995.
- L. Csirmaz, “The size of a share must be large,” in Advances in Cryptology—EUROCRYPT’94. Springer, 1995, pp. 13–22.
- C. Blundo, A. D. Santis, R. D. Simone, and U. Vaccaro, “Tight bounds on the information rate of secret sharing schemes,” Designs, Codes and Cryptography, vol. 11, pp. 107–110, 1997.
- O. Farràs, T. Kaced, S. Martín, and C. Padró, “Improving the linear programming technique in the search for lower bounds in secret sharing,” IEEE Transactions on Information Theory, vol. 66, no. 11, pp. 7088–7100, 2020.
- C. Blundo, A. D. Santis, and U. Vaccaro, “Efficient sharing of many secrets,” in Annual Symposium on Theoretical Aspects of Computer Science. Springer, 1993, pp. 692–703.
- M. Yoshida, T. Fujiwara, and M. Fossorier, “Optimum general threshold secret sharing,” in International Conference on Information Theoretic Security, ICITS. Springer, 2012, pp. 187–204.
- O. Farràs, T. B. Hansen, T. Kaced, and C. Padró, “On the information ratio of non-perfect secret sharing schemes,” in Algorithmica, vol. 79, no. 4. Springer, 2017, pp. 987–1013.
- C. Blundo, A. De Santis, and U. Vaccaro, “Randomness in distribution protocols,” Information and Computation, vol. 131, no. 2, pp. 111–139, 1996.
- A. De Santis and B. Masucci, “Multiple ramp schemes,” IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1720–1728, 1999.
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.