| Privacy-friendly aggregation for the smart-grid K Kursawe, G Danezis, M Kohlweiss International Symposium on Privacy Enhancing Technologies Symposium, 175-191, 2011 | 398 | 2011 |
| Randomizable proofs and delegatable anonymous credentials M Belenkiy, J Camenisch, M Chase, M Kohlweiss, A Lysyanskaya, ... Annual International Cryptology Conference, 108-125, 2009 | 293 | 2009 |
| How to win the clonewars: efficient periodic n-times anonymous authentication J Camenisch, S Hohenberger, M Kohlweiss, A Lysyanskaya, ... Proceedings of the 13th ACM conference on Computer and communications …, 2006 | 283 | 2006 |
| A messy state of the union: Taming the composite state machines of TLS B Beurdouche, K Bhargavan, A Delignat-Lavaud, C Fournet, M Kohlweiss, ... 2015 IEEE Symposium on Security and Privacy, 535-552, 2015 | 271 | 2015 |
| An accumulator based on bilinear maps and efficient revocation for anonymous credentials J Camenisch, M Kohlweiss, C Soriente International workshop on public key cryptography, 481-500, 2009 | 263 | 2009 |
| P-signatures and noninteractive anonymous credentials M Belenkiy, M Chase, M Kohlweiss, A Lysyanskaya Theory of Cryptography, 356-374, 2008 | 247 | 2008 |
| Dependent types and multi-monadic effects in F N Swamy, C Hriţcu, C Keller, A Rastogi, A Delignat-Lavaud, S Forest, ... Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2016 | 238 | 2016 |
| Implementing TLS with verified cryptographic security K Bhargavan, C Fournet, M Kohlweiss, A Pironti, PY Strub 2013 IEEE Symposium on Security and Privacy, 445-459, 2013 | 192 | 2013 |
| Geppetto: Versatile verifiable computation C Costello, C Fournet, J Howell, M Kohlweiss, B Kreuter, M Naehrig, ... 2015 IEEE Symposium on Security and Privacy, 253-270, 2015 | 172 | 2015 |
| Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data J Camenisch, M Kohlweiss, A Rial, C Sheedy International Workshop on Public Key Cryptography, 196-214, 2009 | 148 | 2009 |
| Scramble! your social network data F Beato, M Kohlweiss, K Wouters International Symposium on Privacy Enhancing Technologies Symposium, 211-225, 2011 | 123 | 2011 |
| Constant-size structure-preserving signatures: Generic constructions and simple assumptions M Abe, M Chase, B David, M Kohlweiss, R Nishimaki, M Ohkubo Journal of Cryptology 29 (4), 833-878, 2016 | 112 | 2016 |
| One-out-of-many proofs: Or how to leak a secret and spend a coin J Groth, M Kohlweiss Annual International Conference on the Theory and Applications of …, 2015 | 106 | 2015 |
| Pinocchio coin: building zerocoin from a succinct pairing-based proof system G Danezis, C Fournet, M Kohlweiss, B Parno Proceedings of the First ACM workshop on Language support for privacy …, 2013 | 106 | 2013 |
| Square span programs with applications to succinct NIZK arguments G Danezis, C Fournet, J Groth, M Kohlweiss International Conference on the Theory and Application of Cryptology and …, 2014 | 89 | 2014 |
| On the non-malleability of the Fiat-Shamir transform S Faust, M Kohlweiss, GA Marson, D Venturi International Conference on Cryptology in India, 60-79, 2012 | 85 | 2012 |
| Proving the TLS handshake secure (as it is) K Bhargavan, C Fournet, M Kohlweiss, A Pironti, PY Strub, ... Annual Cryptology Conference, 235-255, 2014 | 84 | 2014 |
| Malleable proof systems and applications M Chase, M Kohlweiss, A Lysyanskaya, S Meiklejohn Annual International Conference on the Theory and Applications of …, 2012 | 83 | 2012 |
| Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured reference strings M Maller, S Bowe, M Kohlweiss, S Meiklejohn Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019 | 82 | 2019 |
| Differentially private billing with rebates G Danezis, M Kohlweiss, A Rial International Workshop on Information Hiding, 148-162, 2011 | 81 | 2011 |
Jan CamenischDFINITYVerified email at dfinity.org
