[PDF] Top 20 Block-wise Non-Malleable Codes

... prove non-malleability. Using this key-observation one can prove the non-malleability except in one case: when the index chosen by the adversary i 0 is equal to ...from non-malleable ... See full document

... using Non-malleable Extractors) and present a new technique to obtain privacy amplification from (augmented) Non-malleable ...a non-malleable code and sends it to ...of ... See full document

... a block of bits whose weight (number of positions with a 1) equals this ...each block randomly permuted, and also, ensure that a good fraction of the weights do not correspond to a valid block ... See full document

... of non-malleable coding in the split- state ...of non-malleable two-source extractors, generalizing the influential concept of non-malleable extractors introduced by Dodis and ... See full document

... efficient codes for circuits of size O(n c ) (where an efficient randomized procedure outputs a “good” code with high ...a non-tamperable component of the ...achieving non-malleability would become ... 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

... Non-malleable codes. Only a few constructions of continuously non-malleable codes are known (besides the already mentioned constructions of ...continuous non-malleability ... See full document

... of non-malleable message transmission, where the high- speed network switches routing the communication between parties shall forward their data packets at several gigabits per ...cannot block or ... See full document

... efficient codes, such that, with overwhelming probability, a random member of the family is non-malleable ...efficient non-malleable codes with some small non-uniform ... See full document

... the non-standard definition is appropriate in some settings, we argue that the standard definition is the right one in the context of non-malleable ...error-correcting codes in the literature ... See full document

... independent hashing for t proportional to log |F |. This gives information-theoretically secure NMC resilient to tampering classes which can be represented as poly-size circuits. While [FMVW14] construction allows ... See full document

... intuitive non-malleable code based approach: first encode a k-bit message using a non-malleable (k, n)-code to protect its integrity, obtaining an n-bit codeword c; then encrypt c ... See full document

... Necessity of Few Fixed Points. Secondly, we argue that the restriction on few fixed points is necessary. It is clear that the single identity function has all fixed-points (ϕ = 1) and full entropy (µ = n) but cannot be ... 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

... strong non-malleable code as long as E is (i) a pseudorandom permutation under leakage and (ii) related-key secure with respect to an arbitrary but fixed key ...“good” block ciphers, such as AES-128, ... See full document

... each block is tampered independently of the others — In a companion paper [AGM + 14b], we presented the first instance of an explicit non- malleable code against a class of ... See full document

... (AMD) codes, which is a special case of non-malleable codes against tamper- ing functions with a simple algebraic structure; explicit AMD codes with op- timal (second order) parameters ... See full document

... Our rate-0 construction is fairly natural, though its analysis turns out to be more complicated. At a high-level the construction combines an “outer code” which has a sufficiently large distance and dual distance (for ... See full document

... correcting codes were introduced by Katz and Trevisan (STOC 2000) when they explored the question of de- coding ...decodable codes are coding schemes which have an additional “local decode” procedure: in ... See full document

... the full memory is refreshed. An adversary could perform the following tampering attack. In case the i-th bit of the attacked codeword is equal to 1, the i-th location of the memory is corrupted (i.e., it is replaced ... See full document