Permuted Puzzles and Cryptographic Hardness - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Elette Boyle' in GoogleThis author has not been identified. Look up 'Justin Holmgren' in GoogleThis author has not been identified. Look up 'Mor Weiss' in Google

runs on WebDSL