The results of this paper broadly expand the class of assumptions under which we can build 2-circular counterexamples. We first show for any constant k >= 2 how to build counterexamples from a bilinear group under the decision k-linear assumption. Recall that the decision k-linear assumption becomes progressively weaker as k becomes larger. This means that we can instantiate counterexamples from symmetric bilinear groups and shows that asymmetric groups do not have any inherently special property needed for this problem. We then show how to create 2-circular counterexamples from the Learning with Errors problem. This extends the reach of these systems beyond bilinear groups and obfuscation.
Category / Keywords: foundations / circular security, encryption, Decision Linear, Learning with Errors Original Publication (with major differences): IACR-ASIACRYPT-2015 Date: received 17 Jul 2015, last revised 5 Sep 2015 Contact author: susan at cs jhu edu Available format(s): PDF | BibTeX Citation Version: 20150905:214006 (All versions of this report) Short URL: ia.cr/2015/715 Discussion forum: Show discussion | Start new discussion