Yuan Kang, Chengyu Lin, Tal Malkin, Mariana Raykova 0001. Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation. In Dario Catalano, Roberto De Prisco, editors, Security and Cryptography for Networks - 11th International Conference, SCN 2018, Amalfi, Italy, September 5-7, 2018, Proceedings. Volume 11035 of Lecture Notes in Computer Science, pages 407-424, Springer, 2018. [doi]
@inproceedings{KangLM018,
title = {Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation},
author = {Yuan Kang and Chengyu Lin and Tal Malkin and Mariana Raykova 0001},
year = {2018},
doi = {10.1007/978-3-319-98113-0_22},
url = {https://doi.org/10.1007/978-3-319-98113-0_22},
researchr = {https://researchr.org/publication/KangLM018},
cites = {0},
citedby = {0},
pages = {407-424},
booktitle = {Security and Cryptography for Networks - 11th International Conference, SCN 2018, Amalfi, Italy, September 5-7, 2018, Proceedings},
editor = {Dario Catalano and Roberto De Prisco},
volume = {11035},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-98113-0},
}