Our results are based on new ''selective enforcement'' techniques. Here we first create a primitive called positional accumulators that allows for a small commitment to a much larger storage. The commitment is unconditionally sound for a select piece of the storage. This primitive serves as an ''iO-friendly'' tool that allows us to make two different programs equivalent at different stages of a proof. The pieces of storage that are selected depend on what hybrid stage we are at in a proof.
We first build up our enforcement ideas in a simpler context of ''message hiding encodings'' and work our way up to indistinguishability obfuscation.Category / Keywords: Date: received 10 Nov 2014, last revised 2 Dec 2014 Contact author: kvenkata at cs utexas edu, alewko@cs columbia edu, bwaters@cs utexas edu Available format(s): PDF | BibTeX Citation Version: 20141202:101344 (All versions of this report) Short URL: ia.cr/2014/925 Discussion forum: Show discussion | Start new discussion