Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applications that enjoy strong security properties and a high level of efficiency. Namely, we construct:

• Type: Conference
• Year: 2009
• Where: CRYPTO
• Authors: Benny Applebaum, David Cash, Chris Peikert, Amit Sahai
• Keywords: CRYPTO 2009, Cryptographic Schemes, Cryptology, Strong Security Properties, Well-studied Task