The following pages link to Nils Fleischhacker (Q1653069):
Displaying 15 items.
- On the existence of three round zero-knowledge proofs (Q1653072) (← links)
- Robust property-preserving hash functions for Hamming distance and more (Q2056796) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- Arithmetic garbling from bilinear maps (Q2167776) (← links)
- Property-preserving hash functions for Hamming distance from standard assumptions (Q2170070) (← links)
- Feasibility and infeasibility of secure computation with malicious PUFs (Q2175217) (← links)
- Interactive non-malleable codes (Q2175939) (← links)
- On tight security proofs for Schnorr signatures (Q2423848) (← links)
- Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys (Q2798781) (← links)
- On Statistically Secure Obfuscation with Approximate Correctness (Q2829230) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- Feasibility and Infeasibility of Secure Computation with Malicious PUFs (Q2874550) (← links)
- On Tight Security Proofs for Schnorr Signatures (Q2938862) (← links)
- Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures (Q4924426) (← links)
- Interactive non-malleable codes against desynchronizing attacks in the multi-party setting (Q6642388) (← links)
