Non-interactive Non-malleability from Quantum Supremacy

We construct non-interactive non-malleable commitments without setup in the plain model, under well-studied assumptions. First, we construct non-interactive non-malleable commitments w.r.t. commitment for epsilon log log n tags for a small constant epsilon > 0, under the following assumptions: 1. Sub-exponential hardness of factoring or d...More