Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fast Cryptographic Primitives and Circular-Secure Encryption
 

Summary: Fast Cryptographic Primitives and
Circular-Secure Encryption
Based on Hard Learning Problems
Benny Applebaum , David Cash, Chris Peikert , and Amit Sahai
1
Princeton University
2
Georgia Institute of Technology
3
SRI International
4
UCLA
Abstract. The well-studied task of learning a linear function with er-
rors 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:
1. Public-key and symmetric-key cryptosystems that provide security
for key-dependent messages and enjoy circular security. Our schemes
are highly efficient: in both cases the ciphertext is only a constant
factor larger than the plaintext, and the cost of encryption and de-

  

Source: Applebaum, Benny - Faculty of Mathematics and Computer Science, Weizmann Institute of Science

 

Collections: Computer Technologies and Information Sciences