Dakshita Khurana. Round Optimal Concurrent Non-malleability from Polynomial Hardness. In Yael Kalai, Leonid Reyzin, editors, Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II. Volume 10678 of Lecture Notes in Computer Science, pages 139-171, Springer, 2017. [doi]
@inproceedings{Khurana17-0,
title = {Round Optimal Concurrent Non-malleability from Polynomial Hardness},
author = {Dakshita Khurana},
year = {2017},
doi = {10.1007/978-3-319-70503-3_5},
url = {https://doi.org/10.1007/978-3-319-70503-3_5},
researchr = {https://researchr.org/publication/Khurana17-0},
cites = {0},
citedby = {0},
pages = {139-171},
booktitle = {Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II},
editor = {Yael Kalai and Leonid Reyzin},
volume = {10678},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-70503-3},
}