We introduce the notion of “non-malleable codes” which relaxes the notion of error
correction and error detection. Informally, a code is non-malleable if the message contained …

Consider an abstract storage device Σ(G) that can hold a single element x from a fixed,
publicly known finite group G. Storage is private in the sense that an adversary does not …

Algebraic manipulation detection codes are a cryptographic primitive that was introduced by
Cramer et al.(Eurocrypt 2008). It encompasses several methods that were previously used in …

We present six multiparty protocols with information-theoretic security that tolerate an
arbitrary number of corrupt participants. All protocols assume pairwise authentic private …

We consider the problem of reconstructing a shared secret in the presence of faulty shares,
with unconditional security. We require that any t shares give no information on the shared …

It is a standard result in the theory of quantum error-correcting codes that no code of length n
can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and …

Consider a scenario where an l-bit secret has been distributed among n players by an
honest dealer using some secret sharing scheme. Then, if all players behave honestly, the …

We prove that a known general approach to improve Shamir's celebrated secret sharing
scheme; ie, adding an information-theoretic authentication tag to the secret, can make it …

In a (k, n) threshold secret image sharing scheme, a secret image is encrypted into n image-
shadows that satisfy the following:(1) any less than k image-shadows get no information on …

The security of communication or computational systems protected by traditional error
detecting codes rely on the assumption that the information bits of the message (output of …