Paper 2016/1014 Original: eprint.iacr.org/2016/1014 ↗
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 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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2016-10-27: last updated
- 2016-10-27: published
- Short URL
- https://ia.cr/2016/1014
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2016/1014,
author = {Liqun Chen and Thalia M. Laing and Keith M. Martin},
title = {Revisiting and Extending the AONT-RS scheme: a Robust Computationally Secure Secret Sharing Scheme},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/1014},
year = {2016},
url = {https://eprint.iacr.org/2016/1014}
}