TU Darmstadt / ULB / TUbiblio

High Performance Lattice-based CCA-secure Encryption

El Bansarkhani, Rachid ; Buchmann, Johannes :
High Performance Lattice-based CCA-secure Encryption.
In: Cryptology ePrint Archive S. 20.
[Artikel] , (2015)

Kurzbeschreibung (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.

Typ des Eintrags: Artikel
Erschienen: 2015
Autor(en): El Bansarkhani, Rachid ; Buchmann, Johannes
Titel: High Performance Lattice-based CCA-secure Encryption
Sprache: Deutsch
Kurzbeschreibung (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.

Titel der Zeitschrift, Zeitung oder Schriftenreihe: Cryptology ePrint Archive
Freie Schlagworte: Secure Data;Primitives;P1
Fachbereich(e)/-gebiet(e): 20 Fachbereich Informatik > Theoretische Informatik - Kryptographie und Computeralgebra
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1119: CROSSING – Kryptographiebasierte Sicherheitslösungen als Grundlage für Vertrauen in heutigen und zukünftigen IT-Systemen
20 Fachbereich Informatik > Theoretische Informatik - Kryptographie und Computeralgebra > Post-Quantum Kryptographie
Profilbereiche > Cybersicherheit (CYSEC)
LOEWE > LOEWE-Zentren
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche
20 Fachbereich Informatik
Profilbereiche
LOEWE
DFG-Sonderforschungsbereiche (inkl. Transregio)
Hinterlegungsdatum: 04 Aug 2016 15:08
ID-Nummer: TUD-CS-2015-0045
Export:

Optionen (nur für Redakteure)

Eintrag anzeigen Eintrag anzeigen