Nicholas Brandt

12 papers Journal 7Unranked 5
YearRankTypeTitle / Venue / Authors
2025 — conf
Constrained Verifiable Random Functions Without Obfuscation and Friends.
TCC (4)
Nicholas Brandt, Miguel Cueto Noval, Christoph U. Günther, Akin Ünal, Stella Wohnig
2025 J jnl
Constrained Verifiable Random Functions Without Obfuscation and Friends.
IACR Cryptol. ePrint Arch.
Nicholas Brandt, Miguel Cueto Noval, Christoph U. Günther, Akin Ünal, Stella Wohnig
2025 — conf
Tightly-Secure Blind Signatures in Pairing-Free Groups.
ASIACRYPT (6)
Nicholas Brandt, Dennis Hofheinz, Michael Klooß, Michael Reichle
2025 J jnl
Unbiasable Verifiable Random Functions from Generic Assumptions.
IACR Cryptol. ePrint Arch.
Nicholas Brandt
2024 J jnl
A Formal Treatment of Key Transparency Systems with Scalability Improvements.
IACR Cryptol. ePrint Arch.
Nicholas Brandt, Mia Filic, Sam A. Markelon
2024 J jnl
Levin-Kolmogorov Complexity is not in Linear Time.
IACR Cryptol. ePrint Arch.
Nicholas Brandt
2024 — conf
Lower Bounds for Levin-Kolmogorov Complexity.
TCC (1)
Nicholas Brandt
2024 J jnl
Tightly-Secure Blind Signatures in Pairing-Free Groups.
IACR Cryptol. ePrint Arch.
Nicholas Brandt, Dennis Hofheinz, Michael Klooß, Michael Reichle
2023 — conf
On the Correlation Complexity of MPC with Cheater Identification.
FC (1)
Nicholas Brandt, Sven Maier, Tobias Müller, Jörn Müller-Quade
2022 — conf
The Price of Verifiability: Lower Bounds for Verifiable Random Functions.
TCC (2)
Nicholas Brandt, Dennis Hofheinz, Julia Kastner, Akin Ünal
2022 J jnl
The Price of Verifiability: Lower Bounds for Verifiable Random Functions.
IACR Cryptol. ePrint Arch.
Nicholas Brandt, Dennis Hofheinz, Julia Kastner, Akin Ünal
2021 J jnl
Tight Setup Bounds for Identifiable Abort.
IACR Cryptol. ePrint Arch.
Nicholas Brandt