Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme
In 2010, Resch and Plank proposed a computationally secure secret sharing scheme, called AONT-RS. We present a generalisation of their scheme and discuss two ways in which information is leaked if used to distribute small ciphertexts. We discuss how to prevent such leakage and provide a proof of computational privacy in the random oracle model. Next, we extend the scheme to be robust and prove the robust AONT-RS achieves computational privacy in the random oracle model and computational recoverability under standard assumptions. Finally, we compare the security, share size and complexity of the AONT-RS scheme with Krawczyk’s SSMS scheme.
- 2.Blakley, G.R.: Safeguarding cryptographic keys. In: Proceeding of the National Computer Conference 1979, vol. 48, pp. 313–317 (1979)Google Scholar
- 4.Chandrasekara, A., Bala, R., Landers, G.: Critical capabilities for object storage - Gartner. Technical report (March 2016). https://www.gartner.com/doc/3269531/critical-capabilities-object-storage (Accessed March 2017)
- 7.IBM. IBM Cloud Object Storage (2016). https://www.cleversafe.com/platform/why-ibm-cloud-object-storage, Accessed 04 Sept 2016
- 14.Resch, J.K., Plank, J.S.: AONT-RS: blending security and performance in dispersed storage systems. In: FAST-2011: 9th Usenix Conference on File and Storage Technologies, pp. 191–202, February 2011Google Scholar
- 16.Rogaway, P., Bellare, M.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Proceedings of the 14th ACM conference on Computer and communications security, pp. 172–184. ACM (2007)Google Scholar