Constructing Secure Multi-Party Computation with Identifiable Abort. - Nicholas-Philip Brandt; Sven Maier; Tobias Müller 005; Jörn Müller-Quade (IACR Cryptol. ePrint Arch., 2020)

Tight Setup Bounds for Identifiable Abort. - Nicholas Brandt (IACR Cryptol. ePrint Arch., 2021)

The Price of Verifiability: Lower Bounds for Verifiable Random Functions. - Nicholas Brandt; Dennis Hofheinz; Julia Kastner; Akin Ünal (IACR Cryptol. ePrint Arch., 2022)

On the Correlation Complexity of MPC with Cheater Identification. - Nicholas Brandt; Sven Maier; Tobias Müller 005; Jörn Müller-Quade (FC (1), 2023)

Lower Bounds for Levin-Kolmogorov Complexity. - Nicholas Brandt (TCC (1), 2024)

Levin-Kolmogorov Complexity is not in Linear Time. - Nicholas Brandt (IACR Cryptol. ePrint Arch., 2024)

A Formal Treatment of Key Transparency Systems with Scalability Improvements. - Nicholas Brandt; Mia Filic; Sam A. Markelon (IACR Cryptol. ePrint Arch., 2024)

Tightly-Secure Blind Signatures in Pairing-Free Groups. - Nicholas Brandt; Dennis Hofheinz; Michael Klooß; Michael Reichle (IACR Cryptol. ePrint Arch., 2024)

Unbiasable Verifiable Random Functions from Generic Assumptions. - Nicholas Brandt (IACR Cryptol. ePrint Arch., 2025)

Constrained Verifiable Random Functions Without Obfuscation and Friends. - Nicholas Brandt; Miguel Cueto Noval; Christoph U. Günther; Akin Ünal; Stella Wohnig (IACR Cryptol. ePrint Arch., 2025)