Markulf Kohlweiss



K.U.Leuven, ESAT/COSIC
Kasteelpark Arenberg 10
B-3001 Leuven-Heverlee
Belgium

office: 01.47
phone: +32 (0)16 32 96 16

About me

I am a PhD student at the COSIC (Computer Security and Industrial Cryptography) group at the Department of Electrical Engineering (ESAT) of the K.U.Leuven.

In September 2004 I started to work as a researcher in the European PRIME project, first in Frankfurt in the group on mobile business at the Johann Wolfgang Goethe University and then as a PhD student of the COSIC. I am currently working for the follow up project PrimeLife.

Before that, I received the degree of Master in Computer Science (Diplom Ingenieur, Dipl.-Ing.) from the University of Klagenfurt, Austria and visited IBM Research Zurich for half a year to do my master thesis.

Journal publications

Exploiting cryptography for privacy-enhanced access control,
by Claudio A. Ardagna, Jan Camenisch, Markulf Kohlweiss, Ronald Leenes, Gregory Neven, Bart Priem, Pierangela Samarati, Dieter Sommer, and Mario Verdicchio. To appear in Journal of Computer Security, 2009.
Privacy preserving electronic petitions,
by C. Diaz, E. Kosta, H. Dekeyser, M. Kohlweiss, and G. Nigusse. Identity in the Information Society 1(1), 14 pages, 2009.

Conference publications

Randomizable Proofs and Delegatable Anonymous Credentials,
by M. Belenkiy, J. Camenisch, M. Chase, M. Kohlweiss, A. Lysyanskaya, and H. Shacham. In Advances in Cryptology - CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, 32 pages, 2009.
Compact E-Cash and Simulatable VRFs Revisited,
by M. Belenkiy, M. Chase, M. Kohlweiss, and A. Lysyanskaya. In Pairing-Based Cryptography - Pairing 2009, Lecture Notes in Computer Science, Springer-Verlag, 27 pages, 2009.
Universally Composable Adaptive Priced Oblivious Transfer,
by A. Rial, M. Kohlweiss, and B. Preneel. In Pairing-Based Cryptography - Pairing 2009, Lecture Notes in Computer Science, Springer-Verlag, 24 pages, 2009.
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials,
by J. Camenisch, M. Kohlweiss, and C. Soriente, In Public Key Cryptography, 12th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2009, Lecture Notes in Computer Science, Springer-Verlag, 20 pages, 2009.
Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data,
by J. Camenisch, M. Kohlweiss, A. Rial, and C. Sheedy. In Public Key Cryptography, 12th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2009, Lecture Notes in Computer Science, Springer-Verlag, 19 pages, 2009.
Self-certified Sybil-free Pseudonyms,
by C. Andersson, M. Kohlweiss, L. Martucci, and A. Panchenko. In 1st ACM Conference on Wireless Network Security (WiSec 2008), ACM, 6 pages, 2008.
P-signatures and Noninteractive Anonymous Credentials,
by M. Belenkiy, M. Chase, M. Kohlweiss, and A. Lysyanskaya. In Theory of Cryptography Conference (TCC 2008), Lecture Notes in Computer Science, Springer-Verlag, 18 pages, 2008.
Efficient Oblivious Augmented Maps: Location-Based Services with a Payment Broker,
by M. Kohlweiss, S. Faust, L. Fritsch, B. Gedrojc, and B. Preneel. PET 2007.
How to Win the Clone Wars: Efficient Periodic n-Times Anonymous Authentication,
by Jan Camenisch, Susan Hohenberger, Markulf Kohlweiss, Anna Lysyanskaya and Mira Meyerovich. ACM CCS 2006.
Privacy for Profitable Location Based Services,
by Tobias Kölsch, Lothar Fritsch, Markulf Kohlweiss and Dogan Kesdogan. SPC 2005.

Workshop publications and posters

Enforcing Access Control in Social Networks,
F. Beato, M. Kohlweiss, and K. Wouters. HotPets 2009, 10 pages, 2009.
Threshold Things That Think: Usable Authorisation for Resharing,
by R. Peeters, M. Kohlweiss, B. Preneel, and N. Sulmon. In Symposium on Usable Privacy and Security - SOUPS 2009, L. F. Cranor (ed.), ACM, 2 pages, 2009.

Talks

Randomizable Proofs and Delegatable Anonymous Credentials at 29th International Cryptology Conference, CRYPTO 2009, Santa Barbara, California, USA, on August 16-20, 2009
Multiple talks by CWI Amsterdam and COSIC KULeuven: Randomizable Proofs and Delegatable Anonymous Credentials in COSIC seminar (K.U.Leuven, COSIC) on 22 Jun. 2009
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials at 12th International Conference on Practice and Theory in Public Key Cryptography, PKC 2009, Irvine, CA, USA, on March 18-20, 2009
Efficient Oblivious Augmented Maps: Location-Based Services with a Payment Broker at Privacy Enhancing Technologies, 7th International Symposium, PET 2007 Ottawa, Canada, on June 20-22, 2007
How to Win the Clone Wars: Efficient Periodic n-Times Anonymous Authentication at 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, on Oct 30 - Nov 03, 2006
How to Win the Clone Wars: Efficient Periodic n-Times Anonymous Authentication in COSIC seminar (K.U.Leuven, COSIC) on 25 Oct. 2006

Master students

Together with Claudia and Carmela, I have supervised Josep Balasch (Polytechnic University of Catalonia, Spain) between February and July 2008. Josep worked on a smart card implementation of an anonymous credential protocol.
Together with Claudia and Carmela, I have supervised the master thesis of Victor Sucasas (University of Vigo, Spain) between February and July 2008. Victor implemented an anonymous credential protocol.
Together with Claudia, I have supervised Alfredo Rial (University of Vigo, Spain) from September 2007 to March 2008. Alfredo worked on oblivious transfer protocols, in particular on Public-key Encryption with Oblivious Keyword Search, and on Priced Oblivious Transfer.
Together with Claudia, I have supervised Girma Enideg Nigusse (Royal Institute of Technology (KTH), Sweden) from April to September 2007. Girma has implemented an electronic petition demonstrator based on the Idemix anonymous credentials.

Other Homepages

ESAT/COSIC Member Information