Markulf Kohlweiss
Markulf Kohlweiss
Geverifieerd e-mailadres voor ed.ac.uk
Geciteerd door
Geciteerd door
Privacy-friendly aggregation for the smart-grid
K Kursawe, G Danezis, M Kohlweiss
Privacy Enhancing Technologies: 11th International Symposium, PETS 2011 …, 2011
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
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
A messy state of the union: Taming the composite state machines of TLS
B Beurdouche, K Bhargavan, A Delignat-Lavaud, C Fournet, M Kohlweiss, ...
Communications of the ACM 60 (2), 99-107, 2017
Randomizable proofs and delegatable anonymous credentials
M Belenkiy, J Camenisch, M Chase, M Kohlweiss, A Lysyanskaya, ...
Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009
An accumulator based on bilinear maps and efficient revocation for anonymous credentials
J Camenisch, M Kohlweiss, C Soriente
Public Key Cryptography–PKC 2009: 12th International Conference on Practice …, 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
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
P-signatures and noninteractive anonymous credentials
M Belenkiy, M Chase, M Kohlweiss, A Lysyanskaya
Theory of Cryptography, 356-374, 2008
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
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
Updatable and universal common reference strings with applications to zk-SNARKs
J Groth, M Kohlweiss, M Maller, S Meiklejohn, I Miers
Annual International Cryptology Conference, 698-728, 2018
Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data
J Camenisch, M Kohlweiss, A Rial, C Sheedy
Public Key Cryptography–PKC 2009: 12th International Conference on Practice …, 2009
On the non-malleability of the Fiat-Shamir transform
S Faust, M Kohlweiss, GA Marson, D Venturi
Progress in Cryptology-INDOCRYPT 2012: 13th International Conference on …, 2012
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
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
Implementing and proving the TLS 1.3 record layer
A Delignat-Lavaud, C Fournet, M Kohlweiss, J Protzenko, A Rastogi, ...
2017 IEEE Symposium on Security and Privacy (SP), 463-482, 2017
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, 833-878, 2016
Scramble! your social network data
F Beato, M Kohlweiss, K Wouters
International Symposium on Privacy Enhancing Technologies Symposium, 211-225, 2011
Composable and modular anonymous credentials: Definitions and practical constructions
J Camenisch, M Dubovitskaya, K Haralambiev, M Kohlweiss
Advances in Cryptology–ASIACRYPT 2015: 21st International Conference on the …, 2015
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20