| 2013 | ||
|---|---|---|
| c28 | Masayuki Abe, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo: Tagged One-Time Signatures: Tight Security and Optimal Tag Size. Public Key Cryptography 2013: 312-331 | |
| c27 | Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn: Verifiable Elections That Scale for Free. Public Key Cryptography 2013: 479-496 | |
| c26 | Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn: Succinct Malleable NIZKs and an Application to Compact Shuffles. TCC 2013: 100-119 | |
| i15 | Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn: Malleable Signatures: Complex Unary Transformations and Delegatable Anonymous Credentials. IACR Cryptology ePrint Archive 2013: 179 (2013) | |
| i14 | Markulf Kohlweiss, Ueli Maurer, Cristina Onete, Björn Tackmann, Daniele Venturi: Anonymity-preserving Public-Key Encryption: A Constructive Approach. IACR Cryptology ePrint Archive 2013: 238 (2013) | |
| 2012 | ||
| c25 | Masayuki Abe, Melissa Chase, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo: Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. ASIACRYPT 2012: 4-24 | |
| c24 | Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn: Malleable Proof Systems and Applications. EUROCRYPT 2012: 281-300 | |
| c23 | Sebastian Faust, Markulf Kohlweiss, Giorgia Azzurra Marson, Daniele Venturi: On the Non-malleability of the Fiat-Shamir Transform. INDOCRYPT 2012: 60-79 | |
| c22 | George Danezis, Markulf Kohlweiss, Benjamin Livshits, Alfredo Rial: Private Client-Side Profiling with Random Forests and Hidden Markov Models. Privacy Enhancing Technologies 2012: 18-37 | |
| c21 | Melissa Chase, Markulf Kohlweiss: A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN. SCN 2012: 131-148 | |
| i13 | Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn: Malleable Proof Systems and Applications. IACR Cryptology ePrint Archive 2012: 12 (2012) | |
| i12 | Masayuki Abe, Melissa Chase, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo: Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. IACR Cryptology ePrint Archive 2012: 285 (2012) | |
| i11 | Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn: Succinct Malleable NIZKs and an Application to Compact Shuffles. IACR Cryptology ePrint Archive 2012: 506 (2012) | |
| i10 | Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn: Verifiable Elections That Scale for Free. IACR Cryptology ePrint Archive 2012: 697 (2012) | |
| i9 | Sebastian Faust, Markulf Kohlweiss, Giorgia Azzurra Marson, Daniele Venturi: On the Non-malleability of the Fiat-Shamir Transform. IACR Cryptology ePrint Archive 2012: 704 (2012) | |
| 2011 | ||
| c20 | Jan Camenisch, Kristiyan Haralambiev, Markulf Kohlweiss, Jorn Lapon, Vincent Naessens: Structure Preserving CCA Secure Encryption and Applications. ASIACRYPT 2011: 89-106 | |
| c19 | Cédric Fournet, Markulf Kohlweiss, Pierre-Yves Strub: Modular code-based cryptographic verification. ACM Conference on Computer and Communications Security 2011: 341-350 | |
| c18 | Jorn Lapon, Markulf Kohlweiss, Bart De Decker, Vincent Naessens: Analysis of Revocation Strategies for Anonymous Idemix Credentials. Communications and Multimedia Security 2011: 3-17 | |
| c17 | George Danezis, Markulf Kohlweiss, Alfredo Rial: Differentially Private Billing with Rebates. Information Hiding 2011: 148-162 | |
| c16 | Klaus Kursawe, George Danezis, Markulf Kohlweiss: Privacy-Friendly Aggregation for the Smart-Grid. PETS 2011: 175-191 | |
| c15 | Filipe Beato, Markulf Kohlweiss, Karel Wouters: Scramble! Your Social Network Data. PETS 2011: 211-225 | |
| p2 | Jan Camenisch, Markulf Kohlweiss, Dieter Sommer: Pseudonyms and Private Credentials. Digital Privacy - PRIME 2011: 289-308 | |
| p1 | Anas Abou El Kalam, Carlos Aguilar Melchor, Stefan Berthold, Jan Camenisch, Sebastian Clauß, Yves Deswarte, Markulf Kohlweiss, Andriy Panchenko, Lexi Pimenidis, Matthieu Roy: Further Privacy Mechanisms. Digital Privacy - PRIME 2011: 485-555 | |
| i8 | George Danezis, Markulf Kohlweiss, Alfredo Rial: Differentially Private Billing with Rebates. IACR Cryptology ePrint Archive 2011: 134 (2011) | |
| i7 | Jan Camenisch, Kristiyan Haralambiev, Markulf Kohlweiss, Jorn Lapon, Vincent Naessens: Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties. IACR Cryptology ePrint Archive 2011: 319 (2011) | |
| i6 | Melissa Chase, Markulf Kohlweiss: A Domain Transformation for Structure-Preserving Signatures on Group Elements. IACR Cryptology ePrint Archive 2011: 342 (2011) | |
| 2010 | ||
| j1 | Claudio Agostino Ardagna, Jan Camenisch, Markulf Kohlweiss, Ronald Leenes, Gregory Neven, Bart Priem, Pierangela Samarati, Dieter Sommer, Mario Verdicchio: Exploiting cryptography for privacy-enhanced access control: A result of the PRIME Project. Journal of Computer Security 18(1): 123-160 (2010) | |
| c14 | Jan Camenisch, Markulf Kohlweiss, Claudio Soriente: Solving Revocation with Efficient Update of Anonymous Credentials. SCN 2010: 454-471 | |
| c13 | Jorn Lapon, Markulf Kohlweiss, Bart De Decker, Vincent Naessens: Performance Analysis of Accumulator-Based Revocation Mechanisms. SEC 2010: 289-301 | |
| 2009 | ||
| c12 | Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Hovav Shacham: Randomizable Proofs and Delegatable Anonymous Credentials. CRYPTO 2009: 108-125 | |
| c11 | Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya: Compact E-Cash and Simulatable VRFs Revisited. Pairing 2009: 114-131 | |
| c10 | Alfredo Rial, Markulf Kohlweiss, Bart Preneel: Universally Composable Adaptive Priced Oblivious Transfer. Pairing 2009: 231-247 | |
| c9 | Jan Camenisch, Markulf Kohlweiss, Alfredo Rial, Caroline Sheedy: Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data. Public Key Cryptography 2009: 196-214 | |
| c8 | Jan Camenisch, Markulf Kohlweiss, Claudio Soriente: An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. Public Key Cryptography 2009: 481-500 | |
| c7 | Roel Peeters, Markulf Kohlweiss, Bart Preneel, Nicky Sulmon: Threshold things that think: usable authorization for resharing. SOUPS 2009 | |
| i5 | Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya: Compact E-Cash and Simulatable VRFs Revisited. IACR Cryptology ePrint Archive 2009: 107 (2009) | |
| 2008 | ||
| c6 | Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya: P-signatures and Noninteractive Anonymous Credentials. TCC 2008: 356-374 | |
| c5 | Leonardo A. Martucci, Markulf Kohlweiss, Christer Andersson, Andriy Panchenko: Self-certified Sybil-free pseudonyms. WISEC 2008: 154-159 | |
| c4 | Christer Andersson, Markulf Kohlweiss, Leonardo A. Martucci, Andriy Panchenko: A Self-certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup. WISTP 2008: 64-77 | |
| i4 | Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Hovav Shacham: Delegatable Anonymous Credentials. IACR Cryptology ePrint Archive 2008: 428 (2008) | |
| i3 | Jan Camenisch, Markulf Kohlweiss, Claudio Soriente: An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. IACR Cryptology ePrint Archive 2008: 539 (2008) | |
| 2007 | ||
| c3 | Markulf Kohlweiss, Sebastian Faust, Lothar Fritsch, Bartek Gedrojc, Bart Preneel: Efficient Oblivious Augmented Maps: Location-Based Services with a Payment Broker. Privacy Enhancing Technologies 2007: 77-94 | |
| i2 | Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya: Non-Interactive Anonymous Credentials. IACR Cryptology ePrint Archive 2007: 384 (2007) | |
| 2006 | ||
| c2 | Jan Camenisch, Susan Hohenberger, Markulf Kohlweiss, Anna Lysyanskaya, Mira Meyerovich: How to win the clonewars: efficient periodic n-times anonymous authentication. ACM Conference on Computer and Communications Security 2006: 201-210 | |
| i1 | Jan Camenisch, Susan Hohenberger, Markulf Kohlweiss, Anna Lysyanskaya, Mira Meyerovich: How to Win the Clone Wars: Efficient Periodic n-Times Anonymous Authentication. IACR Cryptology ePrint Archive 2006: 454 (2006) | |
| 2005 | ||
| c1 | Tobias Kölsch, Lothar Fritsch, Markulf Kohlweiss, Dogan Kesdogan: Privacy for Profitable Location Based Services. SPC 2005: 164-178 | |
Data released under the ODC-BY 1.0 license — See also our legal information page