[PDF] Top 20 Textbook Non-Malleable Commitments

... with non-negligible ...with non-negligible ...conditionally non-malleable. Extension to non-synchronizing ...others, non-malleability against arbitrary schedulings is ... See full document

... inherently non-uniform (the adversary in the proof is so limited that it does not have time to generate new commitments on its own and therefore must receive them as non-uniform advice when reducing ... See full document

... its commitments to the oracle in parallel and there is an a-priori known bound on how many such bit-commitments are sent to O (all in ...or non-standard assumptions ... See full document

... of non-malleable codes is in tamper-resilient cryptography [DPW18], where they can be used generally to prevent an adversary from learning secret information by observing the input/output behavior of ... See full document

... mitment scheme that is computationally hiding against such sub-exponential adversary (and this primitive can be constructed from the above assumption). The key technical challenge, as remarked earlier, is that BNMC is ... See full document

... x. Non-malleable codes in the split-state model have received a lot of attention so far [DPW10, LL12, DKO13, ADL14, CG14a, CG14b, Agg15, CGL16, Li17, ...of non-malleable codes in the ... See full document

... of non-malleable codes was defined by Dziembowski, Pietrzak and Wichs [23] as a relaxation of error-correcting ...is non-malleable against a tampering function if by tampering with the ... See full document

... of non-malleable ...a non-malleable code, and then committing each bit individually – would yield a non-malleable string commitment scheme in the standard ...simple ... See full document

... is malleable; hence, we can instantiate our construction based on standard cryptographic as- sumptions, such as the existence of one-to-one one-way functions (which imply standard perfectly binding and ... See full document

... 4-tag non-malleable commitments ...construct non-malleable commitments for constant number of ...stand-alone non-malleable commitments without time-lock ... See full document

... for commitments and the Cramer-Shoup smooth projective hash functions (SPHFs), following the Gennaro-Lindell approach for ...of non-interactive commitments, with a new formalism that implies UC ... See full document

... and non-black-box use of a primitive in the implementation of a natural cryptographic ...and non-black-box proofs of security, and in this work all proofs of security are ...NP. Non-interactive ... 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

... It remains to construct a non-malleable code (with secret state) resilient against parallel tampering. The intuition behind our construction is the following: If a code has the property (as has been the ... See full document

... For non-malleable extractors the parameters achievable by current constructions are weaker. Dodis and Wichs [DW09] showed the existence of (k, ε)-non-malleable extractors with seed length d = ... See full document

... BDKM16 Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, and Tal Malkin. Non-malleable codes for bounded depth, bounded fan-in circuits. In Marc Fischlin and Jean-Sébastien Coron, editors, Advances in ... See full document

... is Non-malleable codes, which were introduced in the work of Dziembowski, Pietrzak and Wichs ...any non-malleable cod- ing scheme is its rate (= codeword length message length ...building ... See full document

... of non-malleable codes against tamper- ing functions with a simple algebraic structure; explicit AMD codes with op- timal (second order) parameters have been recently provided by ...of ... See full document

... that, non-malleable extractors and two- source extractors, although seemingly different, are closely ...construct non-malleable extractors for small ...construct non-malleable ... See full document

... 37], non-interactive zero- knowledge (NIZK) proofs [22,28,30,37], and `-more extractable collision resistant hashes (ECRH) [36], where others use KEM/DEM techniques [1, ...that non-malleability falls apart ... See full document