Markulf Kohlweiss
POST DOC RESEARCHER
.
I am currently doing a postdoc at Microsoft Research Cambridge in the Programming Principles and Tools group. I am a member of the Security sub group.
Before that, I did my PhD at 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 (Privacy Enhancing Identity Management for Everyone), first in Frankfurt in the group on mobile business at the Johann Wolfgang Goethe University and then as a PhD student at COSIC. After the end of the projet I continued to work for some time on the follow up project PrimeLife.
Even earlier, 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.
I am currently collaborating with the following colleagues on privacy-friendly smart metering and formal verification of cryptographic protocols.
Cryptography Verification Kit
Privacy-friendly Smart Metering
Publications
- Klaus Kursawe, Markulf Kohlweiss, and George Danezis, Privacy-friendly Aggregation for the Smart-grid, 1 March 2011
- George Danezis, Markulf Kohlweiss, and Alfredo Rial, Differentially Private Billing with Rebates, no. MSR-TR-2011-10, 2 February 2011
- Filipe Beato, Markulf Kohlweiss, and Karel Wouters, Scramble! Your Social Network Data, 2011
- Melissa Chase and Markulf Kohlweiss, A Domain Transformation for Structure-Preserving Signatures on Group Elements, in IACR Cryptology ePrint Archive, vol. 2011, pp. 342, 2011
- Jan Camenisch, Kristiyan Haralambiev, Markulf Kohlweiss, Jorn Lapon, and Vincent Naessens, Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties, in IACR Cryptology ePrint Archive, vol. 2011, pp. 319, 2011
- Cédric Fournet, Markulf Kohlweiss, and Pierre-Yves Strub, Modular code-based cryptographic verification, in ACM Conference on Computer and Communications Security, ACM, 2011
- Jorn Lapon, Markulf Kohlweiss, Bart De Decker, and Vincent Naessens, Analysis of Revocation Strategies for Anonymous Idemix Credentials, in Communications and Multimedia Security, Springer, 2011
- Claudio A. Ardagna, Jan Camenisch, Markulf Kohlweiss, Ronald Leenes, Gregory Neven, Bart Priem, Pierangela Samarati, Dieter Sommer, and Mario Verdicchio, Exploiting Cryptography for Privacy-Enhanced Access Control: A result of the PRIME Project, in Journal of Computer Security - JCS, vol. 18, no. 1, pp. 123–160, IOS Press, 2010
- Jan Camenisch, Markulf Kohlweiss, and Claudio Soriente, Solving Revocation with Efficient Update of Anonymous Credentials, in Security and Cryptography for Networks, 7th International, Springer, 2010
- Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, and Anna Lysyanskaya, Compact E-Cash and Simulatable VRFs Revisited, in Pairing 2009, Springer Verlag, August 2009
- Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, and Hovav Shacham, Randomizable Proofs and Delegatable Anonymous Credentials, in CRYPTO 2009, Springer Verlag, August 2009
- Claudia Diaz, Eleni Kosta, Hannelore Dekeyser, Markulf Kohlweiss, and Girma Nigusse, Privacy preserving electronic petitions, in Identity in the Information Society, vol. 1, no. 1, pp. 14, 2009
- Roel Peeters, Markulf Kohlweiss, Bart Preneel, and Nicky Sulmon, Threshold things that think: usable authorization for resharing, 2009
- Jan Camenisch, Markulf Kohlweiss, and Claudio Soriente, An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials, 2009
- Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, and Anna Lysyanskaya, Compact E-Cash and Simulatable VRFs Revisited, 2009
- Jan Camenisch, Markulf Kohlweiss, Alfredo Rial, and Caroline Sheedy, Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data, 2009
- Alfredo Rial, Markulf Kohlweiss, and Bart Preneel, Universally Composable Adaptive Priced Oblivious Transfer, in Pairing-Based Cryptography - Pairing, Springer Verlag, 2009
- Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, and Anna Lysyanskaya, P-signatures and Noninteractive Anonymous Credentials, in Theory of Cryptography Conference 2008, Springer Verlag, February 2008
- Christer Andersson, Markulf Kohlweiss, Leonardo Martucci, and Andriy Panchenko, Self-certified Sybil-free Pseudonyms, in 1st ACM Conference on Wireless Network Security – WiSec 2008, Alexandria,VI,USA, 2008
- Christer Andersson, Markulf Kohlweiss, Leonardo Martucci, and Andriy Panchenko, A Self-certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup, in Information Security Theory and Practices. Smart Devices, Convergence and Next Generation Networks – WISTP 2008, Seville, Spain, 2008
- Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, and Hovav Shacham, Randomizable Proofs and Delegatable Anonymous Credentials, in CRYPTO 2009, 2008
- Markulf Kohlweiss, Sebastian Faust, Lothar Fritsch, Bartek Gedrojc, and Bart Preneel, Efficient Oblivious Augmented Maps: Location-Based Services with a Payment Broker, 2007
- Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, and Anna Lysyanskaya, Non-Interactive Anonymous Credentials, 2007
- Jan Camenisch, Susan Hohenberger, Markulf Kohlweiss, Anna Lysyanskaya, and Mira Meyerovich, How to Win the Clone Wars: Efficient Periodic n-Times Anonymous Authentication, ACM, 2006
- Tobias Kölsch, Lothar Fritsch, Markulf Kohlweiss, and Dogan Kesdogan, Privacy for Profitable Location Based Services., in SPC 2005: 2nd International Conference on Security in Pervasive Computing, Boppard, Germany, 2005
