Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption.

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.