Lennart Braun

Orcid: 0000-0001-9164-305X

According to our database1, Lennart Braun authored at least 15 papers between 2021 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs.
Proceedings of the Advances in Cryptology - EUROCRYPT 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
Malicious Security for Sparse Private Histograms.
IACR Cryptol. ePrint Arch., 2024

An Improved Threshold Homomorphic Cryptosystem Based on Class Groups.
IACR Cryptol. ePrint Arch., 2024

2023
Ramen: Souper Fast Three-Party Computation for RAM Programs.
IACR Cryptol. ePrint Arch., 2023

FUSE - Flexible File Format and Intermediate Representation for Secure Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2023

ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for ℤ<sub>2<sup>k</sup></sub>.
IACR Cryptol. ePrint Arch., 2023

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

ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for $\mathbb {Z}_{2^k}$.
Proceedings of the Cryptography and Coding - 19th IMA International Conference, 2023

2022
MOTION - A Framework for Mixed-Protocol Multi-Party Computation.
ACM Trans. Priv. Secur., 2022

Secure Multiparty Computation from Threshold Encryption based on Class Groups.
IACR Cryptol. ePrint Arch., 2022

Mozℤ<sub>2<sup>k</sup></sub>arella: Efficient Vector-OLE and Zero-Knowledge Proofs Over ℤ<sub>2<sup>k</sup></sub>.
IACR Cryptol. ePrint Arch., 2022

Moz$\mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $\mathbb {Z}_{2^k}$.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and ℤ<sub>2<sup>k</sup></sub>.
IACR Cryptol. ePrint Arch., 2021

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021


  Loading...