[PDF] Top 20 Non-Malleable Codes with Split-State Refresh

... computes K = Decode(X ) and outputs Sign K (m). In addition to this, occasionally the device will read up a part X i and write back X 0i = Refresh(X i ). The refreshing of the parts might also be done by separate ... See full document

... of non-malleable codes (NMCs), put forward by Dziembowski, Pietrzak, and Wichs ...a non-malleable encoding (Encode, Decode) allows to encode a value M into a code- word C ← Encode(M), ... See full document

... a non-malleable code; they consider the case where the class of tampering functions is restricted, and construct codes that are non-malleable with respect to these restricted tampering ... 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 split-state ... See full document

... “augmented non-malleability”. An augmented nonmalleable code is one that remains non- malleable even when the adversary, after specifying the tampering function, ad- ditionally obtains one of the ... See full document

... to state (but not prove), using only general randomness extractors or the inner product ...resulting non-malleable codes that we get using this reduction could be “efficient” not only in ... See full document

... Non-malleable codes were introduced by Dziembowski, Pietrzak, and Wichs [12] as a relaxation of the clas- sical notions of error-detection and ...is non-malleable if the decoding a ... See full document

... studied non-malleable code when the tampering function is allowed to tamper codeword as long as it does not decodes to a special symbol ...of non-malleable codes in the information ... See full document

... detection(AMD) codes, and, error correcting or detecting codes in ...call non-malleable secret ...on non-malleable codes in the split-state model led to ... See full document

... the split-state tampering function can find the unique R such that D(L, R) 6= ⊥ and then tamper based on m = D(L, ...(with non-uniform advice): Given a tuple L 0 1 , L 0 2 , R 0 such that D(L 0 1 , R ... See full document

... continuous non-malleable codes was first introduced in the work of Faust et ...of non-persistent tampering and ...the split-state model, where two halves of a codeword are ... See full document

... of non-malleable codes have remained elusive, except for some well structured tampering function ...the split-state model), an explicit encoding scheme for bits was proposed by ... See full document

... constructing non-malleable codes has received a lot of attention over recent ...As non-malleability against gen- eral functions is impossible [27], various subclasses of tampering functions ... See full document

... One possible approach to address physical attacks is to actively protect the implemen- tation of a scheme in a way that prevents the attacks or makes them too expensive to carry out, so that an algorithm hopefully does ... See full document

... local non-malleable code to tolerate many-time leak- age ...only refresh a part of the encoding, then the adversary over time can learn information about the various parts of the codeword (and hence ... See full document

... secret state K ...the split-state tampering and leak- age attacks considered by both papers, [25] do not assume that memory can be overwritten or erased, but require the storage of a tamper-proof ... See full document

... right state and then the left state) is only sent by Alice, Eve can gain additional advantage if she manages to fool Alice by getting responses from her, acting as ... See full document

... 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 ... See full document

... of non-malleable codes is in the setting of tamper-resilient computation (although non-malleable codes have also found connections in other areas of cryptography ... See full document

... that non-malleable codes can be useful in obtaining tamper-proof security as ...other state. State s might evolve over ...the state of the device is set to s 0 ← ...a ... See full document