Michael Klooß

Orcid: 0000-0003-3466-0675

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

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

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

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

On Efficient Zero-Knowledge Arguments.
PhD thesis, 2023

Universally Composable Auditable Surveillance.
IACR Cryptol. ePrint Arch., 2023

Composable Long-Term Security with Rewinding.
IACR Cryptol. ePrint Arch., 2023

Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head.
IACR Cryptol. ePrint Arch., 2023

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

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

2021
Black-Box Accumulation Based on Lattices.
IACR Cryptol. ePrint Arch., 2021

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

Fiat-Shamir Transformation of Multi-Round Interactive Proofs.
IACR Cryptol. ePrint Arch., 2021

2020
Black-Box Wallets: Fast Anonymous Two-Way Payments for Constrained Devices.
Proc. Priv. Enhancing Technol., 2020

On (expected polynomial) runtime in cryptography.
IACR Cryptol. ePrint Arch., 2020

2019
(R)CCA Secure Updatable Encryption with Integrity Protection.
IACR Cryptol. ePrint Arch., 2019

Efficient zero-knowledge arguments in the discrete log setting, revisited.
IACR Cryptol. ePrint Arch., 2019

2017
New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs.
IACR Cryptol. ePrint Arch., 2017


  Loading...