Foundations of Non-malleable Hash and One-Way Functions

Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryption E(m) of some unknown message m, it should be hard to transform this ciphertext into some encryption E(m∗ ) of a related message m∗ . This notion has been studied extensively for primitives like encryption, commitments and zeroknowledge. Non-malleability of one-way functions and hash functions has surfaced as a crucial property in several recent results, but it has not undergone a comprehensive treatment so far. In this paper we initiate the study of such non-malleable functions. We start with the design of an appropriate security definition. We then show that non-malleability for hash and one-way functions can be achieved, via a theoretical construction that uses perfectly one-way hash functions and simulation-sound non-interactive zero-knowledge proofs of knowledge (NIZKPoK). We also discuss the co...

• Type: Conference
• Year: 2009
• Where: ASIACRYPT
• Authors: Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi
• Keywords: ASIACRYPT 2009, Cryptology, Hash Functions, Non-malleable Functions, One-way Functions