[PDF] Top 20 Explicit Non-Malleable Codes Resistant to Permutations

... 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

... also resistant to permutations: each character in the outer code’s alphabet is mapped to a positive integer (in a certain range) and is encoded by a block of bits whose weight (number of positions with a 1) ... 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 ...and explicit construction of non-malleable ... See full document

... Continuous Non-Malleable Codes Continuous Non-Malleable codes (CNMC) were introduced by Faust ...collision resistant hash functions and non-interactive zero ... See full document

... In this work, we considered the simplest construction of an NMC from a block cipher E , and we characterized its security by means of formulating and proving sufficient security conditions on E. Since these require some ... 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 ...relevant ... See full document

... any non-trivial non-malleable code for larger depth circuits would yield a separation of NC 1 from ...take non-trivial to mean that error is bounded away from 1 and encoding/decoding run in ... See full document

... for explicit split-state non-malleable codes have required complex mathematical proofs, and all known such proofs either directly or indirectly used the mathematics behind constructions of ... See full document

... the codes of [30,28], but unfortunately these constructions rely on both trusted setup and strong computational as- ...such codes require: (i) a “common reference string”, ...of non-interactive zero- ... See full document

... “seeded Non-malleable extractors (NME)”, which has the property that the output of the extractor looks uniform, even given its value on a related ...a non-interactive one-time message authentication ... 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 ... See full document

... an explicit non-malleable code for encoding a single bit was proposed by ...an explicit scheme (of rate 0) was proposed for arbitrary length messages by ...such codes can in fact be ... 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

... efficient codes for circuits of size O(n c ) (where an efficient randomized procedure outputs a “good” code with high ...is explicit, but relies on a model including an untamparable CRS (common reference ... See full document

... a non- malleable code, one could hope that the over all code is ...involving permutations (but not allowing the adversary to set/reset the ... 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

... of non-malleability, called Medium Non-malleability, which informally gives security guarantees “in-between” strong and regular ...strong non-malleability can be viewed as a special case of medium ... See full document

... Goppa codes to better balance the security and public key size ...Goppa codes [29, 7] or more generally, codes with a nontrivial automorphism group ...their permutations induced by G form the ... See full document

... The motivation to study a non-malleable extractor, the privacy amplification problem, is a fun- damental problem in symmetric cryptography that has been studied by many researchers. Bennett, Brassard, and ... See full document

... of non- malleable codes for doubly-exponential sized function ...inefficient non-malleable code ...such codes can achieve a rate close to 1, even for “small” function ... See full document