David Derler

David Derler

Auto-generated profile, based on publicly available information

David Derler

DFINITY

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 October 2017
Verified
Conference Paper
Open access
MCMelissa Chase
Melissa Chase
DDDavid Derler
David Derler
SGSteven Goldfeder
Steven Goldfeder
COClaudio Orlandi
Claudio Orlandi
Sebastian RamacherSebastian Ramacher
Sebastian Ramacher
GZGreg Zaverucha
Greg Zaverucha
We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives, believed to be quantum-secure, and (b) have extremely small keypairs, and, (c) are highly parameterizable. In our signature constructions, the public key is an image y=f(x) of a one-way function f and secret key x. A signature is a non-interactive zero-knowledge proof of x, that incorporates a message to be signed. For this proof, we leverage recent progress of Giacomelli et al. (USENIX'16) in constructing an efficient Σ-protocol for statements over general circuits. We improve this Σ-protocol to reduce proof sizes by a factor of two, at no additional computational cost. While this is of independent interest as it yields more compact proofs for any circuit, it also decreases our signature sizes. We consider two possibilities to make the proof non-interactive: the Fiat-Shamir transform and Unruh's transform (EUROCRYPT'12, '15,'16). The former has smaller signatures, while the latter has a security analysis in the quantum-accessible random oracle model. By customizing Unruh's transform to our application, the overhead is reduced to 1.6x when compared to the Fiat-Shamir transform, which does not have a rigorous post-quantum security analysis. We implement and benchmark both approaches and explore the possible choice of f, taking advantage of the recent trend to strive for practical symmetric ciphers with a particularly low number of multiplications and end up using Low MC (EUROCRYPT'15).

1 January 2019
Verified
Conference Paper
Closed access
DDDavid Derler
David Derler
KSKai Samelin
Kai Samelin
DSDaniel Slamanig
Daniel Slamanig
CSChristoph Striecks
Christoph Striecks

26 February 2017
Verified
Book Chapter
Closed access
PDF file
JCJan Camenisch
Jan Camenisch
DDDavid Derler
David Derler
SKStephan Krenn
Stephan Krenn
HPHenrich C. Pöhls
Henrich C. Pöhls
KSKai Samelin
Kai Samelin
DSDaniel Slamanig
Daniel Slamanig


31 March 2018
Verified
Book Chapter
Closed access
PDF file
DDDavid Derler
David Derler
TJTibor Jager
Tibor Jager
DSDaniel Slamanig
Daniel Slamanig
CSChristoph Striecks
Christoph Striecks

29 May 2018
Verified
Conference Paper
Open access
DDDavid Derler
David Derler
DSDaniel Slamanig
Daniel Slamanig