Paper 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.

Note: Changed paper title

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
circular securityLearning with Errors
Contact author(s)
kvenkata @ cs utexas edu
History
2016-05-19: last of 2 revisions
2016-02-11: received
See all versions
Short URL
https://ia.cr/2016/117
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/117,
      author = {Venkata Koppula and Brent Waters},
      title = {Circular Security Separations for Arbitrary Length Cycles from LWE},
      howpublished = {Cryptology ePrint Archive, Paper 2016/117},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/117}},
      url = {https://eprint.iacr.org/2016/117}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.