Markulf Kohlweiss

Prof. Markulf Kohlweiss

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 July 2014
Verified
Conference Paper
Open access
MCMelissa Chase
Melissa Chase
MKMarkulf Kohlweiss
Markulf Kohlweiss
ALAnna Lysyanskaya
Anna Lysyanskaya
SMSarah Meiklejohn
Sarah Meiklejohn
A signature scheme is malleable if, on input a message and a signature, it is possible to efficiently compute a signature on a related message, for a transformation that is allowed with respect to this signature scheme. In this paper, we first provide new definitions for malleable signatures that allow us to capture a broader range of transformations than was previously possible. We then give a generic construction based on malleable zero-knowledge proofs that allows us to construct malleable signatures for a wide range of transformation classes, with security properties that are stronger than those that have been achieved previously. Finally, we construct delegatable anonymous credentials from signatures that are malleable with respect to an appropriate class of transformations (that we show our malleable signature supports). The resulting instantiation satisfies a stronger security notion than previous schemes while also scaling linearly with the number of delegations.

8 July 2015 in Journal of Cryptology
Verified
Journal Article
Open access
PDF file
MAMasayuki Abe
Masayuki Abe
MCMelissa Chase
Melissa Chase
BDBernardo David
Bernardo David
MKMarkulf Kohlweiss
Markulf Kohlweiss
RNRyo Nishimaki
Ryo Nishimaki
MOMiyako Ohkubo
Miyako Ohkubo
This paper presents efficient structure-preserving signature schemes based on simple assumptions such as decisional linear. We first give two general frameworks for constructing fully secure signature schemes from weaker building blocks such as variations of one-time signatures and random message secure signatures. They can be seen as refinements of the Even–Goldreich–Micali framework, and preserve many desirable properties of the underlying schemes such as constant signature size and structure preservation. We then instantiate them based on simple (i.e., not q-type) assumptions over symmetric and asymmetric bilinear groups. The resulting schemes are structure-preserving and yield constant-size signatures consisting of 11–14 group elements, which compares favorably to existing schemes whose security relies on q-type assumptions.

5 September 2022
Verified
Book Chapter
Closed access
PDF file
CGChaya Ganesh
Chaya Ganesh
HKHamidreza Khoshakhlagh
Hamidreza Khoshakhlagh
MKMarkulf Kohlweiss
Markulf Kohlweiss
ANAnca Nitulescu
Anca Nitulescu
MZMichał Zając
Michał Zając

1 December 2021
Verified
Book Chapter
Closed access
PDF file
MKMarkulf Kohlweiss
Markulf Kohlweiss
MMMary Maller
Mary Maller
JSJanno Siim
Janno Siim
MVMikhail Volkhov
Mikhail Volkhov

27 November 2023
Verified
Book Chapter
Closed access
PDF file
AFAntonio Faonio
Antonio Faonio
DFDario Fiore
Dario Fiore
MKMarkulf Kohlweiss
Markulf Kohlweiss
LRLuigi Russo
Luigi Russo
MZMichal Zajac
Michal Zajac

19 December 2023
Verified
Book Chapter
Closed access
PDF file
ECElizabeth Crites
Elizabeth Crites
MKMarkulf Kohlweiss
Markulf Kohlweiss
BPBart Preneel
Bart Preneel
MSMahdi Sedaghat
Mahdi Sedaghat
DSDaniel Slamanig
Daniel Slamanig