Obfuscation from polynomial hardness: beyond decomposable obfuscation

DOI10.1007/978-3-319-98113-0_22OpenAlexW2886478548MaRDI QIDQ1796809

Yuan Kang, Mariana Raykova, Tal Malkin, Cheng-yu Lin

Publication date: 17 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-98113-0_22

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

This page was built for publication: Obfuscation from polynomial hardness: beyond decomposable obfuscation