Michael Reichle

Orcid: 0000-0002-3498-5472

According to our database1, Michael Reichle authored at least 14 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
4
4
2
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Practical Blind Signatures in Pairing-Free Groups.
IACR Cryptol. ePrint Arch., 2024

Blind Signatures from Proofs of Inequality.
IACR Cryptol. ePrint Arch., 2024

Adaptively Secure 5 Round Threshold Signatures from MLWE/MSIS and DL with Rewinding.
IACR Cryptol. ePrint Arch., 2024

Tightly-Secure Blind Signatures in Pairing-Free Groups.
IACR Cryptol. ePrint Arch., 2024

2023
Constructions of Advanced Cryptographic Primitives. (Constructions de Primitives Cryptographiques Avancées).
PhD thesis, 2023

Hermes: I/O-Efficient Forward-Secure Searchable Symmetric Encryption.
IACR Cryptol. ePrint Arch., 2023

Practical Round-Optimal Blind Signatures in the ROM from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2023

Breaking Parallel ROS: Implication for Isogeny and Lattice-based Blind Signatures.
IACR Cryptol. ePrint Arch., 2023

Pairing-Free Blind Signatures from Standard Assumptions in the ROM.
IACR Cryptol. ePrint Arch., 2023

2022
Dynamic Local Searchable Symmetric Encryption.
IACR Cryptol. ePrint Arch., 2022

Sharp: Short Relaxed Range Proofs.
IACR Cryptol. ePrint Arch., 2022

2021
Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments.
IACR Cryptol. ePrint Arch., 2021

SSE and SSD: Page-Efficient Searchable Symmetric Encryption.
IACR Cryptol. ePrint Arch., 2021

2019
Non-Interactive Keyed-Verification Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2019


  Loading...