Michael Klooß

Orcid: 0000-0003-3466-0675

According to our database1, Michael Klooß authored at least 27 papers between 2017 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Blind Signatures from Arguments of Inequality.
IACR Cryptol. ePrint Arch., 2025

RoK and Roll - Verifier-Efficient Random Projection for Õ(λ)-size Lattice Arguments.
IACR Cryptol. ePrint Arch., 2025

Threshold Public-Key Encryption: Definitions, Relations and Constructions.
IACR Cryptol. ePrint Arch., 2025

Lattice-Based Proof-Friendly Signatures from Vanishing Short Integer Solutions.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

Blind Signatures from Proofs of Inequality.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
EROR: Efficient Repliable Onion Routing with Strong Provable Privacy.
IACR Cryptol. ePrint Arch., 2024

RoK, Paper, SISsors - Toolkit for Lattice-based Succinct Arguments.
IACR Cryptol. ePrint Arch., 2024

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

Adaptive Special Soundness: Improved Knowledge Extraction by Adaptive Useful Challenge Sampling.
IACR Cryptol. ePrint Arch., 2024

Practical Blind Signatures in Pairing-Free Groups.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

RoK, Paper, SISsors Toolkit for Lattice-Based Succinct Arguments - (Extended Abstract).
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
Fiat-Shamir Transformation of Multi-Round Interactive Proofs (Extended Version).
J. Cryptol., October, 2023

On Efficient Zero-Knowledge Arguments.
PhD thesis, 2023

The Fiat-Shamir Transformation of (Γ<sub>1,đots,Γ<sub>μ)</sub></sub>-Special-Sound Interactive Proofs.
IACR Cryptol. ePrint Arch., 2023

Composable Long-Term Security with Rewinding.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Universally Composable Auditable Surveillance.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Fiat-Shamir Transformation of Multi-round Interactive Proofs.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Sharp: Short Relaxed Range Proofs.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
On Expected Polynomial Runtime in Cryptography.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Black-Box Accumulation Based on Lattices.
Proceedings of the Cryptography and Coding - 18th IMA International Conference, 2021

Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2019
Black-Box Wallets: Fast Anonymous Two-Way Payments for Constrained Devices.
IACR Cryptol. ePrint Arch., 2019

(R)CCA Secure Updatable Encryption with Integrity Protection.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Efficient Zero-Knowledge Arguments in the Discrete Log Setting, Revisited.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2017
New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017


  Loading...