Primitives

Cryptography-based security solutions heavily rely on cryptographic primitives such as encryption and signature schemes. However, existing primitives are threatened by attacks which are made possible by new computing architectures and algorithms. Also, new cryptographic solutions require efficient primitives with new functionalities such as fully homomorphic encryption. Thus, the goal of this project area is the development of the required cryptographic primitives. They must be efficient in present and future computing environments, and must resist novel attacks due to new hardware platforms and algorithmic advances.

P1 - Future Public Key Encryption and Signature Schemes

The goal of the project is to provide practical and secure lattice-based public-key encryption and signature schemes secure against quantum adversaries and providing advanced functionality such as fully homomorphism. It will (1) assess the hardness of certain lattice problems on current and forthcoming parallel architectures and (2) design, study and optimize provably secure lattice-based schemes that are appropriate for new and next-generation computing environments.

Researchers

Nina Bindel

Kryptographie und Computeralgebra

Interests:

  • Lattice-based cryptography, in particular lattice-based signatures.
  • Provable security
 

Nabil Alkeilani Alkadri

Kryptographie und Computeralgebra

Interests:

  • Lattice-based public-key cryptography
  • Designing and improving lattice-based schemes

 Dr. Rachid El Bansarkhani

Kryptographie und Computeralgebra

Interests:

  • Post-Quantum, Lattice-based and Code-based Cryptography.
  • Sensor Networks.
  • Stochastic Analysis & Stochastic Differential Equations
 

Dr. Florian Göpfert

Kryptographie und Computeralgebra

Interests:

  • Lattice-based public-key encryption.
  • Cryptanalysis of lattices.
  • Optimized parameter selection for lattice-based schemes

Dr. Juliane Krämer

Kryptographie und Computeralgebra

Interests:

  • Post-quantum cryptography, especially lattice-based cryptography
  • Fault Attacks
  • Side Channel Attacks.

Thomas Wunderer

Kryptographie und Computeralgebra

Interests:

  • Lattice-Based Cryptography.
  • Hardness of Lattice Problems.

Dr. Artur Mariano

Scientific Computing

Interests:

  • High performance low TDP Computing.
  • (Accelerated) parallel computing.
  • Performance modeling of parallel hardware.

CROSSING Publications P1

Additional Attributes

Type

Revisiting the Expected Cost of Solving uSVP and Applications to LWE

Martin Albrecht, Florian Göpfert, Fernando Vidria, Thomas Wunderer
In: ASIACRYPT 2017 - Advances in Cryptology, December 2017
Springer
[Online-Edition: https://asiacrypt.iacr.org/2017/]
[Inproceedings]

Recovering Short Generators of Principal Fractional Ideals in Cyclotomic Fields of Conductor p^α q^β

Johannes Buchmann, Patrick Holzer, Thomas Wunderer
In: INDOCRYPT 2017 - 18th International Conference on Cryptology in India, December 2017
Springer
[Online-Edition: events.csa.iisc.ernet.in/indocrypt2017/]
[Inproceedings]

CogniCrypt: Supporting Developers in using Cryptography

Stefan Krüger, Sarah Nadi, Michael Reif, Karim Ali, Mira Mezini, Eric Bodden, Florian Göpfert, Felix Günther, Christian Weinert, Daniel Demmler, Ram Kamath
In: Automated Software Engineering (ASE'17), November 2017
ACM
[Inproceedings]

Bounding the cache-side-channel leakage of lattice-based signature schemes using program semantics

Nina Bindel, Johannes Buchmann, Juliane Krämer, Heiko Mantel, Johannes Schickel, Alexandra Weber
In: The 10th International Symposium on Foundations & Practice of Security, October 2017
Springer
[Online-Edition: fps2017.loria.fr/]
[Inproceedings]

Countermeasures Against First Order Fault Attacks Using the Example of ring-TESLA

Johannes Schreiber
October 2017
[Thesis (Master, Bachelor, Diploma)]

Hampering fault attacks against lattice-based signature schemes - countermeasures and their efficiency

Nina Bindel, Juliane Krämer, Johannes Schreiber
In: CODES/ISSS ’17 Companion, October 2017
Springer
[Online-Edition: www.esweek.org]
[Inproceedings]

The Day the Cryptography Dies

John Mulholland, Michele Mosca, Johannes Braun
In: IEEE Security & Privacy, Vol. 15, p. 14-21, August 2017
[Article]

Postquantum Cryptography - State of the Art

Johannes Buchmann, Kristin Lauter, Michele Mosca
In: IEEE Security & Privacy, Vol. 15, p. 12-13, August 2017
[Article]

Solving Learning With Errors Instances Using Quantum Reductions

Sebastian Bugge
July 2017
[Thesis (Master, Bachelor, Diploma)]

A Framework to Select Parameters for Lattice-Based Cryptography

Nabil Alkeilani Alkadri, Johannes Buchmann, Rachid El Bansarkhani, Juliane Krämer
June 2017
[Misc]

SFB 1119 - Contact


Contact P1

Johannes Buchmann
TU Darmstadt
Fachbereich Informatik
Theoretische Informatik - Kryptographie und Computeralgebra
Hochschulstraße 10
64289 Darmstadt

Christian Bischof   
TU Darmstadt
Fachbereich Informatik
Scientific Computing
Mornewegstr. 30
64283 Darmstadt

 

Funded by

A A A | Drucken Print | Impressum Impressum | Sitemap Sitemap | Kontakt Contact | Website Analysis: More Information
zum Seitenanfangzum Seitenanfang