Elette Boyle, Justin Holmgren, Mor Weiss. Permuted Puzzles and Cryptographic Hardness. In Dennis Hofheinz, Alon Rosen, editors, Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II. Volume 11892 of Lecture Notes in Computer Science, pages 465-493, Springer, 2019. [doi]
@inproceedings{BoyleHW19-0,
title = {Permuted Puzzles and Cryptographic Hardness},
author = {Elette Boyle and Justin Holmgren and Mor Weiss},
year = {2019},
doi = {10.1007/978-3-030-36033-7_18},
url = {https://doi.org/10.1007/978-3-030-36033-7_18},
researchr = {https://researchr.org/publication/BoyleHW19-0},
cites = {0},
citedby = {0},
pages = {465-493},
booktitle = {Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II},
editor = {Dennis Hofheinz and Alon Rosen},
volume = {11892},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-36033-7},
}