Near-optimal secret sharing and error correcting codes in AC^0

DOI10.1007/978-3-319-70503-3_14MaRDI QIDQ1690280zbMATH OpenOpenAlexFDO

Authors Kuan Cheng, Yuval Ishai, Xin Li

Publication date 19 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-70503-3_14

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Decoding (94B35)

Recommendations

• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
• Secure Computation from Random Error Correcting Codes
• Nearly optimal robust secret sharing
• Robust secret sharing schemes against local adversaries
• Unconditionally-secure robust secret sharing with compact shares

Cited in

(8)

• Quantum multi-secret sharing via trap codes and discrete quantum walks
• Bounded indistinguishability and the complexity of recovering secrets
• Staircase Codes for Secret Sharing With Optimal Communication and Read Overheads
• Approximate Degree in Classical and Quantum Computing
• Secret sharing with binary shares
• The large-error approximate degree of \(\mathrm{AC}^0\)
• Secure Computation from Random Error Correcting Codes
• The large-error approximate degree of \(\mathrm{AC}^0\)

This page was built for publication: Near-optimal secret sharing and error correcting codes in \(\mathsf{AC}^0\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690280)