Cryptology ePrint Archive: Report 2017/927

Near-Optimal Secret Sharing and Error Correcting Codes in AC0

Kuan Cheng and Yuval Ishai and Xin Li

Abstract: We study the question of minimizing the computational complexity of (robust) secret sharing schemes and error correcting codes. In standard instances of these objects, both encoding and decoding involve linear algebra, and thus cannot be implemented in the class AC0. The feasibility of non-trivial secret sharing schemes in AC0 was recently shown by Bogdanov et al. (Crypto 2016) and that of (locally) decoding errors in AC0 by Goldwasser et al. (STOC 2007).

In this paper, we show that by allowing some slight relaxation such as a small error probability, we can construct much better secret sharing schemes and error correcting codes in the class AC0. In some cases, our parameters are close to optimal and would be impossible to achieve without the relaxation. Our results significantly improve previous constructions in various parameters.

Our constructions combine several ingredients in pseudorandomness and combinatorics in an innovative way. Specifically, we develop a general technique to simultaneously amplify security threshold and reduce alphabet size, using a two-level concatenation of protocols together with a random permutation. We demonstrate the broader usefulness of this technique by applying it in the context of a variant of secure broadcast.

Category / Keywords: secret sharing

Date: received 22 Sep 2017, last revised 11 Oct 2017

Contact author: kcheng17 at jhu edu

Available format(s): PDF | BibTeX Citation

Note: Correct some typos and minor errors.

Version: 20171011:175529 (All versions of this report)

Short URL: ia.cr/2017/927

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]