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.
CITATION STYLE
Chen, L., Laing, T. M., & Martin, K. M. (2017). Revisiting and extending the aont-rs scheme: A robust computationally secure secret sharing scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10239 LNCS, pp. 40–57). Springer Verlag. https://doi.org/10.1007/978-3-319-57339-7_3
Mendeley helps you to discover research relevant for your work.