[PDF] Top 20 Non-malleable Reductions and Applications

... Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs [DPW10], provide a useful message integrity guarantee in situations where traditional error-correction (and even error-detection) is ... See full document

... is non-malleable with respect to the set of manipulation functions that the adversary is able to induce by ...other applications of non-malleable ...the non-malleable ... See full document

... to non-malleable commitments, as one of the first direct applications of non-malleable codes to computational ...that non- malleable string commitments can be “entirely ... See full document

... of non-malleability was introduced by Dolev, Dwork and Naor [DDN00], and has found many applications in ...tionally, non-malleability is defined in the computational setting, but recently ... See full document

... our non-interactive solution, his solution is based on an interactive protocol 3 wherein all mixing authorities must jointly generate a proof with size independent of `; in comparison, our solution allows ... See full document

... with non-negligible ...with non-negligible ...conditionally non-malleable. Extension to non-synchronizing ...some applications, security against synchronizing ad- versaries is ... See full document

... any non-malleable code in the 2-split-state model gives a 2 out of 2 secret sharing scheme, if one views the two split states as two shares ...any non-malleable code in the interleaved 2-split ... See full document

... (NMC). Non-malleable codes were introduced by Dziembowski, Pietrzak and Wichs [36] as a relaxation of error-correcting codes, and are useful in settings where privacy—but not necessarily correctness—is ... See full document

... seeded non-malleable extractor defined ...seeded non-malleable extractors. Furthermore, non-malleable extractors exist when k > 2m + 2 log(1/ε) + log d + 6 and d > log(n − ... See full document

... cryptographic applications where an adversary only gets to tamper a high- speed data stream on the fly based on her view so far, namely, the lookahead tampering ...of non-malleable codes that provide ... 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 sharing ...of ... See full document

... is non-malleability under chosen-plaintext attacks (NM-CPA), originally introduced by Dolev et ...a non-adaptive decryption oracle, meaning that the adversary can only ask one “parallel” decryption ... See full document

... envisioned applications, and therefore we view our results as providing qualitatively similar (but not equivalent) security guarantees to those studied in the context of RKA ... See full document

... DNO17. Nico D¨ ottling, Jesper Buus Nielsen, and Maciej Obremski. Information the- oretic continuously non-malleable codes in the constant split-state model. Electronic Colloquium on Computational ... See full document

... updatable/decodable non-malleable ...construct non-malleable codes that can be locally decoded and ...updatable/decodable non-malleable codes. Combining local decodability with ... See full document

... using non-malleable codes – instead of storing the secret (in the clear) on a device, one instead stores an encoding of the ...the non-malleable code guarantees that the adversary cannot learn ... See full document

... between non-malleability and one-wayness in depth. In non-adaptive setting, we show that for any achievable transformation class, non-malleability implies one-wayness for poly-to-one functions but ... See full document

... public key pk = PK(sk), an encryption c = Enc(pk, m) of the encoded message and a simulation-sound NIZK proof of knowledge π of some sk such that pk = PK(sk ) using c as a label. Decoding will check the proof and if it ... See full document

... single-bit non-malleable codes (our proof being approximately one-third the length of the proof of security of the single-bit non-malleable code of [DKO13]) and answer in the negative the ... See full document

... a non-malleable bit commitment scheme, in that if Bob plays a man-in-the-middle adversary, and wants to send a commitment to Carol, he can can only send the token from Alice as it is, or create a new token ... See full document