@inproceedings{4d903c0a7c934c5fabef068fac5b3b43,
title = "Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme",
abstract = "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.",
author = "LIqun Chen and Thalia Laing and Keith Martin",
year = "2017",
doi = "10.1007/978-3-319-57339-7",
language = "English",
isbn = "978-3-319-57338-0",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "40--57",
booktitle = "Progress in Cryptology - AFRICACRYPT 2017",
note = "AfricaCrypt 2017 : 9th International Conference on Cryptology in Africa ; Conference date: 24-05-2017 Through 26-05-2017",
}