Nicholas Brandt

According to our database, Nicholas Brandt authored at least 10 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

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

Proceedings of the Theory of Cryptography - 23rd International Conference, 2025

Tightly-Secure Blind Signatures in Pairing-Free Groups.

Nicholas Brandt, Dennis Hofheinz, Michael Klooß, Michael Reichle

Proceedings of the Advances in Cryptology - ASIACRYPT 2025, 2025

2024

A Formal Treatment of Key Transparency Systems with Scalability Improvements.

Nicholas Brandt, Mia Filic, Sam A. Markelon

IACR Cryptol. ePrint Arch., 2024

Levin-Kolmogorov Complexity is not in Linear Time.

Nicholas Brandt

IACR Cryptol. ePrint Arch., 2024

Lower Bounds for Levin-Kolmogorov Complexity.

Nicholas Brandt

Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

2023

On the Correlation Complexity of MPC with Cheater Identification.

Nicholas Brandt, Sven Maier, Tobias Müller, Jörn Müller-Quade

Proceedings of the Financial Cryptography and Data Security, 2023

2022

The Price of Verifiability: Lower Bounds for Verifiable Random Functions.

Nicholas Brandt, Dennis Hofheinz, Julia Kastner, Akin Ünal

Proceedings of the Theory of Cryptography - 20th International Conference, 2022

2021

Tight Setup Bounds for Identifiable Abort.

Nicholas Brandt

IACR Cryptol. ePrint Arch., 2021

2020

Constructing Secure Multi-Party Computation with Identifiable Abort.

Nicholas-Philip Brandt, Sven Maier, Tobias Müller, Jörn Müller-Quade

IACR Cryptol. ePrint Arch., 2020