[PDF] Top 20 A constant-rate non-malleable code in the split-state model.

... first non-malleable code in the split-state model against an information-theoretic adversary was constructed in [DKO13], who constructed a non- malleable ... See full document

... a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely “unrelated ...(2-part) split-state model: here the message ... See full document

... - non-malleable code for single-bit messages in the split-state model. Our proof is elementary, requiring a little more than two (fullsize) pages to prove, having at its heart ... See full document

... of non-malleable coding in the split-state model equals 1/2, as established in our recent work ...efficient non-malleable codes of rate approaching 1/2 in the ... See full document

... on non-malleable codes in the information theoretic ...on non-malleable codes, and it is beyond the scope of this paper to provide a comprehensive survey of ...called split-state ... See full document

... seeded non-malleable extractors, privacy ampli- fication protocols with an active adversary, independent source extractors (and explicit Ramsey graphs), and non-malleable codes in the ... See full document

... continuously non-malleable codes in the constant split-state ...Wichs. Non-malleable ...Continuous non-malleable ... See full document

... of split-state tampering attempts, without requiring a self-destruct capability, and in a model where re- freshing of the memory happens only after an invalid output is ... See full document

... a constant is O ((m + sµ + log(log n/ε)) log ...a rate > 0 non-malleable secret sharing scheme for threshold t = 2 would imply a 2-split-state non-malleable ... See full document

... the split-state model that is a super- strong non-malleable code is also a persistent continuous non-malleable code with self-destruct in the ... See full document

... Continuous Non-Malleable Codes Continuous Non-Malleable codes (CNMC) were introduced by Faust ...and non-interactive zero knowledge proof systems in the CRS ...2-split ... See full document

... for rate-1 non-malleable codes for very broad classes of tampering functions [CG14a, FMNV14], explicit constructions have turned out to be much harder, in such ...explicit rate-1 construction ... See full document

... call non-malleable secret ...on non-malleable codes in the split-state model led to constructions which can be seen as 2-out-of-2 non-malleable secret ... See full document

... the split-state set- ting in which the tampering function tampers with each state independently, and thus the states need to be physically ... See full document

... the model where the manufacturer has a public key and signs the secret key of the ...a non-malleable code; they consider the case where the class of tampering functions is restricted, and ... See full document

... continuously non-malleable codes are known (besides the already mentioned constructions of ...continuous non-malleability is known to be achievable in the information- theoretic setting, for the ... See full document

... correcting code guarantees that the encoded message is always correctly ...the code can tolerate only limited attacks, e.g., that some small constant fraction of the codeword is tampered ...detecting ... See full document

... poor rate (potentially rate 0), non-malleable code into a rate-1 computational non- malleable ...underlying code to have a stronger form of ... See full document

... exist non-malleable codes in the 2-split state ...of non-malleable codes computationally secure in the 2-split state ...theoretically non-malleable ... See full document

... of rate arbitrarily close to 1 − α which is non-malleable ...a rate close to (1 − α)/3 using a delicate Martingale ...the rate can be made arbitrarily close to ...known rate 3 ... See full document