Cryptology ePrint Archive: Report 2016/117

Circular Security Separations for Arbitrary Length Cycles from LWE

Venkata Koppula and Brent Waters

Abstract: We describe a public key encryption that is IND-CPA secure under the Learning with Errors (LWE) assumption, but that is not circular secure for arbitrary length cycles. Previous separation results for cycle length greater than 2 require the use of indistinguishability obfuscation, which is not currently realizable under standard assumptions.

Category / Keywords: circular security, Learning with Errors

Date: received 10 Feb 2016, last revised 19 May 2016

Contact author: kvenkata at cs utexas edu

Available format(s): PDF | BibTeX Citation

Note: Changed paper title

Version: 20160519:203241 (All versions of this report)

Short URL: ia.cr/2016/117

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]