default search action

combined dblp search
author search
venue search
publication search

ask others

Nicholas Brandt

Nicholas-Philip Brandt

> Home > Persons

Person information

affiliation: ETH Zurich, Switzerland

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Conference and Workshop Papers

see FAQ

What is the meaning of the colors in the publication lists?

2023
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/fc/BrandtMMM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fc/BrandtMMM23
Nicholas Brandt, Sven Maier, Tobias Müller, Jörn Müller-Quade:
On the Correlation Complexity of MPC with Cheater Identification. FC (1) 2023: 129-146
2022
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/tcc/BrandtHKU22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tcc/BrandtHKU22
Nicholas Brandt, Dennis Hofheinz, Julia Kastner, Akin Ünal:
The Price of Verifiability: Lower Bounds for Verifiable Random Functions. TCC (2) 2022: 747-776

Informal and Other Publications

see FAQ

What is the meaning of the colors in the publication lists?

2024
[i4]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/Brandt24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/Brandt24
Nicholas Brandt:
Levin-Kolmogorov Complexity is not in Linear Time. IACR Cryptol. ePrint Arch. 2024: 687 (2024)
2022
[i3]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/BrandtHKU22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/BrandtHKU22
Nicholas Brandt, Dennis Hofheinz, Julia Kastner, Akin Ünal:
The Price of Verifiability: Lower Bounds for Verifiable Random Functions. IACR Cryptol. ePrint Arch. 2022: 762 (2022)
2021
[i2]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/Brandt21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/Brandt21
Nicholas Brandt:
Tight Setup Bounds for Identifiable Abort. IACR Cryptol. ePrint Arch. 2021: 684 (2021)
2020
[i1]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/BrandtMMM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/BrandtMMM20
Nicholas-Philip Brandt, Sven Maier, Tobias Müller, Jörn Müller-Quade:
Constructing Secure Multi-Party Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2020: 153 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.