Nils Fleischhacker

Orcid: 0000-0002-2770-5444

Affiliations:
  • Ruhr University Bochum, Germany
  • Carnegie Mellon University, Pittsburgh, PA, USA
  • Johns Hopkins University, Baltimore, MD, USA
  • Saarland University, CISPA, Saarbrücken, Germany


According to our database1, Nils Fleischhacker authored at least 30 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Extractable Witness Encryption for KZG Commitments and Efficient Laconic OT.
IACR Cryptol. ePrint Arch., 2024

2023
Compressing Encrypted Data Over Small Fields.
IACR Cryptol. ePrint Arch., 2023

Invertible Bloom Lookup Tables with Less Memory and Randomness.
IACR Cryptol. ePrint Arch., 2023

Chipmunk: Better Synchronized Multi-Signatures from Lattices.
IACR Cryptol. ePrint Arch., 2023

Jackpot: Non-Interactive Aggregatable Lotteries.
IACR Cryptol. ePrint Arch., 2023

2022
Squirrel: Efficient Synchronized Multi-Signatures from Lattices.
IACR Cryptol. ePrint Arch., 2022

How to Compress Encrypted Data.
IACR Cryptol. ePrint Arch., 2022

Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting.
IACR Cryptol. ePrint Arch., 2022

Steganography-Free Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2022

Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Property-Preserving Hash Functions from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2021

On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments.
IACR Cryptol. ePrint Arch., 2021

2020
Feasibility and Infeasibility of Secure Computation with Malicious PUFs.
J. Cryptol., 2020

Robust Property-Preserving Hash Functions for Hamming Distance and More.
IACR Cryptol. ePrint Arch., 2020

2019
On Tight Security Proofs for Schnorr Signatures.
J. Cryptol., 2019

Arithmetic Garbling from Bilinear Maps.
IACR Cryptol. ePrint Arch., 2019

Interactive Non-malleable Codes.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

2018
Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys.
IET Inf. Secur., 2018

On the Existence of Three Round Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2018

2017
Minimal assumptions in cryptography.
PhD thesis, 2017

Two-Message, Oblivious Evaluation of Cryptographic Functionalities.
IACR Cryptol. ePrint Arch., 2017

2016
On Statistically Secure Obfuscation with Approximate Correctness.
IACR Cryptol. ePrint Arch., 2016

Efficient Cryptographic Password Hardening Services from Partially Oblivious Commitments.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Efficient Unlinkable Sanitizable Signatures from Signatures with Rerandomizable Keys.
IACR Cryptol. ePrint Arch., 2015

2014
A Modular Framework for Multi-Factor Authentication and Key Exchange.
Proceedings of the Security Standardisation Research - First International Conference, 2014

2013
Unconditional Tightness Bounds for Generic Reductions: The Exact Security of Schnorr Signatures, Revisited.
IACR Cryptol. ePrint Arch., 2013

Limitations of the Meta-Reduction Technique: The Case of Schnorr Signatures.
IACR Cryptol. ePrint Arch., 2013

2012
Modular Design and Analysis Framework for Multi-Factor Authentication and Key Exchange.
IACR Cryptol. ePrint Arch., 2012

2011
Pseudorandom Signatures.
IACR Cryptol. ePrint Arch., 2011

SDF - Solar-aware distributed flow in wireless sensor networks.
Proceedings of the IEEE 36th Conference on Local Computer Networks, 2011


  Loading...