Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme

LIqun Chen, Thalia Laing, Keith Martin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

89 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationProgress in Cryptology - AFRICACRYPT 2017
Subtitle of host publication9th International Conference on Cryptology in Africa, Dakar, Senegal, May 24-26, 2017, Proceedings
Number of pages18
ISBN (Electronic)978-3-319-57339-7
ISBN (Print)978-3-319-57338-0
Publication statusPublished - 2017
EventAfricaCrypt 2017: 9th International Conference on Cryptology in Africa - Dakar, Senegal
Duration: 24 May 201726 May 2017

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceAfricaCrypt 2017

Cite this