Cryptology ePrint Archive: Report 2016/1014

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

Liqun Chen and Thalia M. Laing and Keith M. Martin

Abstract: In 2010, Resch and Plank proposed a computationally secure secret sharing scheme, called the AONT-RS scheme. We present a generalisation of their scheme and discuss two ways in which information is leaked if the scheme is used to distribute small ciphertexts. We then 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, ensuring the distributed data is recoverable even if a bounded number of players submit incorrect shares. We prove the robust AONT-RS scheme achieves computational privacy and recoverability in the random oracle model. Finally, we compare the security, share size and complexity of the robust AONT-RS scheme with a refined version of Krawczyk's robust scheme by Bellare and Rogaway.

Category / Keywords: secret-key cryptography / Secret sharing, threshold, robust, computationally secure, privacy, distributed storage, recoverability, cloud storage

Date: received 25 Oct 2016

Contact author: thalia laing 2012 at live rhul ac uk

Available format(s): PDF | BibTeX Citation

Version: 20161027:210759 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]