Dakshita Khurana

Round Optimal Concurrent Non-Malleability from Polynomial Hardness.

2017 · IACR Cryptology ePrint Archive

Non-malleable commitments are a central cryptographic primitive that guarantee security against man-in-the-middle adversaries, and their exact round complexity has been a subject of great interest. Pass (TCC 2013, CC 2016) proved that non-malleable commitments with …