Round Optimal Concurrent Non-malleability from Polynomial Hardness

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-319-70503-3_5 ◽

2017 ◽

pp. 139-171 ◽

Author(s):

Dakshita Khurana

Download Full-text