In this paper, we propose a fully quantum multi-secret sharing scheme. In contrast with
regular secret sharing schemes, multi-secret sharing schemes share a set of unknown …

Approximate Degree in Classical and Quantum Computing Page 1 Approximate Degree in
Classical and Quantum Computing Page 2 Other titles in Foundations and Trends® in …

We initiate a study of locally decodable codes with randomized encoding. Standard locally
decodable codes are error correcting codes with a deterministic encoding function and a …

We prove two new results about the inability of low-degree polynomials to uniformly
approximate constant-depth circuits, even to slightly-better-than-trivial error. First, we prove a …

Shamir's celebrated secret sharing scheme provides an efficient method for encoding a
secret of arbitrary length $\ell $ among any $ N\leq 2^\ell $ players such that for a threshold …

Using information inequalities, we prove any unrestricted arithmetic circuits computing the
shares of any $(t, n) $-threshold secret sharing scheme must satisfy some superconcentrator …

Non-malleable codes were introduced by Dziembowski, Pietrzak, and Wichs (JACM 2018)
as a generalization of standard error correcting codes to handle severe forms of tampering …

The possibility of implementing secret sharing in the complexity class AC^ 0 AC 0 was
shown in a recent work by Bogdanov et al.(Crypto'16) who provided constructions of ramp …

In this paper we propose a secret sharing scheme where the access structure changes over
time following a dynamic data structure. The proposed scheme can accommodate an …

We prove two new results about the inability of low-degree polynomials to uniformly
approximate constant-depth circuits, even to slightly-better-than-trivial error. First, we prove a …