El Bansarkhani, Rachid and Buchmann, Johannes (2015):
High Performance Lattice-based CCA-secure Encryption.
In: Cryptology ePrint Archive, p. 20, [Article]
Abstract
Lattice-based encryption schemes still suffer from a low message throughput per ciphertext. This is mainly due to the fact that the underlying schemes do not tap the full potentials of LWE. Many constructions still follow the one-time-pad approach considering LWE instances as random vectors added to a message, most often encoded bit vectors. Recently, at Financial Crypto 2015 El Bansarkhani et al. proposed a novel encryption scheme based on the A-LWE assumption (Augmented LWE), where data is embedded into the error term without changing its target distributions. By this novelty it is possible to encrypt much more data as compared to the traditional one-time-pad approach and it is even possible to combine both concepts. In this paper we revisit this approach and propose amongst others several algebraic techniques in order to significantly improve the message throughput per ciphertext. Furthermore, we give a thorough security analysis as well as an efficient implementation of the CCA1-secure encryption scheme instantiated with the most efficient trapdoor construction. In particular, we attest that it even outperforms the CPA-secure encryption scheme from Lindner and Peikert presented at CT-RSA 2011.
| Item Type: | Article |
|---|---|
| Erschienen: | 2015 |
| Creators: | El Bansarkhani, Rachid and Buchmann, Johannes |
| Title: | High Performance Lattice-based CCA-secure Encryption |
| Language: | German |
| Abstract: | Lattice-based encryption schemes still suffer from a low message throughput per ciphertext. This is mainly due to the fact that the underlying schemes do not tap the full potentials of LWE. Many constructions still follow the one-time-pad approach considering LWE instances as random vectors added to a message, most often encoded bit vectors. Recently, at Financial Crypto 2015 El Bansarkhani et al. proposed a novel encryption scheme based on the A-LWE assumption (Augmented LWE), where data is embedded into the error term without changing its target distributions. By this novelty it is possible to encrypt much more data as compared to the traditional one-time-pad approach and it is even possible to combine both concepts. In this paper we revisit this approach and propose amongst others several algebraic techniques in order to significantly improve the message throughput per ciphertext. Furthermore, we give a thorough security analysis as well as an efficient implementation of the CCA1-secure encryption scheme instantiated with the most efficient trapdoor construction. In particular, we attest that it even outperforms the CPA-secure encryption scheme from Lindner and Peikert presented at CT-RSA 2011. |
| Journal or Publication Title: | Cryptology ePrint Archive |
| Uncontrolled Keywords: | Secure Data;Primitives;P1 |
| Divisions: | 20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres > CRC 1119: CROSSING – Cryptography-Based Security Solutions: Enabling Trust in New and Next Generation Computing Environments 20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra > Post-Quantum Cryptography Profile Areas > Cybersecurity (CYSEC) LOEWE > LOEWE-Zentren DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres 20 Department of Computer Science Profile Areas LOEWE DFG-Collaborative Research Centres (incl. Transregio) |
| Date Deposited: | 04 Aug 2016 15:08 |
| Identification Number: | TUD-CS-2015-0045 |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Send an inquiry |
Options (only for editors)
 |
View Item |
Drucken
Impressum