IACR News item: 11 February 2016
Venkata Koppula, Brent Waters
ePrint Report
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.
Additional news items may be found on the IACR news page.