Universally composable commitments R Canetti, M Fischlin Advances in Cryptology—CRYPTO 2001: 21st Annual International Cryptology …, 2001 | 790 | 2001 |
Random oracles in a quantum world D Boneh, Ö Dagdelen, M Fischlin, A Lehmann, C Schaffner, M Zhandry Advances in Cryptology–ASIACRYPT 2011, 41-69, 2011 | 546 | 2011 |
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires M Fischlin | 234 | 2001 |
Communication-efficient non-interactive proofs of knowledge with online extractors M Fischlin Annual International Cryptology Conference, 152-168, 2005 | 233 | 2005 |
Deterministic encryption: Definitional equivalences and constructions without random oracles M Bellare, M Fischlin, A O’Neill, T Ristenpart Advances in Cryptology–CRYPTO 2008: 28th Annual International Cryptology …, 2008 | 207 | 2008 |
Physically uncloneable functions in the universal composition framework C Brzuska, M Fischlin, H Schröder, S Katzenbeisser Advances in Cryptology–CRYPTO 2011: 31st Annual Cryptology Conference, Santa …, 2011 | 186 | 2011 |
Security of sanitizable signatures revisited C Brzuska, M Fischlin, T Freudenreich, A Lehmann, M Page, J Schelbert, ... Public Key Cryptography–PKC 2009: 12th International Conference on Practice …, 2009 | 180 | 2009 |
Round-optimal composable blind signatures in the common reference string model M Fischlin Annual International Cryptology Conference, 60-77, 2006 | 173 | 2006 |
A cryptographic analysis of the TLS 1.3 handshake protocol candidates B Dowling, M Fischlin, F Günther, D Stebila Proceedings of the 22nd ACM SIGSAC conference on computer and communications …, 2015 | 165 | 2015 |
Efficient non-malleable commitment schemes M Fischlin, R Fischlin Advances in Cryptology—CRYPTO 2000, 413-431, 2000 | 162* | 2000 |
Redactable signatures for tree-structured data: Definitions and constructions C Brzuska, H Busch, O Dagdelen, M Fischlin, M Franz, S Katzenbeisser, ... Applied Cryptography and Network Security: 8th International Conference …, 2010 | 146 | 2010 |
Multi-stage key exchange and the case of Google's QUIC protocol M Fischlin, F Günther Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications …, 2014 | 142 | 2014 |
The Cramer-Shoup strong-RSA signature scheme revisited M Fischlin International Workshop on Public Key Cryptography, 116-129, 2002 | 141 | 2002 |
Security analysis of the PACE key-agreement protocol J Bender, M Fischlin, D Kügler Information Security: 12th International Conference, ISC 2009, Pisa, Italy …, 2009 | 129 | 2009 |
Identification protocols secure against reset attacks M Bellare, M Fischlin, S Goldwasser, S Micali Advances in Cryptology—EUROCRYPT 2001: International Conference on the …, 2001 | 122 | 2001 |
Unlinkability of sanitizable signatures C Brzuska, M Fischlin, A Lehmann, D Schröder Public Key Cryptography–PKC 2010: 13th International Conference on Practice …, 2010 | 119 | 2010 |
Random oracles with (out) programmability M Fischlin, A Lehmann, T Ristenpart, T Shrimpton, M Stam, S Tessaro International Conference on the Theory and Application of Cryptology and …, 2010 | 103 | 2010 |
Privately computing set-union and set-intersection cardinality via bloom filters R Egert, M Fischlin, D Gens, S Jacob, M Senker, J Tillmanns Information Security and Privacy: 20th Australasian Conference, ACISP 2015 …, 2015 | 102 | 2015 |
Composability of Bellare-Rogaway key exchange protocols C Brzuska, M Fischlin, B Warinschi, SC Williams Proceedings of the 18th ACM conference on Computer and communications …, 2011 | 95 | 2011 |
A closer look at PKI: Security and efficiency A Boldyreva, M Fischlin, A Palacio, B Warinschi Public Key Cryptography–PKC 2007: 10th International Conference on Practice …, 2007 | 90 | 2007 |