Black-Box Non-Interactive Non-Malleable Commitments.

Rachit Garg, Dakshita Khurana, George Lu, Brent R. Waters · IACR Cryptology ePrint Archive · 2020

There has been recent exciting progress on building non-interactive non-malleable commitments from judicious assumptions. All proposed approaches proceed in two steps. First, obtain simple “base” commitment schemes for very small tag/identity spaces based on a various sub-exponential hardness assumptions. Next, assuming sub-exponential non-interactive witness indistinguishable proofs (NIWIs), and variants of keyless collision resistant hash functions, construct non-interactive compilers that convert tag-based non-malleable commitments for a small tag space into tag-based non-malleable commitments for a larger tag space.

Read the paper · More papers on PaperTik