Near-Optimal Secret Sharing and Error Correcting Codes in AC0


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 AC. The feasibility of non-trivial secret sharing schemes in AC was recently shown by Bogdanov… (More)


  • Presentations referencing similar topics