The black-box group model over pseudo-free groups is a strong idealization. In particular, in a pseudo-free group, the group operation can be efficiently performed, while finding surprising relations between group elements is intractable. %inverses or linking between different representations of the same group element are infeasible. A black-box representation of the group provides an ideal interface which permits prescribed group operations, and nothing else. Still, the algebraic structure and security requirements appear natural and potentially realizable. They are also unrelated to the specific function to be obfuscated.
Our modeling should be compared with the recent breakthrough obfuscation scheme of Garg et al. [FOCS 2013]: While the high level structure is similar, some important details differ. It should be stressed however that, unlike Garg et al., we do not provide a candidate concrete instantiation of our abstract structure.Category / Keywords: secret-key cryptography / Obfuscation, generic group model, pseudo-free groups Date: received 14 Aug 2013 Contact author: canetti at bu edu Available format(s): PDF | BibTeX Citation Version: 20130815:072810 (All versions of this report) Short URL: ia.cr/2013/500 Discussion forum: Show discussion | Start new discussion