Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Yuan Kang' in GoogleThis author has not been identified. Look up 'Chengyu Lin' in GoogleThis author has not been identified. Look up 'Tal Malkin' in GoogleThis author has not been identified. Look up 'Mariana Raykova 0001' in Google

runs on WebDSL