Abstract
In this work we separate private-key semantic security from 1-circular security for bit encryption using the Learning with Error assumption. Prior works used the less standard assumptions of multilinear maps or indistinguishability obfuscation. To achieve our results we develop new techniques for obliviously evaluating branching programs.
Cite
CITATION STYLE
Goyal, R., Koppula, V., & Waters, B. (2017). Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10211 LNCS, pp. 528–557). Springer Verlag. https://doi.org/10.1007/978-3-319-56614-6_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
