[go: up one dir, main page]

Follow
Markulf Kohlweiss
Markulf Kohlweiss
Verified email at ed.ac.uk
Title
Cited by
Cited by
Year
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
5842016
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
5492019
Privacy-friendly aggregation for the smart-grid
K Kursawe, G Danezis, M Kohlweiss
International symposium on privacy enhancing technologies symposium, 175-191, 2011
5332011
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
4422017
Randomizable proofs and delegatable anonymous credentials
M Belenkiy, J Camenisch, M Chase, M Kohlweiss, A Lysyanskaya, ...
Annual international cryptology conference, 108-125, 2009
4172009
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
4172009
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
3652006
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
3482015
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
3382015
P-signatures and noninteractive anonymous credentials
M Belenkiy, M Chase, M Kohlweiss, A Lysyanskaya
Theory of Cryptography, 356-374, 2008
3252008
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
2902013
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
2832018
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
2132012
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
1972009
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
1842014
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
174*2017
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
1622013
Composable and modular anonymous credentials: Definitions and practical constructions
J Camenisch, M Dubovitskaya, K Haralambiev, M Kohlweiss
International Conference on the Theory and Application of Cryptology and …, 2015
1582015
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
1462016
Ouroboros crypsinous: Privacy-preserving proof-of-stake
T Kerber, A Kiayias, M Kohlweiss, V Zikas
2019 IEEE Symposium on Security and Privacy (SP), 157-174, 2019
1422019
The system can't perform the operation now. Try again later.
Articles 1–20